/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:11:51,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:11:51,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:11:51,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:11:51,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:11:51,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:11:51,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:11:51,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:11:51,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:11:51,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:11:51,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:11:51,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:11:51,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:11:51,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:11:51,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:11:51,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:11:51,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:11:51,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:11:51,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:11:51,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:11:51,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:11:51,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:11:51,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:11:51,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:11:51,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:11:51,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:11:51,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:11:51,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:11:51,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:11:51,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:11:51,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:11:51,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:11:51,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:11:51,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:11:51,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:11:51,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:11:51,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:11:51,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:11:51,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:11:51,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:11:51,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:11:51,909 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:11:51,922 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:11:51,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:11:51,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:11:51,924 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:11:51,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:11:51,924 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:11:51,924 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:11:51,925 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:11:51,925 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:11:51,925 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:11:51,925 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:11:51,925 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:11:51,926 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:11:51,926 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:11:51,926 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:11:51,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:11:51,926 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:11:51,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:11:51,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:11:51,927 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:11:51,927 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:11:51,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:11:51,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:11:51,928 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:11:51,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:11:51,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:11:51,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:11:51,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:11:51,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:11:52,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:11:52,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:11:52,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:11:52,108 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:11:52,108 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:11:52,109 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:11:52,209 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_mVO58M/tmp/4c21744810314e60ac32205bce456038/FLAG6df49f1a5 [2020-07-01 13:11:52,537 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:11:52,537 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:11:52,538 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:11:52,544 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_mVO58M/tmp/4c21744810314e60ac32205bce456038/FLAG6df49f1a5 [2020-07-01 13:11:52,947 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_mVO58M/tmp/4c21744810314e60ac32205bce456038 [2020-07-01 13:11:52,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:11:52,960 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:11:52,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:11:52,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:11:52,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:11:52,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:11:52" (1/1) ... [2020-07-01 13:11:52,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f828b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:52, skipping insertion in model container [2020-07-01 13:11:52,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:11:52" (1/1) ... [2020-07-01 13:11:52,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:11:52,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:11:53,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:11:53,233 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:11:53,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:11:53,263 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:11:53,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53 WrapperNode [2020-07-01 13:11:53,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:11:53,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:11:53,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:11:53,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:11:53,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:11:53,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:11:53,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:11:53,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:11:53,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:11:53,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:11:53,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:11:53,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:11:53,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:11:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:11:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:11:53,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:11:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:11:53,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:11:53,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:11:53,623 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:11:53,624 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 13:11:53,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53 BoogieIcfgContainer [2020-07-01 13:11:53,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:11:53,629 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:11:53,629 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:11:53,631 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:11:53,632 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,646 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 31 edges [2020-07-01 13:11:53,647 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:11:53,648 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:11:53,649 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:11:53,649 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:11:53,651 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:11:53,652 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:11:53,652 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:11:53,672 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:11:53,698 INFO L200 BlockEncoder]: SBE split 15 edges [2020-07-01 13:11:53,703 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:11:53,705 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:53,725 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 13:11:53,728 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:11:53,730 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:11:53,730 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:53,734 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-07-01 13:11:53,735 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:11:53,736 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:11:53,736 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:53,736 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:11:53,737 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:11:53,737 INFO L313 BlockEncoder]: Encoded RCFG 23 locations, 40 edges [2020-07-01 13:11:53,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:53 BasicIcfg [2020-07-01 13:11:53,738 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:11:53,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:11:53,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:11:53,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:11:53,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:11:52" (1/4) ... [2020-07-01 13:11:53,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21aa515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:11:53, skipping insertion in model container [2020-07-01 13:11:53,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (2/4) ... [2020-07-01 13:11:53,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21aa515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:11:53, skipping insertion in model container [2020-07-01 13:11:53,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53" (3/4) ... [2020-07-01 13:11:53,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21aa515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:53, skipping insertion in model container [2020-07-01 13:11:53,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:53" (4/4) ... [2020-07-01 13:11:53,749 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:11:53,760 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:11:53,769 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-07-01 13:11:53,783 INFO L251 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-07-01 13:11:53,806 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:11:53,807 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:11:53,807 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:11:53,807 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:11:53,807 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:11:53,807 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:11:53,808 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:11:53,808 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:11:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-01 13:11:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:53,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:53,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:53,830 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash 100877, now seen corresponding path program 1 times [2020-07-01 13:11:53,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:53,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101114148] [2020-07-01 13:11:53,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,000 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101114148] [2020-07-01 13:11:54,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552074769] [2020-07-01 13:11:54,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,025 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-07-01 13:11:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,118 INFO L93 Difference]: Finished difference Result 44 states and 75 transitions. [2020-07-01 13:11:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:54,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,132 INFO L225 Difference]: With dead ends: 44 [2020-07-01 13:11:54,132 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 13:11:54,135 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 13:11:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 13:11:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 13:11:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2020-07-01 13:11:54,172 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 37 transitions. Word has length 3 [2020-07-01 13:11:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,172 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 37 transitions. [2020-07-01 13:11:54,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 37 transitions. [2020-07-01 13:11:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:54,173 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:54,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:11:54,175 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,175 INFO L82 PathProgramCache]: Analyzing trace with hash 100939, now seen corresponding path program 1 times [2020-07-01 13:11:54,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680347873] [2020-07-01 13:11:54,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680347873] [2020-07-01 13:11:54,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375910137] [2020-07-01 13:11:54,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,218 INFO L87 Difference]: Start difference. First operand 23 states and 37 transitions. Second operand 3 states. [2020-07-01 13:11:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,283 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2020-07-01 13:11:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,286 INFO L225 Difference]: With dead ends: 27 [2020-07-01 13:11:54,286 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 13:11:54,287 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 13:11:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 13:11:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 13:11:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2020-07-01 13:11:54,316 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 3 [2020-07-01 13:11:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,318 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2020-07-01 13:11:54,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2020-07-01 13:11:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:54,318 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:54,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:11:54,319 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,319 INFO L82 PathProgramCache]: Analyzing trace with hash 100936, now seen corresponding path program 1 times [2020-07-01 13:11:54,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831058590] [2020-07-01 13:11:54,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831058590] [2020-07-01 13:11:54,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124709404] [2020-07-01 13:11:54,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,352 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand 3 states. [2020-07-01 13:11:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,416 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2020-07-01 13:11:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,418 INFO L225 Difference]: With dead ends: 23 [2020-07-01 13:11:54,418 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 13:11:54,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 13:11:54,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 13:11:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:11:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-07-01 13:11:54,422 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 3 [2020-07-01 13:11:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,422 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-01 13:11:54,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2020-07-01 13:11:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:11:54,423 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:11:54,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:11:54,423 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,424 INFO L82 PathProgramCache]: Analyzing trace with hash 100938, now seen corresponding path program 1 times [2020-07-01 13:11:54,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398461803] [2020-07-01 13:11:54,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398461803] [2020-07-01 13:11:54,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197442403] [2020-07-01 13:11:54,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,456 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 3 states. [2020-07-01 13:11:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,493 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2020-07-01 13:11:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:11:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,494 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:11:54,494 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 13:11:54,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 13:11:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-01 13:11:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 13:11:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2020-07-01 13:11:54,497 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 3 [2020-07-01 13:11:54,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,498 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. [2020-07-01 13:11:54,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2020-07-01 13:11:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:11:54,498 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:11:54,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:11:54,499 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash 3128059, now seen corresponding path program 1 times [2020-07-01 13:11:54,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202067528] [2020-07-01 13:11:54,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202067528] [2020-07-01 13:11:54,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842644304] [2020-07-01 13:11:54,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,546 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 3 states. [2020-07-01 13:11:54,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,588 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2020-07-01 13:11:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:11:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,589 INFO L225 Difference]: With dead ends: 15 [2020-07-01 13:11:54,589 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 13:11:54,590 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 13:11:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 13:11:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 13:11:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-01 13:11:54,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 4 [2020-07-01 13:11:54,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,593 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-01 13:11:54,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-07-01 13:11:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:11:54,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:11:54,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:11:54,594 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash 3128061, now seen corresponding path program 1 times [2020-07-01 13:11:54,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650261389] [2020-07-01 13:11:54,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650261389] [2020-07-01 13:11:54,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080746412] [2020-07-01 13:11:54,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,625 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 3 states. [2020-07-01 13:11:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,649 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-01 13:11:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:11:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,650 INFO L225 Difference]: With dead ends: 15 [2020-07-01 13:11:54,650 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 13:11:54,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 13:11:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 13:11:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 13:11:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-07-01 13:11:54,653 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 4 [2020-07-01 13:11:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,653 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-07-01 13:11:54,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-07-01 13:11:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:11:54,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:11:54,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:11:54,654 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash 3128062, now seen corresponding path program 1 times [2020-07-01 13:11:54,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004072110] [2020-07-01 13:11:54,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004072110] [2020-07-01 13:11:54,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387603502] [2020-07-01 13:11:54,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,700 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2020-07-01 13:11:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,719 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-07-01 13:11:54,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:11:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,720 INFO L225 Difference]: With dead ends: 12 [2020-07-01 13:11:54,720 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:11:54,721 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:11:54,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:11:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:11:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:11:54,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-07-01 13:11:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,722 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:11:54,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:11:54,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:11:54,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:11:54,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:11:54,752 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 13:11:54,752 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 13:11:54,753 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 10) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 13:11:54,753 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:11:54,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:11:54,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:11:54,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:11:54,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:54,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:11:54,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:11:54,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:54,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:54,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:54,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:54,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:11:54,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-07-01 13:11:54,754 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-01 13:11:54,754 INFO L268 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-07-01 13:11:54,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:11:54,755 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-01 13:11:54,755 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:11:54,755 INFO L268 CegarLoopResult]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-07-01 13:11:54,755 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-07-01 13:11:54,757 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:11:54,766 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:54,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:54,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:11:54,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:54,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:54,774 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:11:54,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:54 BasicIcfg [2020-07-01 13:11:54,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:11:54,777 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:11:54,777 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:11:54,780 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:11:54,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:54,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:11:52" (1/5) ... [2020-07-01 13:11:54,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75d2f7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:11:54, skipping insertion in model container [2020-07-01 13:11:54,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:54,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (2/5) ... [2020-07-01 13:11:54,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75d2f7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:11:54, skipping insertion in model container [2020-07-01 13:11:54,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:54,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53" (3/5) ... [2020-07-01 13:11:54,783 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75d2f7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:11:54, skipping insertion in model container [2020-07-01 13:11:54,783 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:54,783 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:53" (4/5) ... [2020-07-01 13:11:54,783 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75d2f7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:11:54, skipping insertion in model container [2020-07-01 13:11:54,783 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:11:54,783 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:54" (5/5) ... [2020-07-01 13:11:54,785 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:11:54,815 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:11:54,815 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:11:54,815 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:11:54,816 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:11:54,816 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:11:54,816 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:11:54,816 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:11:54,816 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:11:54,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-07-01 13:11:54,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 13:11:54,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:11:54,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:11:54,831 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 13:11:54,831 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:11:54,831 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:11:54,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-07-01 13:11:54,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 13:11:54,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:11:54,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:11:54,834 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 13:11:54,834 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:11:54,839 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue [71] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 19#L-1true [92] L-1-->L6: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 7#L6true [59] L6-->L7-2: Formula: (and (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~y~0.base_4)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_4) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~y~0.base_4) v_ULTIMATE.start_main_~y~0.offset_4 1))) (<= (+ v_ULTIMATE.start_main_~y~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~y~0.base_4))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_4, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_4, #length=|v_#length_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 4#L7-2true [2020-07-01 13:11:54,840 INFO L796 eck$LassoCheckResult]: Loop: 4#L7-2true [126] L7-2-->L8: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (= 1 (select |v_#valid_31| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_15| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11))) InVars {#valid=|v_#valid_31|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{#valid=|v_#valid_31|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_15|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 13#L8true [68] L8-->L8-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 11#L8-1true [65] L8-1-->L8-2: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~y~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y~0.base_7) v_ULTIMATE.start_main_~y~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y~0.offset_6 4) (select |v_#length_10| v_ULTIMATE.start_main_~y~0.base_7))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_7, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_6, #length=|v_#length_10|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 9#L8-2true [124] L8-2-->L9: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_18| v_ULTIMATE.start_main_~x~0.base_13)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_13)) (= (store |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem3_6| (* |v_ULTIMATE.start_main_#t~mem4_6| (- 1))))) |v_#memory_int_11|)) InVars {#valid=|v_#valid_29|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_18|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_6|} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_18|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 16#L9true [52] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~y~0.offset_8 4) (select |v_#length_14| v_ULTIMATE.start_main_~y~0.base_10)) (= 1 (select |v_#valid_16| v_ULTIMATE.start_main_~y~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_main_~y~0.base_10) v_ULTIMATE.start_main_~y~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~y~0.offset_8)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_14|, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_10, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_8, #length=|v_#length_14|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 14#L9-1true [125] L9-1-->L7-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~y~0.offset_12) (= 1 (select |v_#valid_30| v_ULTIMATE.start_main_~y~0.base_16)) (<= (+ v_ULTIMATE.start_main_~y~0.offset_12 4) (select |v_#length_19| v_ULTIMATE.start_main_~y~0.base_16)) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~y~0.base_16 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~y~0.base_16) v_ULTIMATE.start_main_~y~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem5_6| 1))) |v_#memory_int_13|)) InVars {#valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_19|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_16, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_12, #length=|v_#length_19|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem5] 4#L7-2true [2020-07-01 13:11:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash 100933, now seen corresponding path program 1 times [2020-07-01 13:11:54,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705090710] [2020-07-01 13:11:54,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705090710] [2020-07-01 13:11:54,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33907524] [2020-07-01 13:11:54,859 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:11:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash 264666155, now seen corresponding path program 1 times [2020-07-01 13:11:54,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402450726] [2020-07-01 13:11:54,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:11:54,903 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:11:54,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,989 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-07-01 13:11:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:55,051 INFO L93 Difference]: Finished difference Result 23 states and 37 transitions. [2020-07-01 13:11:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:55,054 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:11:55,059 INFO L168 Benchmark]: Toolchain (without parser) took 2098.54 ms. Allocated memory was 514.9 MB in the beginning and 596.6 MB in the end (delta: 81.8 MB). Free memory was 435.8 MB in the beginning and 531.5 MB in the end (delta: -95.7 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:11:55,059 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:11:55,060 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.78 ms. Allocated memory was 514.9 MB in the beginning and 571.5 MB in the end (delta: 56.6 MB). Free memory was 435.8 MB in the beginning and 540.4 MB in the end (delta: -104.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,061 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 571.5 MB. Free memory was 540.4 MB in the beginning and 538.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,061 INFO L168 Benchmark]: Boogie Preprocessor took 23.03 ms. Allocated memory is still 571.5 MB. Free memory was 538.7 MB in the beginning and 536.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,062 INFO L168 Benchmark]: RCFGBuilder took 301.35 ms. Allocated memory is still 571.5 MB. Free memory was 536.9 MB in the beginning and 518.8 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,062 INFO L168 Benchmark]: BlockEncodingV2 took 109.69 ms. Allocated memory is still 571.5 MB. Free memory was 518.8 MB in the beginning and 510.6 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,063 INFO L168 Benchmark]: TraceAbstraction took 1035.36 ms. Allocated memory is still 571.5 MB. Free memory was 509.8 MB in the beginning and 413.0 MB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:11:55,064 INFO L168 Benchmark]: BuchiAutomizer took 279.75 ms. Allocated memory was 571.5 MB in the beginning and 596.6 MB in the end (delta: 25.2 MB). Free memory was 413.0 MB in the beginning and 531.5 MB in the end (delta: -118.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:11:55,067 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 31 edges - StatisticsResult: Encoded RCFG 23 locations, 40 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 303.78 ms. Allocated memory was 514.9 MB in the beginning and 571.5 MB in the end (delta: 56.6 MB). Free memory was 435.8 MB in the beginning and 540.4 MB in the end (delta: -104.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 571.5 MB. Free memory was 540.4 MB in the beginning and 538.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.03 ms. Allocated memory is still 571.5 MB. Free memory was 538.7 MB in the beginning and 536.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 301.35 ms. Allocated memory is still 571.5 MB. Free memory was 536.9 MB in the beginning and 518.8 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 109.69 ms. Allocated memory is still 571.5 MB. Free memory was 518.8 MB in the beginning and 510.6 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1035.36 ms. Allocated memory is still 571.5 MB. Free memory was 509.8 MB in the beginning and 413.0 MB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 279.75 ms. Allocated memory was 571.5 MB in the beginning and 596.6 MB in the end (delta: 25.2 MB). Free memory was 413.0 MB in the beginning and 531.5 MB in the end (delta: -118.4 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant [2020-07-01 13:11:55,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:11:55,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:11:55,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((4 == unknown-#length-unknown[y] && \valid[x] == 1) && 0 == y) && unknown-#length-unknown[x] == 4) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.9s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 SDtfs, 136 SDslu, 4 SDs, 0 SdLazy, 133 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 30 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:11:49.692 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_mVO58M/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:11:55.305 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check