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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:55:28,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:55:28,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:55:28,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:55:28,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:55:28,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:55:28,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:55:28,466 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:55:28,468 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:55:28,469 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:55:28,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:55:28,470 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:55:28,471 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:55:28,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:55:28,473 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:55:28,474 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:55:28,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:55:28,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:55:28,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:55:28,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:55:28,483 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:55:28,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:55:28,487 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:55:28,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:55:28,488 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:55:28,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:55:28,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:55:28,491 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:55:28,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:55:28,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:55:28,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:55:28,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:55:28,494 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:55:28,494 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:55:28,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:55:28,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:55:28,497 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:55:28,512 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:55:28,512 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:55:28,513 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:55:28,514 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:55:28,514 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:55:28,514 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:55:28,515 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:55:28,515 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:55:28,515 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:55:28,515 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:55:28,515 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:55:28,516 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:55:28,516 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:55:28,516 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:55:28,516 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:55:28,516 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:55:28,517 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:55:28,517 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:55:28,517 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:55:28,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:55:28,517 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:55:28,518 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:55:28,518 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:55:28,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:55:28,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:55:28,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:55:28,519 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:55:28,519 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:55:28,519 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:55:28,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:55:28,519 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:55:28,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:55:28,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:55:28,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:55:28,606 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:55:28,606 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:55:28,607 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:55:28,678 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91922bf81/4c9a1b7a78a44ab3884e4ed46ce89db5/FLAGa00cd4433 [2018-11-23 12:55:29,192 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:55:29,192 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-simple-white-blue_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:55:29,206 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91922bf81/4c9a1b7a78a44ab3884e4ed46ce89db5/FLAGa00cd4433 [2018-11-23 12:55:29,459 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91922bf81/4c9a1b7a78a44ab3884e4ed46ce89db5 [2018-11-23 12:55:29,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:55:29,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:55:29,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:29,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:55:29,482 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:55:29,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:29" (1/1) ... [2018-11-23 12:55:29,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127d93e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:29, skipping insertion in model container [2018-11-23 12:55:29,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:29" (1/1) ... [2018-11-23 12:55:29,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:55:29,558 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:55:30,062 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:30,082 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:55:30,177 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:30,244 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:55:30,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30 WrapperNode [2018-11-23 12:55:30,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:30,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:30,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:55:30,246 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:55:30,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (1/1) ... [2018-11-23 12:55:30,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (1/1) ... [2018-11-23 12:55:30,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:30,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:55:30,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:55:30,359 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:55:30,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (1/1) ... [2018-11-23 12:55:30,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (1/1) ... [2018-11-23 12:55:30,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (1/1) ... [2018-11-23 12:55:30,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (1/1) ... [2018-11-23 12:55:30,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (1/1) ... [2018-11-23 12:55:30,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (1/1) ... [2018-11-23 12:55:30,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (1/1) ... [2018-11-23 12:55:30,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:55:30,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:55:30,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:55:30,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:55:30,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (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-23 12:55:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:55:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:55:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:55:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:55:30,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:55:30,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:55:30,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:55:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:55:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:55:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:55:30,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:55:30,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:55:31,401 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:55:31,401 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 12:55:31,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:31 BoogieIcfgContainer [2018-11-23 12:55:31,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:55:31,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:55:31,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:55:31,407 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:55:31,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:29" (1/3) ... [2018-11-23 12:55:31,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240c1078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:31, skipping insertion in model container [2018-11-23 12:55:31,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:30" (2/3) ... [2018-11-23 12:55:31,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240c1078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:31, skipping insertion in model container [2018-11-23 12:55:31,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:31" (3/3) ... [2018-11-23 12:55:31,411 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:55:31,419 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:55:31,426 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:55:31,441 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:55:31,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:55:31,473 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:55:31,473 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:55:31,473 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:55:31,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:55:31,474 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:55:31,474 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:55:31,474 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:55:31,474 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:55:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:55:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:55:31,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:31,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:31,505 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:31,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash -445630561, now seen corresponding path program 1 times [2018-11-23 12:55:31,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:31,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:31,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:31,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:31,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:31,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:55:31,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-23 12:55:31,752 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:55:31,752 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #117#return; {35#true} is VALID [2018-11-23 12:55:31,753 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret20 := main(); {35#true} is VALID [2018-11-23 12:55:31,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {35#true} is VALID [2018-11-23 12:55:31,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-23 12:55:31,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {36#false} is VALID [2018-11-23 12:55:31,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} assume 0 != #t~nondet5;havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~x~0.base, ~x~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4);call write~$Pointer$(0, 0, ~x~0.base, 4 + ~x~0.offset, 4);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {36#false} is VALID [2018-11-23 12:55:31,771 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {36#false} is VALID [2018-11-23 12:55:31,771 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-23 12:55:31,772 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset; {36#false} is VALID [2018-11-23 12:55:31,772 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#false} assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem17 := read~int(~x~0.base, 8 + ~x~0.offset, 4); {36#false} is VALID [2018-11-23 12:55:31,772 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} assume 1 != #t~mem17;havoc #t~mem17; {36#false} is VALID [2018-11-23 12:55:31,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:55:31,779 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-23 12:55:31,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:31,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:55:31,789 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:55:31,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:31,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:55:31,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:31,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:55:31,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:55:31,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:31,949 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 12:55:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:32,149 INFO L93 Difference]: Finished difference Result 55 states and 84 transitions. [2018-11-23 12:55:32,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:55:32,149 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:55:32,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2018-11-23 12:55:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2018-11-23 12:55:32,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 84 transitions. [2018-11-23 12:55:32,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:32,575 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:55:32,575 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:55:32,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:55:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:55:32,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:32,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:55:32,716 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:55:32,716 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:55:32,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:32,721 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-11-23 12:55:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-11-23 12:55:32,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:32,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:32,722 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:55:32,722 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:55:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:32,727 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-11-23 12:55:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-11-23 12:55:32,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:32,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:32,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:32,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:55:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-11-23 12:55:32,733 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2018-11-23 12:55:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:32,733 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-11-23 12:55:32,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:55:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-11-23 12:55:32,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:55:32,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:32,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:32,735 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:32,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:32,736 INFO L82 PathProgramCache]: Analyzing trace with hash -640042354, now seen corresponding path program 1 times [2018-11-23 12:55:32,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:32,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:32,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:55:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:55:32,884 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=23, |#NULL.offset|=13, |old(#NULL.base)|=23, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=23, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=23, |old(#NULL.offset)|=13] [?] RET #117#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret20 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=21, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=21, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=21, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [main_~head~0.base=21, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~nondet5|=1] [?] assume 0 != #t~nondet5;havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~x~0.base, ~x~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4);call write~$Pointer$(0, 0, ~x~0.base, 4 + ~x~0.offset, 4);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] call #t~mem14 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0, |main_#t~mem14|=1] [?] assume !(1 != #t~mem14);havoc #t~mem14; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem17 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0, |main_#t~mem17|=0] [?] assume 1 != #t~mem17;havoc #t~mem17; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] assume !false; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=23, #NULL.offset=13, old(#NULL.base)=23, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L989] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L989] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L990] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L991] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L992] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L994] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L997-L1005] assume !(0 != #t~nondet1); [L997] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~nondet5=1, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1008-L1036] assume 0 != #t~nondet5; [L1008] havoc #t~nondet5; [L1009] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12); [L1009] ~x~0.base, ~x~0.offset := #t~malloc6.base, #t~malloc6.offset; [L1010] call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); [L1011] call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); [L1012] call write~$Pointer$(0, 0, ~x~0.base, 4 + ~x~0.offset, 4); [L1013] ~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1039] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1042] call #t~mem14 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, #t~mem14=1, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1042-L1045] assume !(1 != #t~mem14); [L1042] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1048] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1048] ~x~0.base, ~x~0.offset := #t~mem16.base, #t~mem16.offset; [L1048] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1049-L1054] assume !!(~x~0.base != 0 || ~x~0.offset != 0); [L1051] call #t~mem17 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, #t~mem17=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1051-L1052] assume 1 != #t~mem17; [L1051] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1052] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=23, #NULL.offset=13, old(#NULL.base)=23, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L989] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L989] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L990] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L991] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L992] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L994] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L997-L1005] assume !(0 != #t~nondet1); [L997] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~nondet5=1, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1008-L1036] assume 0 != #t~nondet5; [L1008] havoc #t~nondet5; [L1009] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12); [L1009] ~x~0.base, ~x~0.offset := #t~malloc6.base, #t~malloc6.offset; [L1010] call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); [L1011] call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); [L1012] call write~$Pointer$(0, 0, ~x~0.base, 4 + ~x~0.offset, 4); [L1013] ~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1039] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1042] call #t~mem14 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, #t~mem14=1, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1042-L1045] assume !(1 != #t~mem14); [L1042] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1048] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1048] ~x~0.base, ~x~0.offset := #t~mem16.base, #t~mem16.offset; [L1048] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1049-L1054] assume !!(~x~0.base != 0 || ~x~0.offset != 0); [L1051] call #t~mem17 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, #t~mem17=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1051-L1052] assume 1 != #t~mem17; [L1051] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1052] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=13, old(#NULL!base)=23, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L989] ~head~0 := #t~malloc0; [L990] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L992] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L994] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997-L1005] COND TRUE !(0 != #t~nondet1) [L997] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet5=1, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008-L1036] COND TRUE 0 != #t~nondet5 [L1008] havoc #t~nondet5; [L1009] FCALL call #t~malloc6 := #Ultimate.alloc(12); [L1009] ~x~0 := #t~malloc6; [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1013] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042] FCALL call #t~mem14 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem14=1, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042-L1045] COND TRUE !(1 != #t~mem14) [L1042] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1048] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1048] ~x~0 := #t~mem16; [L1048] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1049-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1051] FCALL call #t~mem17 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem17=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1051] COND TRUE 1 != #t~mem17 [L1051] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1052] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=13, old(#NULL!base)=23, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L989] ~head~0 := #t~malloc0; [L990] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L992] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L994] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997-L1005] COND TRUE !(0 != #t~nondet1) [L997] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet5=1, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008-L1036] COND TRUE 0 != #t~nondet5 [L1008] havoc #t~nondet5; [L1009] FCALL call #t~malloc6 := #Ultimate.alloc(12); [L1009] ~x~0 := #t~malloc6; [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1013] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042] FCALL call #t~mem14 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem14=1, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042-L1045] COND TRUE !(1 != #t~mem14) [L1042] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1048] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1048] ~x~0 := #t~mem16; [L1048] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1049-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1051] FCALL call #t~mem17 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem17=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1051] COND TRUE 1 != #t~mem17 [L1051] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1052] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=13, old(#NULL!base)=23, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L989] ~head~0 := #t~malloc0; [L990] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L992] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L994] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997-L1005] COND TRUE !(0 != #t~nondet1) [L997] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet5=1, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008-L1036] COND TRUE 0 != #t~nondet5 [L1008] havoc #t~nondet5; [L1009] FCALL call #t~malloc6 := #Ultimate.alloc(12); [L1009] ~x~0 := #t~malloc6; [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1013] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042] FCALL call #t~mem14 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem14=1, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042-L1045] COND TRUE !(1 != #t~mem14) [L1042] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1048] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1048] ~x~0 := #t~mem16; [L1048] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1049-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1051] FCALL call #t~mem17 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem17=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1051] COND TRUE 1 != #t~mem17 [L1051] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1052] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=13, old(#NULL!base)=23, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L989] ~head~0 := #t~malloc0; [L990] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L992] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L994] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997-L1005] COND TRUE !(0 != #t~nondet1) [L997] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet5=1, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008-L1036] COND TRUE 0 != #t~nondet5 [L1008] havoc #t~nondet5; [L1009] FCALL call #t~malloc6 := #Ultimate.alloc(12); [L1009] ~x~0 := #t~malloc6; [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1013] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042] FCALL call #t~mem14 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem14=1, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042-L1045] COND TRUE !(1 != #t~mem14) [L1042] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1048] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1048] ~x~0 := #t~mem16; [L1048] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1049-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1051] FCALL call #t~mem17 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem17=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1051] COND TRUE 1 != #t~mem17 [L1051] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1052] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L989] SLL* head = malloc(sizeof(SLL)); [L990] head->next = ((void*)0) [L991] head->prev = ((void*)0) [L992] head->data = 0 [L994] SLL* x = head; VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND TRUE __VERIFIER_nondet_int() [L1009] x = malloc(sizeof(SLL)) [L1010] x->data = 1 [L1011] x->next = head [L1012] x->prev = ((void*)0) [L1013] head = x VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1039] x = head VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1042] EXPR x->data VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1] [L1042] COND FALSE !(x->data != 1) [L1048] EXPR x->next [L1048] x = x->next [L1049] COND TRUE \read(*x) [L1051] EXPR x->data VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={21:0}, x->data=0] [L1051] COND TRUE x->data != 1 [L1052] __VERIFIER_error() VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={21:0}] ----- [2018-11-23 12:55:32,966 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:55:32,966 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:55:32,966 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:55:32,966 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:55:32,967 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:55:32,967 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:55:32,967 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:55:32,967 WARN L170 areAnnotationChecker]: L997-3 has no Hoare annotation [2018-11-23 12:55:32,967 WARN L170 areAnnotationChecker]: L997-3 has no Hoare annotation [2018-11-23 12:55:32,967 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:55:32,968 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:55:32,968 WARN L170 areAnnotationChecker]: L997-4 has no Hoare annotation [2018-11-23 12:55:32,968 WARN L170 areAnnotationChecker]: L997-1 has no Hoare annotation [2018-11-23 12:55:32,968 WARN L170 areAnnotationChecker]: L997-1 has no Hoare annotation [2018-11-23 12:55:32,968 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2018-11-23 12:55:32,968 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2018-11-23 12:55:32,969 WARN L170 areAnnotationChecker]: L1031-2 has no Hoare annotation [2018-11-23 12:55:32,970 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2018-11-23 12:55:32,970 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2018-11-23 12:55:32,970 WARN L170 areAnnotationChecker]: L1042-3 has no Hoare annotation [2018-11-23 12:55:32,970 WARN L170 areAnnotationChecker]: L1042-3 has no Hoare annotation [2018-11-23 12:55:32,970 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2018-11-23 12:55:32,970 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2018-11-23 12:55:32,971 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2018-11-23 12:55:32,971 WARN L170 areAnnotationChecker]: L1042-4 has no Hoare annotation [2018-11-23 12:55:32,971 WARN L170 areAnnotationChecker]: L1042-1 has no Hoare annotation [2018-11-23 12:55:32,971 WARN L170 areAnnotationChecker]: L1042-1 has no Hoare annotation [2018-11-23 12:55:32,971 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2018-11-23 12:55:32,971 WARN L170 areAnnotationChecker]: L1031 has no Hoare annotation [2018-11-23 12:55:32,972 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2018-11-23 12:55:32,972 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2018-11-23 12:55:32,972 WARN L170 areAnnotationChecker]: L1049-2 has no Hoare annotation [2018-11-23 12:55:32,972 WARN L170 areAnnotationChecker]: L1049-2 has no Hoare annotation [2018-11-23 12:55:32,972 WARN L170 areAnnotationChecker]: L1049-2 has no Hoare annotation [2018-11-23 12:55:32,972 WARN L170 areAnnotationChecker]: L1049-3 has no Hoare annotation [2018-11-23 12:55:32,973 WARN L170 areAnnotationChecker]: L1051 has no Hoare annotation [2018-11-23 12:55:32,973 WARN L170 areAnnotationChecker]: L1051 has no Hoare annotation [2018-11-23 12:55:32,973 WARN L170 areAnnotationChecker]: L1058-2 has no Hoare annotation [2018-11-23 12:55:32,973 WARN L170 areAnnotationChecker]: L1058-2 has no Hoare annotation [2018-11-23 12:55:32,973 WARN L170 areAnnotationChecker]: L1058-2 has no Hoare annotation [2018-11-23 12:55:32,973 WARN L170 areAnnotationChecker]: L1052-3 has no Hoare annotation [2018-11-23 12:55:32,974 WARN L170 areAnnotationChecker]: L1052-3 has no Hoare annotation [2018-11-23 12:55:32,975 WARN L170 areAnnotationChecker]: L1052-3 has no Hoare annotation [2018-11-23 12:55:32,975 WARN L170 areAnnotationChecker]: L1052-3 has no Hoare annotation [2018-11-23 12:55:32,975 WARN L170 areAnnotationChecker]: L1051-1 has no Hoare annotation [2018-11-23 12:55:32,975 WARN L170 areAnnotationChecker]: L1058-3 has no Hoare annotation [2018-11-23 12:55:32,975 WARN L170 areAnnotationChecker]: L1052-2 has no Hoare annotation [2018-11-23 12:55:32,976 WARN L170 areAnnotationChecker]: L1052-2 has no Hoare annotation [2018-11-23 12:55:32,976 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:55:32,976 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:55:32,976 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:55:32,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:55:32 BoogieIcfgContainer [2018-11-23 12:55:32,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:55:32,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:55:32,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:55:32,982 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:55:32,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:31" (3/4) ... [2018-11-23 12:55:32,987 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=23, |#NULL.offset|=13, |old(#NULL.base)|=23, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=23, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=23, |old(#NULL.offset)|=13] [?] RET #117#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret20 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=21, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=21, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=21, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [main_~head~0.base=21, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~nondet5|=1] [?] assume 0 != #t~nondet5;havoc #t~nondet5;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12);~x~0.base, ~x~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4);call write~$Pointer$(0, 0, ~x~0.base, 4 + ~x~0.offset, 4);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] call #t~mem14 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0, |main_#t~mem14|=1] [?] assume !(1 != #t~mem14);havoc #t~mem14; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=18, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem17 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0, |main_#t~mem17|=0] [?] assume 1 != #t~mem17;havoc #t~mem17; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] assume !false; VAL [main_~head~0.base=18, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=21, |main_#t~malloc0.offset|=0, |main_#t~malloc6.base|=18, |main_#t~malloc6.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=23, #NULL.offset=13, old(#NULL.base)=23, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L989] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L989] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L990] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L991] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L992] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L994] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L997-L1005] assume !(0 != #t~nondet1); [L997] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~nondet5=1, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1008-L1036] assume 0 != #t~nondet5; [L1008] havoc #t~nondet5; [L1009] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12); [L1009] ~x~0.base, ~x~0.offset := #t~malloc6.base, #t~malloc6.offset; [L1010] call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); [L1011] call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); [L1012] call write~$Pointer$(0, 0, ~x~0.base, 4 + ~x~0.offset, 4); [L1013] ~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1039] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1042] call #t~mem14 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, #t~mem14=1, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1042-L1045] assume !(1 != #t~mem14); [L1042] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1048] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1048] ~x~0.base, ~x~0.offset := #t~mem16.base, #t~mem16.offset; [L1048] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1049-L1054] assume !!(~x~0.base != 0 || ~x~0.offset != 0); [L1051] call #t~mem17 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, #t~mem17=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1051-L1052] assume 1 != #t~mem17; [L1051] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1052] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=23, #NULL.offset=13, old(#NULL.base)=23, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=23, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L989] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L989] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L990] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L991] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L992] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L994] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L997-L1005] assume !(0 != #t~nondet1); [L997] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~nondet5=1, ~head~0.base=21, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1008-L1036] assume 0 != #t~nondet5; [L1008] havoc #t~nondet5; [L1009] call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12); [L1009] ~x~0.base, ~x~0.offset := #t~malloc6.base, #t~malloc6.offset; [L1010] call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); [L1011] call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4); [L1012] call write~$Pointer$(0, 0, ~x~0.base, 4 + ~x~0.offset, 4); [L1013] ~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1039] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1042] call #t~mem14 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, #t~mem14=1, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1042-L1045] assume !(1 != #t~mem14); [L1042] havoc #t~mem14; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=18, ~x~0.offset=0] [L1048] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1048] ~x~0.base, ~x~0.offset := #t~mem16.base, #t~mem16.offset; [L1048] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1049-L1054] assume !!(~x~0.base != 0 || ~x~0.offset != 0); [L1051] call #t~mem17 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, #t~mem17=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1051-L1052] assume 1 != #t~mem17; [L1051] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1052] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=21, #t~malloc0.offset=0, #t~malloc6.base=18, #t~malloc6.offset=0, ~head~0.base=18, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=13, old(#NULL!base)=23, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L989] ~head~0 := #t~malloc0; [L990] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L992] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L994] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997-L1005] COND TRUE !(0 != #t~nondet1) [L997] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet5=1, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008-L1036] COND TRUE 0 != #t~nondet5 [L1008] havoc #t~nondet5; [L1009] FCALL call #t~malloc6 := #Ultimate.alloc(12); [L1009] ~x~0 := #t~malloc6; [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1013] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042] FCALL call #t~mem14 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem14=1, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042-L1045] COND TRUE !(1 != #t~mem14) [L1042] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1048] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1048] ~x~0 := #t~mem16; [L1048] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1049-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1051] FCALL call #t~mem17 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem17=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1051] COND TRUE 1 != #t~mem17 [L1051] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1052] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=13, old(#NULL!base)=23, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L989] ~head~0 := #t~malloc0; [L990] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L992] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L994] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997-L1005] COND TRUE !(0 != #t~nondet1) [L997] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet5=1, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008-L1036] COND TRUE 0 != #t~nondet5 [L1008] havoc #t~nondet5; [L1009] FCALL call #t~malloc6 := #Ultimate.alloc(12); [L1009] ~x~0 := #t~malloc6; [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1013] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042] FCALL call #t~mem14 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem14=1, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042-L1045] COND TRUE !(1 != #t~mem14) [L1042] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1048] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1048] ~x~0 := #t~mem16; [L1048] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1049-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1051] FCALL call #t~mem17 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem17=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1051] COND TRUE 1 != #t~mem17 [L1051] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1052] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=13, old(#NULL!base)=23, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L989] ~head~0 := #t~malloc0; [L990] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L992] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L994] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997-L1005] COND TRUE !(0 != #t~nondet1) [L997] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet5=1, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008-L1036] COND TRUE 0 != #t~nondet5 [L1008] havoc #t~nondet5; [L1009] FCALL call #t~malloc6 := #Ultimate.alloc(12); [L1009] ~x~0 := #t~malloc6; [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1013] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042] FCALL call #t~mem14 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem14=1, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042-L1045] COND TRUE !(1 != #t~mem14) [L1042] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1048] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1048] ~x~0 := #t~mem16; [L1048] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1049-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1051] FCALL call #t~mem17 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem17=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1051] COND TRUE 1 != #t~mem17 [L1051] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1052] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=23, #NULL!offset=13, old(#NULL!base)=23, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=23, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret20 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L989] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L989] ~head~0 := #t~malloc0; [L990] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L991] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L992] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L994] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L997-L1005] COND TRUE !(0 != #t~nondet1) [L997] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~nondet5=1, ~head~0!base=21, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1008-L1036] COND TRUE 0 != #t~nondet5 [L1008] havoc #t~nondet5; [L1009] FCALL call #t~malloc6 := #Ultimate.alloc(12); [L1009] ~x~0 := #t~malloc6; [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call write~$Pointer$(~head~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1013] ~head~0 := ~x~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042] FCALL call #t~mem14 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem14=1, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1042-L1045] COND TRUE !(1 != #t~mem14) [L1042] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=18, ~x~0!offset=0] [L1048] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1048] ~x~0 := #t~mem16; [L1048] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1049-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1051] FCALL call #t~mem17 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, #t~mem17=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1051] COND TRUE 1 != #t~mem17 [L1051] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1052] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=21, #t~malloc0!offset=0, #t~malloc6!base=18, #t~malloc6!offset=0, ~head~0!base=18, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L989] SLL* head = malloc(sizeof(SLL)); [L990] head->next = ((void*)0) [L991] head->prev = ((void*)0) [L992] head->data = 0 [L994] SLL* x = head; VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND TRUE __VERIFIER_nondet_int() [L1009] x = malloc(sizeof(SLL)) [L1010] x->data = 1 [L1011] x->next = head [L1012] x->prev = ((void*)0) [L1013] head = x VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1039] x = head VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1042] EXPR x->data VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1] [L1042] COND FALSE !(x->data != 1) [L1048] EXPR x->next [L1048] x = x->next [L1049] COND TRUE \read(*x) [L1051] EXPR x->data VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={21:0}, x->data=0] [L1051] COND TRUE x->data != 1 [L1052] __VERIFIER_error() VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={21:0}] ----- [2018-11-23 12:55:33,094 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/forester-heap/dll-simple-white-blue_false-unreach-call_false-valid-memcleanup.i-witness.graphml [2018-11-23 12:55:33,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:55:33,096 INFO L168 Benchmark]: Toolchain (without parser) took 3626.26 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -637.5 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:33,098 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:33,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.23 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:33,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:33,100 INFO L168 Benchmark]: Boogie Preprocessor took 53.60 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:55:33,100 INFO L168 Benchmark]: RCFGBuilder took 989.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:33,101 INFO L168 Benchmark]: TraceAbstraction took 1578.46 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:33,102 INFO L168 Benchmark]: Witness Printer took 113.05 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:33,110 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.23 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 112.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.60 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 989.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1578.46 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. * Witness Printer took 113.05 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1052]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L989] SLL* head = malloc(sizeof(SLL)); [L990] head->next = ((void*)0) [L991] head->prev = ((void*)0) [L992] head->data = 0 [L994] SLL* x = head; VAL [head={21:0}, malloc(sizeof(SLL))={21:0}, x={21:0}] [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND TRUE __VERIFIER_nondet_int() [L1009] x = malloc(sizeof(SLL)) [L1010] x->data = 1 [L1011] x->next = head [L1012] x->prev = ((void*)0) [L1013] head = x VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1039] x = head VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1042] EXPR x->data VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1] [L1042] COND FALSE !(x->data != 1) [L1048] EXPR x->next [L1048] x = x->next [L1049] COND TRUE \read(*x) [L1051] EXPR x->data VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={21:0}, x->data=0] [L1051] COND TRUE x->data != 1 [L1052] __VERIFIER_error() VAL [head={18:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={18:0}, x={21:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. UNSAFE Result, 1.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...