java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/test09_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:50:33,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:50:33,238 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:50:33,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:50:33,256 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:50:33,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:50:33,259 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:50:33,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:50:33,265 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:50:33,266 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:50:33,268 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:50:33,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:50:33,270 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:50:33,271 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:50:33,281 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:50:33,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:50:33,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:50:33,288 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:50:33,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:50:33,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:50:33,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:50:33,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:50:33,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:50:33,306 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:50:33,306 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:50:33,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:50:33,310 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:50:33,311 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:50:33,315 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:50:33,317 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:50:33,317 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:50:33,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:50:33,322 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:50:33,322 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:50:33,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:50:33,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:50:33,325 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 21:50:33,359 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:50:33,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:50:33,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:50:33,362 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:50:33,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:50:33,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:50:33,365 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:50:33,365 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:50:33,366 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:50:33,366 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:50:33,366 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:50:33,366 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:50:33,366 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:50:33,366 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:50:33,367 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:50:33,367 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:50:33,367 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:50:33,367 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:50:33,367 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:50:33,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:50:33,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:50:33,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:50:33,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:50:33,368 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:50:33,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:50:33,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:50:33,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:50:33,369 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:50:33,369 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:50:33,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:50:33,370 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:50:33,370 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:50:33,370 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:50:33,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:50:33,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:50:33,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:50:33,435 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:50:33,435 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:50:33,436 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test09_true-unreach-call_true-termination.c [2018-11-18 21:50:33,500 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d707f77/af55b4ae94484c1a8fd9747d35a5fabf/FLAGe541b70ae [2018-11-18 21:50:33,962 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:50:33,963 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test09_true-unreach-call_true-termination.c [2018-11-18 21:50:33,970 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d707f77/af55b4ae94484c1a8fd9747d35a5fabf/FLAGe541b70ae [2018-11-18 21:50:34,328 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d707f77/af55b4ae94484c1a8fd9747d35a5fabf [2018-11-18 21:50:34,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:50:34,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:50:34,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:50:34,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:50:34,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:50:34,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:50:34" (1/1) ... [2018-11-18 21:50:34,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd4950d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34, skipping insertion in model container [2018-11-18 21:50:34,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:50:34" (1/1) ... [2018-11-18 21:50:34,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:50:34,388 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:50:34,655 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:50:34,677 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:50:34,702 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:50:34,731 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:50:34,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34 WrapperNode [2018-11-18 21:50:34,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:50:34,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:50:34,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:50:34,733 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:50:34,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34" (1/1) ... [2018-11-18 21:50:34,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34" (1/1) ... [2018-11-18 21:50:34,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34" (1/1) ... [2018-11-18 21:50:34,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34" (1/1) ... [2018-11-18 21:50:34,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34" (1/1) ... [2018-11-18 21:50:34,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34" (1/1) ... [2018-11-18 21:50:34,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34" (1/1) ... [2018-11-18 21:50:34,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:50:34,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:50:34,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:50:34,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:50:34,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34" (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 [2018-11-18 21:50:34,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:50:34,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:50:34,955 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-18 21:50:34,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:50:34,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:50:34,956 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-18 21:50:34,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:50:34,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:50:34,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:50:34,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:50:34,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:50:34,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:50:34,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:50:34,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:50:35,551 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:50:35,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:35 BoogieIcfgContainer [2018-11-18 21:50:35,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:50:35,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:50:35,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:50:35,557 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:50:35,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:50:34" (1/3) ... [2018-11-18 21:50:35,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681b83a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:50:35, skipping insertion in model container [2018-11-18 21:50:35,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:34" (2/3) ... [2018-11-18 21:50:35,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681b83a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:50:35, skipping insertion in model container [2018-11-18 21:50:35,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:35" (3/3) ... [2018-11-18 21:50:35,561 INFO L112 eAbstractionObserver]: Analyzing ICFG test09_true-unreach-call_true-termination.c [2018-11-18 21:50:35,572 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:50:35,582 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 21:50:35,600 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 21:50:35,634 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:50:35,635 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:50:35,636 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:50:35,636 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:50:35,636 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:50:35,636 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:50:35,637 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:50:35,637 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:50:35,637 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:50:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 21:50:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 21:50:35,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:50:35,663 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:50:35,665 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:50:35,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:50:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1889415219, now seen corresponding path program 1 times [2018-11-18 21:50:35,676 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:50:35,676 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:50:35,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:50:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:35,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:50:36,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-18 21:50:36,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);~p1~0.base, ~p1~0.offset := 0bv32, 0bv32;~p2~0.base, ~p2~0.offset := 0bv32, 0bv32; {30#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:36,400 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#(= (_ bv0 32) |~#b~0.offset|)} assume true; {30#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:36,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#(= (_ bv0 32) |~#b~0.offset|)} {22#true} #23#return; {30#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:36,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#(= (_ bv0 32) |~#b~0.offset|)} call #t~ret7 := main(); {30#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:36,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#(= (_ bv0 32) |~#b~0.offset|)} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset;call write~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post4 := #t~mem3;call write~intINTTYPE4(~bvsub32(#t~post4, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem3;havoc #t~post4; {43#(= (_ bv0 32) ~p2~0.offset)} is VALID [2018-11-18 21:50:36,415 INFO L256 TraceCheckUtils]: 6: Hoare triple {43#(= (_ bv0 32) ~p2~0.offset)} call #t~ret5 := f(); {43#(= (_ bv0 32) ~p2~0.offset)} is VALID [2018-11-18 21:50:36,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#(= (_ bv0 32) ~p2~0.offset)} call #t~mem0 := read~intINTTYPE4(~p1~0.base, ~p1~0.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(~p2~0.base, ~p2~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);~v~0 := ~bvsub32(~bvadd32(#t~mem0, #t~mem1), #t~mem2);havoc #t~mem1;havoc #t~mem0;havoc #t~mem2; {43#(= (_ bv0 32) ~p2~0.offset)} is VALID [2018-11-18 21:50:36,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#(= (_ bv0 32) ~p2~0.offset)} assume 1bv32 == ~v~0;~p1~0.base, ~p1~0.offset := ~p2~0.base, ~p2~0.offset;#res := ~v~0; {53#(and (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset) (= (_ bv0 32) ~p2~0.offset))} is VALID [2018-11-18 21:50:36,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#(and (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset) (= (_ bv0 32) ~p2~0.offset))} assume true; {53#(and (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset) (= (_ bv0 32) ~p2~0.offset))} is VALID [2018-11-18 21:50:36,425 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {53#(and (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset) (= (_ bv0 32) ~p2~0.offset))} {43#(= (_ bv0 32) ~p2~0.offset)} #27#return; {53#(and (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset) (= (_ bv0 32) ~p2~0.offset))} is VALID [2018-11-18 21:50:36,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {53#(and (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset) (= (_ bv0 32) ~p2~0.offset))} call write~intINTTYPE4(#t~ret5, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~ret5;call write~intINTTYPE4(1000bv32, ~p1~0.base, ~p1~0.offset, 4bv32);call #t~mem6 := read~intINTTYPE4(~p2~0.base, ~p2~0.offset, 4bv32); {63#(= (_ bv1000 32) |main_#t~mem6|)} is VALID [2018-11-18 21:50:36,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {63#(= (_ bv1000 32) |main_#t~mem6|)} assume 1000bv32 != #t~mem6;havoc #t~mem6; {23#false} is VALID [2018-11-18 21:50:36,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-18 21:50:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:50:36,450 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:50:36,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:50:36,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 21:50:36,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-18 21:50:36,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:50:36,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 21:50:36,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:36,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 21:50:36,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 21:50:36,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 21:50:36,619 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 6 states. [2018-11-18 21:50:36,918 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-18 21:50:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:37,940 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-18 21:50:37,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 21:50:37,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-18 21:50:37,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:50:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 21:50:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-18 21:50:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 21:50:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-18 21:50:37,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2018-11-18 21:50:38,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:38,135 INFO L225 Difference]: With dead ends: 33 [2018-11-18 21:50:38,135 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 21:50:38,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-18 21:50:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 21:50:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 21:50:38,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:50:38,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-18 21:50:38,252 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 21:50:38,252 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 21:50:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:38,256 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-18 21:50:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-18 21:50:38,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:38,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:38,257 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 21:50:38,257 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 21:50:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:38,261 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-18 21:50:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-18 21:50:38,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:38,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:38,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:50:38,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:50:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 21:50:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2018-11-18 21:50:38,266 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 14 [2018-11-18 21:50:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:50:38,267 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2018-11-18 21:50:38,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 21:50:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-18 21:50:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 21:50:38,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:50:38,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:50:38,269 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:50:38,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:50:38,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1918044370, now seen corresponding path program 1 times [2018-11-18 21:50:38,270 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:50:38,270 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:50:38,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:50:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:38,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:50:38,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-18 21:50:38,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-18 21:50:38,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:38,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:38,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:38,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-11-18 21:50:38,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 21:50:38,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 21:50:38,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:38,693 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:50:38,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-18 21:50:38,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-18 21:50:38,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 21:50:38,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:38,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:38,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:50:38,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:44, output treesize:27 [2018-11-18 21:50:39,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2018-11-18 21:50:39,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);~p1~0.base, ~p1~0.offset := 0bv32, 0bv32;~p2~0.base, ~p2~0.offset := 0bv32, 0bv32; {176#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:39,233 INFO L273 TraceCheckUtils]: 2: Hoare triple {176#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} assume true; {176#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:39,234 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {176#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} {168#true} #23#return; {176#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:39,235 INFO L256 TraceCheckUtils]: 4: Hoare triple {176#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} call #t~ret7 := main(); {176#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:39,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {176#(and (= (_ bv0 32) |~#b~0.offset|) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|))} ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~#b~0.base, ~#b~0.offset;call write~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post4 := #t~mem3;call write~intINTTYPE4(~bvsub32(#t~post4, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem3;havoc #t~post4; {189#(and (= |~#a~0.offset| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |~#a~0.base| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:39,240 INFO L256 TraceCheckUtils]: 6: Hoare triple {189#(and (= |~#a~0.offset| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |~#a~0.base| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} call #t~ret5 := f(); {193#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:39,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {193#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} call #t~mem0 := read~intINTTYPE4(~p1~0.base, ~p1~0.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(~p2~0.base, ~p2~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);~v~0 := ~bvsub32(~bvadd32(#t~mem0, #t~mem1), #t~mem2);havoc #t~mem1;havoc #t~mem0;havoc #t~mem2; {197#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= f_~v~0 (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:39,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {197#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |old(~p1~0.base)| ~p1~0.base) (= f_~v~0 (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset))) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} assume !(1bv32 == ~v~0);#res := 0bv32; {201#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (not (= (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:39,249 INFO L273 TraceCheckUtils]: 9: Hoare triple {201#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (not (= (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} assume true; {201#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (not (= (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:39,268 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {201#(and (= |old(~p1~0.offset)| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (not (= (bvadd (bvneg (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (select (select |#memory_int| ~p1~0.base) ~p1~0.offset) (select (select |#memory_int| ~p2~0.base) ~p2~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= |old(~p1~0.base)| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} {189#(and (= |~#a~0.offset| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |~#a~0.base| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |~#a~0.offset|))} #27#return; {169#false} is VALID [2018-11-18 21:50:39,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {169#false} call write~intINTTYPE4(#t~ret5, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~ret5;call write~intINTTYPE4(1000bv32, ~p1~0.base, ~p1~0.offset, 4bv32);call #t~mem6 := read~intINTTYPE4(~p2~0.base, ~p2~0.offset, 4bv32); {169#false} is VALID [2018-11-18 21:50:39,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {169#false} assume 1000bv32 != #t~mem6;havoc #t~mem6; {169#false} is VALID [2018-11-18 21:50:39,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {169#false} assume !false; {169#false} is VALID [2018-11-18 21:50:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:50:39,272 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:50:39,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:50:39,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 21:50:39,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-18 21:50:39,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:50:39,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 21:50:39,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:39,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 21:50:39,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 21:50:39,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 21:50:39,334 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 7 states. [2018-11-18 21:50:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:39,754 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-18 21:50:39,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 21:50:39,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-18 21:50:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:50:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 21:50:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-18 21:50:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 21:50:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-18 21:50:39,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 14 transitions. [2018-11-18 21:50:39,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:39,816 INFO L225 Difference]: With dead ends: 15 [2018-11-18 21:50:39,816 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 21:50:39,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-18 21:50:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 21:50:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 21:50:39,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:50:39,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:39,819 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:39,819 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:39,819 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 21:50:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:39,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:39,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:39,820 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:39,820 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:39,820 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 21:50:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:39,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:39,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:39,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:50:39,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:50:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 21:50:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 21:50:39,823 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-11-18 21:50:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:50:39,823 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 21:50:39,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 21:50:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:39,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:39,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 21:50:40,033 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 21:50:40,147 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-18 21:50:40,384 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2018-11-18 21:50:40,432 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 21:50:40,432 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 21:50:40,432 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 21:50:40,432 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 14) no Hoare annotation was computed. [2018-11-18 21:50:40,433 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 7 15) no Hoare annotation was computed. [2018-11-18 21:50:40,433 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 7 15) the Hoare annotation is: (or (not (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|))) (not (= |~#a~0.offset| (_ bv0 32))) (not (= ~p2~0.offset (_ bv0 32))) (not (= |old(~p1~0.base)| |~#a~0.base|)) (= |~#a~0.base| |~#b~0.base|) (and (= |old(~p1~0.offset)| ~p1~0.offset) (= |old(~p1~0.base)| ~p1~0.base)) (not (= (_ bv0 32) |~#b~0.offset|)) (not (= |~#a~0.offset| |old(~p1~0.offset)|)) (not (= (_ bv1 32) (select (select |#memory_int| ~p2~0.base) (_ bv0 32))))) [2018-11-18 21:50:40,433 INFO L425 ceAbstractionStarter]: For program point fFINAL(lines 7 15) no Hoare annotation was computed. [2018-11-18 21:50:40,433 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 21:50:40,433 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~p2~0.base ~p1~0.base) (= (_ bv0 32) |~#b~0.offset|) (= ~p1~0.offset ~p2~0.offset) (= (_ bv0 32) ~p2~0.offset) (not (= |~#b~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#a~0.offset|)) [2018-11-18 21:50:40,434 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 21:50:40,434 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 21:50:40,434 INFO L421 ceAbstractionStarter]: At program point L32(lines 17 39) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (not (= |old(~p2~0.offset)| (_ bv0 32))) (not (= |old(~p1~0.base)| |old(~p2~0.base)|)) (= |~#a~0.base| |~#b~0.base|) (not (= (_ bv0 32) |~#b~0.offset|)) (not (= |old(~p2~0.offset)| |old(~p1~0.offset)|))) [2018-11-18 21:50:40,434 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2018-11-18 21:50:40,434 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 17 39) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (not (= |old(~p2~0.offset)| (_ bv0 32))) (not (= |old(~p1~0.base)| |old(~p2~0.base)|)) (= |~#a~0.base| |~#b~0.base|) (not (= (_ bv0 32) |~#b~0.offset|)) (and (= ~p2~0.base ~p1~0.base) (= ~p1~0.offset ~p2~0.offset) (= (_ bv0 32) ~p2~0.offset)) (not (= |old(~p2~0.offset)| |old(~p1~0.offset)|))) [2018-11-18 21:50:40,434 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 17 39) no Hoare annotation was computed. [2018-11-18 21:50:40,435 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (not (= |old(~p2~0.offset)| (_ bv0 32))) (and (= |~#a~0.offset| ~p1~0.offset) (= (_ bv4 32) (select (select |#memory_int| |~#a~0.base|) |~#a~0.offset|)) (= (_ bv0 32) ~p2~0.offset) (= |~#a~0.base| ~p1~0.base) (= (bvadd (select (select |#memory_int| ~p2~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~p1~0.base)| |old(~p2~0.base)|)) (= |~#a~0.base| |~#b~0.base|) (not (= (_ bv0 32) |~#b~0.offset|)) (not (= |old(~p2~0.offset)| |old(~p1~0.offset)|))) [2018-11-18 21:50:40,435 INFO L425 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2018-11-18 21:50:40,435 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 17 39) no Hoare annotation was computed. [2018-11-18 21:50:40,435 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-11-18 21:50:40,437 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:50:40,437 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-18 21:50:40,439 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:50:40,440 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-18 21:50:40,440 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2018-11-18 21:50:40,440 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:50:40,441 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-18 21:50:40,448 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 21:50:40,448 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-18 21:50:40,448 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:50:40,448 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-18 21:50:40,448 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-18 21:50:40,448 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-18 21:50:40,449 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-18 21:50:40,449 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-18 21:50:40,449 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 21:50:40,449 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 21:50:40,449 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 21:50:40,449 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 21:50:40,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:50:40 BoogieIcfgContainer [2018-11-18 21:50:40,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 21:50:40,464 INFO L168 Benchmark]: Toolchain (without parser) took 6122.80 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -471.6 MB). Peak memory consumption was 236.7 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:40,465 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:50:40,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:40,467 INFO L168 Benchmark]: Boogie Preprocessor took 63.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:50:40,467 INFO L168 Benchmark]: RCFGBuilder took 755.95 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:40,468 INFO L168 Benchmark]: TraceAbstraction took 4908.81 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 259.4 MB). Peak memory consumption was 259.4 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:40,473 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 389.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 755.95 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4908.81 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 259.4 MB). Peak memory consumption was 259.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: 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: 17]: Loop Invariant Derived loop invariant: ((((!(a == 0bv32) || !(\old(p2) == 0bv32)) || !(\old(p1) == \old(p2))) || a == b) || !(0bv32 == b)) || !(\old(p2) == \old(p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 32 SDslu, 27 SDs, 0 SdLazy, 30 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 179 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 55 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 4030 SizeOfPredicates, 14 NumberOfNonLiveVariables, 154 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...