/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/test28-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:23:24,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:23:24,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:23:24,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:23:24,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:23:24,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:23:24,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:23:24,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:23:24,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:23:24,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:23:24,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:23:24,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:23:24,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:23:24,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:23:24,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:23:24,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:23:24,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:23:24,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:23:24,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:23:24,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:23:24,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:23:24,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:23:24,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:23:24,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:23:24,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:23:24,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:23:24,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:23:24,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:23:24,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:23:24,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:23:24,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:23:24,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:23:24,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:23:24,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:23:24,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:23:24,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:23:24,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:23:24,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:23:24,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:23:24,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:23:24,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:23:24,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:23:24,368 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:23:24,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:23:24,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:23:24,369 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:23:24,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:23:24,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:23:24,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:23:24,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:23:24,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:23:24,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:23:24,371 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:23:24,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:23:24,371 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:23:24,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:23:24,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:23:24,372 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:23:24,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:23:24,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:23:24,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:23:24,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:23:24,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:23:24,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:23:24,373 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 22:23:24,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:23:24,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:23:24,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:23:24,676 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:23:24,677 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:23:24,678 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test28-2.c [2020-07-08 22:23:24,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326f27583/7a06b2f7d07c4487a073ad6509992ace/FLAG0673d723e [2020-07-08 22:23:25,162 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:23:25,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test28-2.c [2020-07-08 22:23:25,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326f27583/7a06b2f7d07c4487a073ad6509992ace/FLAG0673d723e [2020-07-08 22:23:25,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326f27583/7a06b2f7d07c4487a073ad6509992ace [2020-07-08 22:23:25,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:23:25,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:23:25,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:23:25,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:23:25,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:23:25,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:23:25" (1/1) ... [2020-07-08 22:23:25,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e1117f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25, skipping insertion in model container [2020-07-08 22:23:25,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:23:25" (1/1) ... [2020-07-08 22:23:25,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:23:25,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:23:25,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:23:25,818 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:23:25,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:23:25,851 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:23:25,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25 WrapperNode [2020-07-08 22:23:25,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:23:25,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:23:25,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:23:25,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:23:25,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25" (1/1) ... [2020-07-08 22:23:25,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25" (1/1) ... [2020-07-08 22:23:25,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25" (1/1) ... [2020-07-08 22:23:25,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25" (1/1) ... [2020-07-08 22:23:25,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25" (1/1) ... [2020-07-08 22:23:25,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25" (1/1) ... [2020-07-08 22:23:25,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25" (1/1) ... [2020-07-08 22:23:25,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:23:25,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:23:25,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:23:25,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:23:25,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:23:26,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:23:26,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:23:26,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:23:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:23:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 22:23:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:23:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 22:23:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 22:23:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 22:23:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 22:23:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:23:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:23:26,377 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:23:26,377 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 22:23:26,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:23:26 BoogieIcfgContainer [2020-07-08 22:23:26,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:23:26,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:23:26,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:23:26,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:23:26,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:23:25" (1/3) ... [2020-07-08 22:23:26,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5495c8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:23:26, skipping insertion in model container [2020-07-08 22:23:26,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:23:25" (2/3) ... [2020-07-08 22:23:26,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5495c8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:23:26, skipping insertion in model container [2020-07-08 22:23:26,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:23:26" (3/3) ... [2020-07-08 22:23:26,389 INFO L109 eAbstractionObserver]: Analyzing ICFG test28-2.c [2020-07-08 22:23:26,408 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:23:26,417 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:23:26,430 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:23:26,450 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:23:26,450 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:23:26,450 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:23:26,450 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:23:26,451 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:23:26,451 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:23:26,451 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:23:26,451 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:23:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-08 22:23:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 22:23:26,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:26,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:23:26,478 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:26,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:26,485 INFO L82 PathProgramCache]: Analyzing trace with hash -374520961, now seen corresponding path program 1 times [2020-07-08 22:23:26,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:26,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [252746465] [2020-07-08 22:23:26,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:26,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-08 22:23:26,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-08 22:23:26,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-08 22:23:26,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-08 22:23:26,736 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#true} {48#true} #62#return; {48#true} is VALID [2020-07-08 22:23:26,740 INFO L263 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:23:26,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {48#true} is VALID [2020-07-08 22:23:26,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#true} #valid := #valid[0 := 0]; {48#true} is VALID [2020-07-08 22:23:26,742 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#true} assume 0 < #StackHeapBarrier; {48#true} is VALID [2020-07-08 22:23:26,743 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#true} assume true; {48#true} is VALID [2020-07-08 22:23:26,743 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {48#true} {48#true} #62#return; {48#true} is VALID [2020-07-08 22:23:26,744 INFO L263 TraceCheckUtils]: 6: Hoare triple {48#true} call #t~ret4 := main(); {48#true} is VALID [2020-07-08 22:23:26,744 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {48#true} is VALID [2020-07-08 22:23:26,745 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L12 {48#true} is VALID [2020-07-08 22:23:26,745 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {48#true} is VALID [2020-07-08 22:23:26,746 INFO L280 TraceCheckUtils]: 10: Hoare triple {48#true} ~n~0 := #t~nondet0; {48#true} is VALID [2020-07-08 22:23:26,747 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#true} havoc #t~nondet0; {48#true} is VALID [2020-07-08 22:23:26,747 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#true} assume !(0 != ~n~0); {48#true} is VALID [2020-07-08 22:23:26,748 INFO L280 TraceCheckUtils]: 13: Hoare triple {48#true} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {48#true} is VALID [2020-07-08 22:23:26,748 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#true} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {48#true} is VALID [2020-07-08 22:23:26,749 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#true} havoc #t~ite1.base, #t~ite1.offset; {48#true} is VALID [2020-07-08 22:23:26,749 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#true} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {48#true} is VALID [2020-07-08 22:23:26,750 INFO L280 TraceCheckUtils]: 17: Hoare triple {48#true} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L16 {48#true} is VALID [2020-07-08 22:23:26,750 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#true} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {48#true} is VALID [2020-07-08 22:23:26,752 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#true} assume !#t~short3; {55#(not |main_#t~short3|)} is VALID [2020-07-08 22:23:26,753 INFO L280 TraceCheckUtils]: 20: Hoare triple {55#(not |main_#t~short3|)} assume #t~short3; {49#false} is VALID [2020-07-08 22:23:26,753 INFO L280 TraceCheckUtils]: 21: Hoare triple {49#false} havoc #t~short3; {49#false} is VALID [2020-07-08 22:23:26,754 INFO L280 TraceCheckUtils]: 22: Hoare triple {49#false} havoc #t~mem2; {49#false} is VALID [2020-07-08 22:23:26,754 INFO L280 TraceCheckUtils]: 23: Hoare triple {49#false} assume !false; {49#false} is VALID [2020-07-08 22:23:26,758 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-08 22:23:26,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [252746465] [2020-07-08 22:23:26,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:23:26,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 22:23:26,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967992080] [2020-07-08 22:23:26,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-08 22:23:26,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:26,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 22:23:26,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:26,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 22:23:26,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:26,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 22:23:26,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 22:23:26,849 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2020-07-08 22:23:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:27,137 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-07-08 22:23:27,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 22:23:27,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-08 22:23:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 22:23:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-08 22:23:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 22:23:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2020-07-08 22:23:27,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2020-07-08 22:23:27,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:27,258 INFO L225 Difference]: With dead ends: 54 [2020-07-08 22:23:27,258 INFO L226 Difference]: Without dead ends: 29 [2020-07-08 22:23:27,262 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 22:23:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-08 22:23:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-08 22:23:27,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:27,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-08 22:23:27,330 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-08 22:23:27,331 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-08 22:23:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:27,335 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-08 22:23:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 22:23:27,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:27,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:27,336 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-08 22:23:27,349 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-08 22:23:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:27,354 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-08 22:23:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 22:23:27,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:27,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:27,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:27,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 22:23:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-08 22:23:27,360 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2020-07-08 22:23:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:27,361 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-08 22:23:27,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 22:23:27,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2020-07-08 22:23:27,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 22:23:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 22:23:27,406 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:27,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:23:27,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:23:27,407 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:27,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1400624444, now seen corresponding path program 1 times [2020-07-08 22:23:27,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:27,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272562999] [2020-07-08 22:23:27,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:27,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {283#true} is VALID [2020-07-08 22:23:27,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {283#true} #valid := #valid[0 := 0]; {283#true} is VALID [2020-07-08 22:23:27,557 INFO L280 TraceCheckUtils]: 2: Hoare triple {283#true} assume 0 < #StackHeapBarrier; {283#true} is VALID [2020-07-08 22:23:27,557 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} assume true; {283#true} is VALID [2020-07-08 22:23:27,558 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {283#true} {283#true} #62#return; {283#true} is VALID [2020-07-08 22:23:27,560 INFO L263 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:23:27,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {294#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {283#true} is VALID [2020-07-08 22:23:27,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {283#true} #valid := #valid[0 := 0]; {283#true} is VALID [2020-07-08 22:23:27,561 INFO L280 TraceCheckUtils]: 3: Hoare triple {283#true} assume 0 < #StackHeapBarrier; {283#true} is VALID [2020-07-08 22:23:27,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {283#true} assume true; {283#true} is VALID [2020-07-08 22:23:27,562 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {283#true} {283#true} #62#return; {283#true} is VALID [2020-07-08 22:23:27,562 INFO L263 TraceCheckUtils]: 6: Hoare triple {283#true} call #t~ret4 := main(); {283#true} is VALID [2020-07-08 22:23:27,564 INFO L280 TraceCheckUtils]: 7: Hoare triple {283#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {290#(= 1 (select |#valid| |main_~#d1~0.base|))} is VALID [2020-07-08 22:23:27,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {290#(= 1 (select |#valid| |main_~#d1~0.base|))} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L12 {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:27,566 INFO L280 TraceCheckUtils]: 9: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:27,567 INFO L280 TraceCheckUtils]: 10: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} ~n~0 := #t~nondet0; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:27,568 INFO L280 TraceCheckUtils]: 11: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} havoc #t~nondet0; {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:27,569 INFO L280 TraceCheckUtils]: 12: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume !(0 != ~n~0); {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:27,570 INFO L280 TraceCheckUtils]: 13: Hoare triple {291#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {292#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_#t~ite1.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:27,571 INFO L280 TraceCheckUtils]: 14: Hoare triple {292#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_#t~ite1.base| |main_~#d2~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {293#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 22:23:27,572 INFO L280 TraceCheckUtils]: 15: Hoare triple {293#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} havoc #t~ite1.base, #t~ite1.offset; {293#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 22:23:27,573 INFO L280 TraceCheckUtils]: 16: Hoare triple {293#(and (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {284#false} is VALID [2020-07-08 22:23:27,573 INFO L280 TraceCheckUtils]: 17: Hoare triple {284#false} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L16 {284#false} is VALID [2020-07-08 22:23:27,574 INFO L280 TraceCheckUtils]: 18: Hoare triple {284#false} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {284#false} is VALID [2020-07-08 22:23:27,574 INFO L280 TraceCheckUtils]: 19: Hoare triple {284#false} assume #t~short3; {284#false} is VALID [2020-07-08 22:23:27,574 INFO L280 TraceCheckUtils]: 20: Hoare triple {284#false} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L20-1 {284#false} is VALID [2020-07-08 22:23:27,575 INFO L280 TraceCheckUtils]: 21: Hoare triple {284#false} #t~short3 := 0 != #t~mem2; {284#false} is VALID [2020-07-08 22:23:27,575 INFO L280 TraceCheckUtils]: 22: Hoare triple {284#false} assume #t~short3; {284#false} is VALID [2020-07-08 22:23:27,575 INFO L280 TraceCheckUtils]: 23: Hoare triple {284#false} havoc #t~short3; {284#false} is VALID [2020-07-08 22:23:27,575 INFO L280 TraceCheckUtils]: 24: Hoare triple {284#false} havoc #t~mem2; {284#false} is VALID [2020-07-08 22:23:27,576 INFO L280 TraceCheckUtils]: 25: Hoare triple {284#false} assume !false; {284#false} is VALID [2020-07-08 22:23:27,578 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-08 22:23:27,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272562999] [2020-07-08 22:23:27,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:23:27,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 22:23:27,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329538799] [2020-07-08 22:23:27,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-07-08 22:23:27,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:27,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 22:23:27,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:27,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 22:23:27,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:27,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 22:23:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 22:23:27,618 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 7 states. [2020-07-08 22:23:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:28,018 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2020-07-08 22:23:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 22:23:28,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-07-08 22:23:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:23:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-08 22:23:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:23:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-08 22:23:28,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2020-07-08 22:23:28,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:28,095 INFO L225 Difference]: With dead ends: 52 [2020-07-08 22:23:28,095 INFO L226 Difference]: Without dead ends: 42 [2020-07-08 22:23:28,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-08 22:23:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-08 22:23:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2020-07-08 22:23:28,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:28,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 32 states. [2020-07-08 22:23:28,160 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 32 states. [2020-07-08 22:23:28,161 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 32 states. [2020-07-08 22:23:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:28,164 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 22:23:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-08 22:23:28,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:28,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:28,166 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 42 states. [2020-07-08 22:23:28,166 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 42 states. [2020-07-08 22:23:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:28,169 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 22:23:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-08 22:23:28,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:28,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:28,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:28,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 22:23:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-08 22:23:28,173 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2020-07-08 22:23:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:28,174 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-08 22:23:28,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 22:23:28,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-08 22:23:28,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 22:23:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 22:23:28,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:28,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:23:28,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:23:28,230 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash -316312164, now seen corresponding path program 1 times [2020-07-08 22:23:28,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:28,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1776825474] [2020-07-08 22:23:28,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:28,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {571#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {557#true} is VALID [2020-07-08 22:23:28,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#true} #valid := #valid[0 := 0]; {557#true} is VALID [2020-07-08 22:23:28,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {557#true} assume 0 < #StackHeapBarrier; {557#true} is VALID [2020-07-08 22:23:28,572 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-08 22:23:28,572 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {557#true} {557#true} #62#return; {557#true} is VALID [2020-07-08 22:23:28,574 INFO L263 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {571#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:23:28,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {571#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {557#true} is VALID [2020-07-08 22:23:28,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {557#true} #valid := #valid[0 := 0]; {557#true} is VALID [2020-07-08 22:23:28,574 INFO L280 TraceCheckUtils]: 3: Hoare triple {557#true} assume 0 < #StackHeapBarrier; {557#true} is VALID [2020-07-08 22:23:28,575 INFO L280 TraceCheckUtils]: 4: Hoare triple {557#true} assume true; {557#true} is VALID [2020-07-08 22:23:28,575 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {557#true} {557#true} #62#return; {557#true} is VALID [2020-07-08 22:23:28,575 INFO L263 TraceCheckUtils]: 6: Hoare triple {557#true} call #t~ret4 := main(); {557#true} is VALID [2020-07-08 22:23:28,576 INFO L280 TraceCheckUtils]: 7: Hoare triple {557#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {557#true} is VALID [2020-07-08 22:23:28,577 INFO L280 TraceCheckUtils]: 8: Hoare triple {557#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L12 {564#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-08 22:23:28,578 INFO L280 TraceCheckUtils]: 9: Hoare triple {564#(= 0 |main_~#d2~0.offset|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {564#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-08 22:23:28,578 INFO L280 TraceCheckUtils]: 10: Hoare triple {564#(= 0 |main_~#d2~0.offset|)} ~n~0 := #t~nondet0; {564#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-08 22:23:28,579 INFO L280 TraceCheckUtils]: 11: Hoare triple {564#(= 0 |main_~#d2~0.offset|)} havoc #t~nondet0; {564#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-08 22:23:28,580 INFO L280 TraceCheckUtils]: 12: Hoare triple {564#(= 0 |main_~#d2~0.offset|)} assume !(0 != ~n~0); {564#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-08 22:23:28,580 INFO L280 TraceCheckUtils]: 13: Hoare triple {564#(= 0 |main_~#d2~0.offset|)} #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {565#(and (= |main_#t~ite1.base| |main_~#d2~0.base|) (= 0 |main_~#d2~0.offset|) (= |main_#t~ite1.offset| 0))} is VALID [2020-07-08 22:23:28,581 INFO L280 TraceCheckUtils]: 14: Hoare triple {565#(and (= |main_#t~ite1.base| |main_~#d2~0.base|) (= 0 |main_~#d2~0.offset|) (= |main_#t~ite1.offset| 0))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:28,582 INFO L280 TraceCheckUtils]: 15: Hoare triple {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} havoc #t~ite1.base, #t~ite1.offset; {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:28,583 INFO L280 TraceCheckUtils]: 16: Hoare triple {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset); {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:28,584 INFO L280 TraceCheckUtils]: 17: Hoare triple {566#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} SUMMARY for call write~int(0, ~pd~0.base, 4 + ~pd~0.offset, 4); srcloc: L18 {567#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:28,585 INFO L280 TraceCheckUtils]: 18: Hoare triple {567#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {568#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} is VALID [2020-07-08 22:23:28,586 INFO L280 TraceCheckUtils]: 19: Hoare triple {568#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} assume #t~short3; {568#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} is VALID [2020-07-08 22:23:28,587 INFO L280 TraceCheckUtils]: 20: Hoare triple {568#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L20-1 {569#(= 0 |main_#t~mem2|)} is VALID [2020-07-08 22:23:28,590 INFO L280 TraceCheckUtils]: 21: Hoare triple {569#(= 0 |main_#t~mem2|)} #t~short3 := 0 != #t~mem2; {570#(not |main_#t~short3|)} is VALID [2020-07-08 22:23:28,591 INFO L280 TraceCheckUtils]: 22: Hoare triple {570#(not |main_#t~short3|)} assume #t~short3; {558#false} is VALID [2020-07-08 22:23:28,591 INFO L280 TraceCheckUtils]: 23: Hoare triple {558#false} havoc #t~short3; {558#false} is VALID [2020-07-08 22:23:28,591 INFO L280 TraceCheckUtils]: 24: Hoare triple {558#false} havoc #t~mem2; {558#false} is VALID [2020-07-08 22:23:28,592 INFO L280 TraceCheckUtils]: 25: Hoare triple {558#false} assume !false; {558#false} is VALID [2020-07-08 22:23:28,594 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-08 22:23:28,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1776825474] [2020-07-08 22:23:28,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:23:28,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-08 22:23:28,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589522891] [2020-07-08 22:23:28,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-08 22:23:28,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:28,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 22:23:28,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:28,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 22:23:28,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:28,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 22:23:28,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-08 22:23:28,631 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2020-07-08 22:23:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:29,163 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 22:23:29,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 22:23:29,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-08 22:23:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 22:23:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-08 22:23:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 22:23:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-08 22:23:29,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-08 22:23:29,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:29,227 INFO L225 Difference]: With dead ends: 42 [2020-07-08 22:23:29,228 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 22:23:29,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-07-08 22:23:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 22:23:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-08 22:23:29,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:29,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-08 22:23:29,287 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 22:23:29,288 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 22:23:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:29,290 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-08 22:23:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-08 22:23:29,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:29,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:29,291 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 22:23:29,291 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 22:23:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:29,293 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-08 22:23:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-08 22:23:29,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:29,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:29,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:29,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 22:23:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-08 22:23:29,299 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2020-07-08 22:23:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:29,299 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-08 22:23:29,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 22:23:29,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-08 22:23:29,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-08 22:23:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 22:23:29,338 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:23:29,339 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:23:29,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:23:29,339 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:23:29,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:23:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash -497457956, now seen corresponding path program 1 times [2020-07-08 22:23:29,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:23:29,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2117648289] [2020-07-08 22:23:29,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:23:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:23:29,497 INFO L280 TraceCheckUtils]: 0: Hoare triple {793#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {780#true} is VALID [2020-07-08 22:23:29,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {780#true} #valid := #valid[0 := 0]; {780#true} is VALID [2020-07-08 22:23:29,498 INFO L280 TraceCheckUtils]: 2: Hoare triple {780#true} assume 0 < #StackHeapBarrier; {780#true} is VALID [2020-07-08 22:23:29,498 INFO L280 TraceCheckUtils]: 3: Hoare triple {780#true} assume true; {780#true} is VALID [2020-07-08 22:23:29,498 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {780#true} {780#true} #62#return; {780#true} is VALID [2020-07-08 22:23:29,499 INFO L263 TraceCheckUtils]: 0: Hoare triple {780#true} call ULTIMATE.init(); {793#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:23:29,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {793#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {780#true} is VALID [2020-07-08 22:23:29,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {780#true} #valid := #valid[0 := 0]; {780#true} is VALID [2020-07-08 22:23:29,500 INFO L280 TraceCheckUtils]: 3: Hoare triple {780#true} assume 0 < #StackHeapBarrier; {780#true} is VALID [2020-07-08 22:23:29,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {780#true} assume true; {780#true} is VALID [2020-07-08 22:23:29,501 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {780#true} {780#true} #62#return; {780#true} is VALID [2020-07-08 22:23:29,501 INFO L263 TraceCheckUtils]: 6: Hoare triple {780#true} call #t~ret4 := main(); {780#true} is VALID [2020-07-08 22:23:29,502 INFO L280 TraceCheckUtils]: 7: Hoare triple {780#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {787#(= 1 (select |#valid| |main_~#d1~0.base|))} is VALID [2020-07-08 22:23:29,504 INFO L280 TraceCheckUtils]: 8: Hoare triple {787#(= 1 (select |#valid| |main_~#d1~0.base|))} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L12 {788#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:29,510 INFO L280 TraceCheckUtils]: 9: Hoare triple {788#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {788#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:29,522 INFO L280 TraceCheckUtils]: 10: Hoare triple {788#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} ~n~0 := #t~nondet0; {788#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:29,527 INFO L280 TraceCheckUtils]: 11: Hoare triple {788#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} havoc #t~nondet0; {788#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:29,528 INFO L280 TraceCheckUtils]: 12: Hoare triple {788#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0; {788#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:29,528 INFO L280 TraceCheckUtils]: 13: Hoare triple {788#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} #t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {789#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 22:23:29,529 INFO L280 TraceCheckUtils]: 14: Hoare triple {789#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; {790#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-08 22:23:29,529 INFO L280 TraceCheckUtils]: 15: Hoare triple {790#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base))} havoc #t~ite1.base, #t~ite1.offset; {790#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-08 22:23:29,530 INFO L280 TraceCheckUtils]: 16: Hoare triple {790#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset; {791#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:29,530 INFO L280 TraceCheckUtils]: 17: Hoare triple {791#(not (= main_~pd~0.base |main_~#d2~0.base|))} SUMMARY for call write~int(0, ~pd~0.base, ~pd~0.offset, 4); srcloc: L16 {791#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 22:23:29,531 INFO L280 TraceCheckUtils]: 18: Hoare triple {791#(not (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {792#(not |main_#t~short3|)} is VALID [2020-07-08 22:23:29,531 INFO L280 TraceCheckUtils]: 19: Hoare triple {792#(not |main_#t~short3|)} assume #t~short3; {781#false} is VALID [2020-07-08 22:23:29,532 INFO L280 TraceCheckUtils]: 20: Hoare triple {781#false} SUMMARY for call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L20-1 {781#false} is VALID [2020-07-08 22:23:29,532 INFO L280 TraceCheckUtils]: 21: Hoare triple {781#false} #t~short3 := 0 != #t~mem2; {781#false} is VALID [2020-07-08 22:23:29,532 INFO L280 TraceCheckUtils]: 22: Hoare triple {781#false} assume #t~short3; {781#false} is VALID [2020-07-08 22:23:29,532 INFO L280 TraceCheckUtils]: 23: Hoare triple {781#false} havoc #t~short3; {781#false} is VALID [2020-07-08 22:23:29,532 INFO L280 TraceCheckUtils]: 24: Hoare triple {781#false} havoc #t~mem2; {781#false} is VALID [2020-07-08 22:23:29,533 INFO L280 TraceCheckUtils]: 25: Hoare triple {781#false} assume !false; {781#false} is VALID [2020-07-08 22:23:29,534 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-08 22:23:29,535 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2117648289] [2020-07-08 22:23:29,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:23:29,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 22:23:29,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641822124] [2020-07-08 22:23:29,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-08 22:23:29,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:23:29,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 22:23:29,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:29,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 22:23:29,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:23:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 22:23:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 22:23:29,581 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2020-07-08 22:23:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:29,870 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-08 22:23:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 22:23:29,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-08 22:23:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:23:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:23:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-08 22:23:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 22:23:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-08 22:23:29,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2020-07-08 22:23:29,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:29,910 INFO L225 Difference]: With dead ends: 28 [2020-07-08 22:23:29,911 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 22:23:29,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-07-08 22:23:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 22:23:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 22:23:29,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:23:29,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 22:23:29,913 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:23:29,913 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:23:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:29,914 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:23:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:23:29,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:29,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:29,914 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:23:29,914 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:23:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:23:29,915 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:23:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:23:29,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:29,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:23:29,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:23:29,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:23:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 22:23:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 22:23:29,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-08 22:23:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:23:29,916 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 22:23:29,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 22:23:29,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 22:23:29,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:23:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:23:29,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:23:29,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 22:23:29,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 22:23:30,420 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 22:23:30,420 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-08 22:23:30,420 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:23:30,420 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-08 22:23:30,421 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:23:30,421 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:23:30,421 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 22:23:30,421 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 22:23:30,421 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:23:30,422 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-07-08 22:23:30,422 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 10 28) the Hoare annotation is: true [2020-07-08 22:23:30,422 INFO L264 CegarLoopResult]: At program point L15(lines 15 19) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (= |main_~#d1~0.base| main_~pd~0.base)))) [2020-07-08 22:23:30,422 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-08 22:23:30,422 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and .cse0 .cse1 .cse2 (not |main_#t~short3|) (= |main_~#d1~0.base| main_~pd~0.base)) (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) (= main_~pd~0.base |main_~#d2~0.base|) .cse0 .cse1 .cse2))) [2020-07-08 22:23:30,423 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:30,423 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) (= 0 |main_#t~mem2|) (= main_~pd~0.base |main_~#d2~0.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:30,423 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base)) [2020-07-08 22:23:30,423 INFO L264 CegarLoopResult]: At program point L20-4(lines 20 22) the Hoare annotation is: (not |main_#t~short3|) [2020-07-08 22:23:30,423 INFO L264 CegarLoopResult]: At program point L20-5(line 20) the Hoare annotation is: false [2020-07-08 22:23:30,424 INFO L264 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: false [2020-07-08 22:23:30,424 INFO L264 CegarLoopResult]: At program point L20-7(line 20) the Hoare annotation is: (not |main_#t~short3|) [2020-07-08 22:23:30,424 INFO L264 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (= 1 (select |#valid| |main_~#d1~0.base|)) [2020-07-08 22:23:30,424 INFO L271 CegarLoopResult]: At program point L20-8(line 20) the Hoare annotation is: true [2020-07-08 22:23:30,425 INFO L264 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:30,425 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-08 22:23:30,437 INFO L271 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-07-08 22:23:30,437 INFO L271 CegarLoopResult]: At program point L12-4(line 12) the Hoare annotation is: true [2020-07-08 22:23:30,437 INFO L271 CegarLoopResult]: At program point L12-5(line 12) the Hoare annotation is: true [2020-07-08 22:23:30,438 INFO L264 CegarLoopResult]: At program point L12-6(line 12) the Hoare annotation is: false [2020-07-08 22:23:30,438 INFO L264 CegarLoopResult]: At program point L12-7(line 12) the Hoare annotation is: false [2020-07-08 22:23:30,438 INFO L264 CegarLoopResult]: At program point L12-8(line 12) the Hoare annotation is: false [2020-07-08 22:23:30,438 INFO L264 CegarLoopResult]: At program point L12-9(line 12) the Hoare annotation is: false [2020-07-08 22:23:30,438 INFO L264 CegarLoopResult]: At program point L21(lines 11 28) the Hoare annotation is: false [2020-07-08 22:23:30,438 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:30,438 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 10 28) the Hoare annotation is: true [2020-07-08 22:23:30,438 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:30,439 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26) the Hoare annotation is: false [2020-07-08 22:23:30,439 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 10 28) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-08 22:23:30,439 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (= |main_~#d1~0.base| main_~pd~0.base)))) [2020-07-08 22:23:30,439 INFO L264 CegarLoopResult]: At program point L18-1(lines 15 19) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and .cse0 .cse1 .cse2 (= |main_~#d1~0.base| main_~pd~0.base)) (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) (= main_~pd~0.base |main_~#d2~0.base|) .cse0 .cse1 .cse2))) [2020-07-08 22:23:30,439 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:30,441 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:30,441 INFO L264 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: (and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= 0 |main_~#d2~0.offset|) (= 1 (select |#valid| |main_~#d1~0.base|))) [2020-07-08 22:23:30,441 INFO L264 CegarLoopResult]: At program point L14-4(line 14) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d1~0.base| |main_#t~ite1.base|) .cse0 .cse1 .cse2) (and .cse0 (= |main_#t~ite1.base| |main_~#d2~0.base|) .cse1 (= |main_#t~ite1.offset| 0) .cse2))) [2020-07-08 22:23:30,441 INFO L264 CegarLoopResult]: At program point L14-5(line 14) the Hoare annotation is: (let ((.cse0 (not (= |main_~#d1~0.base| |main_~#d2~0.base|))) (.cse1 (= 0 |main_~#d2~0.offset|)) (.cse2 (= 1 (select |#valid| |main_~#d1~0.base|)))) (or (and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|) .cse0 (= |main_#t~ite1.base| |main_~#d2~0.base|) .cse1 (= |main_#t~ite1.offset| 0) .cse2) (and (= |main_~#d1~0.base| |main_#t~ite1.base|) .cse0 .cse1 .cse2 (= |main_~#d1~0.base| main_~pd~0.base)))) [2020-07-08 22:23:30,463 INFO L163 areAnnotationChecker]: CFG has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 22:23:30,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:23:30 BoogieIcfgContainer [2020-07-08 22:23:30,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:23:30,474 INFO L168 Benchmark]: Toolchain (without parser) took 4872.41 ms. Allocated memory was 134.7 MB in the beginning and 300.9 MB in the end (delta: 166.2 MB). Free memory was 99.9 MB in the beginning and 269.3 MB in the end (delta: -169.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 22:23:30,475 INFO L168 Benchmark]: CDTParser took 0.94 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 117.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 22:23:30,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.15 ms. Allocated memory is still 134.7 MB. Free memory was 99.4 MB in the beginning and 89.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:30,477 INFO L168 Benchmark]: Boogie Preprocessor took 142.32 ms. Allocated memory was 134.7 MB in the beginning and 199.8 MB in the end (delta: 65.0 MB). Free memory was 89.4 MB in the beginning and 177.6 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:30,478 INFO L168 Benchmark]: RCFGBuilder took 386.21 ms. Allocated memory is still 199.8 MB. Free memory was 176.9 MB in the beginning and 155.1 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2020-07-08 22:23:30,479 INFO L168 Benchmark]: TraceAbstraction took 4088.79 ms. Allocated memory was 199.8 MB in the beginning and 300.9 MB in the end (delta: 101.2 MB). Free memory was 154.4 MB in the beginning and 269.3 MB in the end (delta: -114.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 22:23:30,482 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.94 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 117.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.15 ms. Allocated memory is still 134.7 MB. Free memory was 99.4 MB in the beginning and 89.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.32 ms. Allocated memory was 134.7 MB in the beginning and 199.8 MB in the end (delta: 65.0 MB). Free memory was 89.4 MB in the beginning and 177.6 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 386.21 ms. Allocated memory is still 199.8 MB. Free memory was 176.9 MB in the beginning and 155.1 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4088.79 ms. Allocated memory was 199.8 MB in the beginning and 300.9 MB in the end (delta: 101.2 MB). Free memory was 154.4 MB in the beginning and 269.3 MB in the end (delta: -114.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 10]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 94 SDtfs, 137 SDslu, 229 SDs, 0 SdLazy, 231 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 45 PreInvPairs, 62 NumberOfFragments, 445 HoareAnnotationTreeSize, 45 FomulaSimplifications, 196 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 7259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...