./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-sorted_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-sorted_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8be34918f5cf463066a3551693e083428b9e6ee2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:46:22,799 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:46:22,801 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:46:22,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:46:22,809 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:46:22,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:46:22,810 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:46:22,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:46:22,813 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:46:22,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:46:22,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:46:22,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:46:22,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:46:22,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:46:22,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:46:22,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:46:22,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:46:22,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:46:22,821 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:46:22,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:46:22,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:46:22,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:46:22,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:46:22,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:46:22,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:46:22,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:46:22,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:46:22,829 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:46:22,830 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:46:22,830 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:46:22,830 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:46:22,831 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:46:22,831 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:46:22,831 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:46:22,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:46:22,833 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:46:22,833 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 02:46:22,843 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:46:22,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:46:22,843 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:46:22,844 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 02:46:22,844 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:46:22,844 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:46:22,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:46:22,845 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:46:22,845 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:46:22,845 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:46:22,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:46:22,845 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:46:22,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:46:22,845 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:46:22,845 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:46:22,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:46:22,846 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:46:22,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:46:22,846 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 02:46:22,846 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 02:46:22,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:46:22,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:46:22,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 02:46:22,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:46:22,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:46:22,847 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:46:22,847 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 02:46:22,847 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:46:22,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:46:22,848 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8be34918f5cf463066a3551693e083428b9e6ee2 [2018-11-23 02:46:22,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:46:22,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:46:22,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:46:22,886 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:46:22,887 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:46:22,887 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/../../sv-benchmarks/c/forester-heap/sll-sorted_false-unreach-call_false-valid-memcleanup.i [2018-11-23 02:46:22,924 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/data/0427f3776/a9bdfc70223e47509f06166282797ed8/FLAGe4f594cf3 [2018-11-23 02:46:23,363 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:46:23,364 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/sv-benchmarks/c/forester-heap/sll-sorted_false-unreach-call_false-valid-memcleanup.i [2018-11-23 02:46:23,370 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/data/0427f3776/a9bdfc70223e47509f06166282797ed8/FLAGe4f594cf3 [2018-11-23 02:46:23,379 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/data/0427f3776/a9bdfc70223e47509f06166282797ed8 [2018-11-23 02:46:23,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:46:23,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:46:23,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:46:23,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:46:23,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:46:23,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d05c556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23, skipping insertion in model container [2018-11-23 02:46:23,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:46:23,421 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:46:23,617 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:46:23,625 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:46:23,696 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:46:23,727 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:46:23,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23 WrapperNode [2018-11-23 02:46:23,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:46:23,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:46:23,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:46:23,728 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:46:23,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:46:23,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:46:23,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:46:23,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:46:23,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23" (1/1) ... [2018-11-23 02:46:23,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:46:23,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:46:23,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:46:23,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:46:23,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 02:46:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:46:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:46:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:46:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 02:46:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 02:46:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:46:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:46:23,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:46:24,309 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:46:24,310 INFO L280 CfgBuilder]: Removed 22 assue(true) statements. [2018-11-23 02:46:24,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:24 BoogieIcfgContainer [2018-11-23 02:46:24,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:46:24,310 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 02:46:24,311 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 02:46:24,320 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 02:46:24,320 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:24" (1/1) ... [2018-11-23 02:46:24,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:46:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 44 states and 71 transitions. [2018-11-23 02:46:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 71 transitions. [2018-11-23 02:46:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 02:46:24,361 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:24,451 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 02:46:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 44 states and 67 transitions. [2018-11-23 02:46:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2018-11-23 02:46:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 02:46:24,458 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:24,486 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 02:46:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 46 states and 70 transitions. [2018-11-23 02:46:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2018-11-23 02:46:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 02:46:24,536 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:46:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 44 states and 68 transitions. [2018-11-23 02:46:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2018-11-23 02:46:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 02:46:24,778 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:46:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 44 states and 63 transitions. [2018-11-23 02:46:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2018-11-23 02:46:24,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 02:46:24,808 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 58 states and 88 transitions. [2018-11-23 02:46:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2018-11-23 02:46:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 02:46:25,518 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 70 states and 117 transitions. [2018-11-23 02:46:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2018-11-23 02:46:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 02:46:27,502 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 72 states and 125 transitions. [2018-11-23 02:46:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 125 transitions. [2018-11-23 02:46:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 02:46:27,813 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 78 states and 139 transitions. [2018-11-23 02:46:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 139 transitions. [2018-11-23 02:46:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:46:29,147 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:46:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 78 states and 133 transitions. [2018-11-23 02:46:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 133 transitions. [2018-11-23 02:46:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:46:29,166 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:46:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 78 states and 128 transitions. [2018-11-23 02:46:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 128 transitions. [2018-11-23 02:46:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 02:46:29,186 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 93 states and 162 transitions. [2018-11-23 02:46:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 162 transitions. [2018-11-23 02:46:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:46:31,713 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 98 states and 176 transitions. [2018-11-23 02:46:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 176 transitions. [2018-11-23 02:46:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:46:33,672 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 100 states and 187 transitions. [2018-11-23 02:46:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 187 transitions. [2018-11-23 02:46:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:46:34,249 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 86 states and 130 transitions. [2018-11-23 02:46:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2018-11-23 02:46:34,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:46:34,862 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 94 states and 151 transitions. [2018-11-23 02:46:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 151 transitions. [2018-11-23 02:46:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:46:36,835 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 102 states and 169 transitions. [2018-11-23 02:46:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 169 transitions. [2018-11-23 02:46:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:46:38,657 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 105 states and 174 transitions. [2018-11-23 02:46:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 174 transitions. [2018-11-23 02:46:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:46:39,397 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 106 states and 175 transitions. [2018-11-23 02:46:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 175 transitions. [2018-11-23 02:46:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:46:40,281 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 108 states and 179 transitions. [2018-11-23 02:46:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 179 transitions. [2018-11-23 02:46:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:46:41,025 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 122 states and 214 transitions. [2018-11-23 02:46:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 214 transitions. [2018-11-23 02:46:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:46:46,919 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 128 states and 229 transitions. [2018-11-23 02:46:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 229 transitions. [2018-11-23 02:46:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:46:49,168 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 137 states and 252 transitions. [2018-11-23 02:46:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 252 transitions. [2018-11-23 02:46:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:46:52,388 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 142 states and 261 transitions. [2018-11-23 02:46:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 261 transitions. [2018-11-23 02:46:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:46:53,457 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:46:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 145 states and 264 transitions. [2018-11-23 02:46:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 264 transitions. [2018-11-23 02:46:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 02:46:54,661 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:46:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:46:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 146 states and 265 transitions. [2018-11-23 02:46:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 265 transitions. [2018-11-23 02:46:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:46:56,954 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:46:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 157 states and 293 transitions. [2018-11-23 02:47:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 293 transitions. [2018-11-23 02:47:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:47:03,990 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:47:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 164 states and 312 transitions. [2018-11-23 02:47:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 312 transitions. [2018-11-23 02:47:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:47:08,018 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 166 states and 319 transitions. [2018-11-23 02:47:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 319 transitions. [2018-11-23 02:47:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:47:09,147 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 173 states and 329 transitions. [2018-11-23 02:47:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 329 transitions. [2018-11-23 02:47:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:47:14,659 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 176 states and 339 transitions. [2018-11-23 02:47:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 339 transitions. [2018-11-23 02:47:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:47:17,339 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 181 states and 349 transitions. [2018-11-23 02:47:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 349 transitions. [2018-11-23 02:47:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:47:22,090 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 193 states and 381 transitions. [2018-11-23 02:47:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 381 transitions. [2018-11-23 02:47:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:47:31,073 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 195 states and 384 transitions. [2018-11-23 02:47:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 384 transitions. [2018-11-23 02:47:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:47:32,537 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 198 states and 394 transitions. [2018-11-23 02:47:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 394 transitions. [2018-11-23 02:47:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:47:34,968 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 208 states and 422 transitions. [2018-11-23 02:47:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 422 transitions. [2018-11-23 02:47:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:47:41,524 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 210 states and 436 transitions. [2018-11-23 02:47:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 436 transitions. [2018-11-23 02:47:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:47:43,784 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 211 states and 440 transitions. [2018-11-23 02:47:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 440 transitions. [2018-11-23 02:47:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 02:47:45,069 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 214 states and 444 transitions. [2018-11-23 02:47:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 444 transitions. [2018-11-23 02:47:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:47:47,169 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:47:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 218 states and 459 transitions. [2018-11-23 02:47:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 459 transitions. [2018-11-23 02:47:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:47:50,779 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:47:52,028 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2018-11-23 02:47:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:47:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:47:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 220 states and 471 transitions. [2018-11-23 02:47:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 471 transitions. [2018-11-23 02:47:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:47:58,585 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:47:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:48:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:48:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 234 states and 508 transitions. [2018-11-23 02:48:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 508 transitions. [2018-11-23 02:48:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:48:08,433 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:48:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:48:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:48:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 236 states and 513 transitions. [2018-11-23 02:48:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 513 transitions. [2018-11-23 02:48:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:48:10,136 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:48:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:48:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:48:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 238 states and 516 transitions. [2018-11-23 02:48:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 516 transitions. [2018-11-23 02:48:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:48:12,153 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:48:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:48:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:48:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 234 states and 493 transitions. [2018-11-23 02:48:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 493 transitions. [2018-11-23 02:48:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:48:14,078 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:48:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:48:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:48:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 236 states and 499 transitions. [2018-11-23 02:48:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 499 transitions. [2018-11-23 02:48:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:48:15,700 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:48:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:48:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:48:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 244 states and 519 transitions. [2018-11-23 02:48:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 519 transitions. [2018-11-23 02:48:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:48:26,445 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:48:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:48:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:48:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 246 states and 521 transitions. [2018-11-23 02:48:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 521 transitions. [2018-11-23 02:48:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:48:28,081 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:48:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:48:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:48:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 254 states and 542 transitions. [2018-11-23 02:48:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 542 transitions. [2018-11-23 02:48:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:48:44,137 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:48:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:48:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 267 states and 584 transitions. [2018-11-23 02:49:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 584 transitions. [2018-11-23 02:49:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:49:02,434 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 274 states and 598 transitions. [2018-11-23 02:49:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 598 transitions. [2018-11-23 02:49:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:49:11,998 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:49:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 228 states and 480 transitions. [2018-11-23 02:49:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 480 transitions. [2018-11-23 02:49:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:49:15,926 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 233 states and 494 transitions. [2018-11-23 02:49:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 494 transitions. [2018-11-23 02:49:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:49:25,389 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 235 states and 522 transitions. [2018-11-23 02:49:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 522 transitions. [2018-11-23 02:49:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:49:28,456 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 241 states and 560 transitions. [2018-11-23 02:49:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 560 transitions. [2018-11-23 02:49:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:49:37,787 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 243 states and 577 transitions. [2018-11-23 02:49:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 577 transitions. [2018-11-23 02:49:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:49:40,662 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 243 states and 575 transitions. [2018-11-23 02:49:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 575 transitions. [2018-11-23 02:49:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:49:43,439 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 244 states and 580 transitions. [2018-11-23 02:49:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 580 transitions. [2018-11-23 02:49:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:49:44,724 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 250 states and 589 transitions. [2018-11-23 02:49:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 589 transitions. [2018-11-23 02:49:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:49:51,937 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:49:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:49:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:49:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 255 states and 601 transitions. [2018-11-23 02:49:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 601 transitions. [2018-11-23 02:49:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:49:58,490 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:49:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:50:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:50:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:50:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 267 states and 634 transitions. [2018-11-23 02:50:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 634 transitions. [2018-11-23 02:50:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:50:20,524 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:50:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:50:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 02:50:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:50:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 272 states and 649 transitions. [2018-11-23 02:50:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 649 transitions. [2018-11-23 02:50:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:50:25,061 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:50:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:50:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 02:50:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:50:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 275 states and 658 transitions. [2018-11-23 02:50:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 658 transitions. [2018-11-23 02:50:30,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:50:30,057 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:50:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:50:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:50:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:50:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 275 states and 653 transitions. [2018-11-23 02:50:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 653 transitions. [2018-11-23 02:50:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:50:31,295 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:50:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:50:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:50:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:50:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 290 states and 704 transitions. [2018-11-23 02:50:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 704 transitions. [2018-11-23 02:50:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:50:55,538 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:50:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:51:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 292 states and 710 transitions. [2018-11-23 02:51:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 710 transitions. [2018-11-23 02:51:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:51:07,182 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:51:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 304 states and 760 transitions. [2018-11-23 02:51:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 760 transitions. [2018-11-23 02:51:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:51:25,979 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 02:51:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 310 states and 769 transitions. [2018-11-23 02:51:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 769 transitions. [2018-11-23 02:51:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:51:31,602 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:51:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:51:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:51:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 323 states and 803 transitions. [2018-11-23 02:51:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 803 transitions. [2018-11-23 02:51:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:51:58,070 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:51:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:52:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:52:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:52:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 338 states and 836 transitions. [2018-11-23 02:52:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 836 transitions. [2018-11-23 02:52:23,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:52:23,268 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:52:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:52:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:52:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:52:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 340 states and 845 transitions. [2018-11-23 02:52:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 845 transitions. [2018-11-23 02:52:26,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:52:26,893 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:52:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:52:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:52:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:52:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 344 states and 874 transitions. [2018-11-23 02:52:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 874 transitions. [2018-11-23 02:52:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:52:33,297 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:52:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:52:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:52:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:52:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 350 states and 899 transitions. [2018-11-23 02:52:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 899 transitions. [2018-11-23 02:52:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:52:45,942 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:52:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:52:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:52:46,491 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2018-11-23 02:52:46,960 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2018-11-23 02:52:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:52:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 352 states and 902 transitions. [2018-11-23 02:52:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 902 transitions. [2018-11-23 02:52:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:52:48,782 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:52:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:52:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:52:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:52:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 360 states and 918 transitions. [2018-11-23 02:52:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 918 transitions. [2018-11-23 02:52:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:52:58,378 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:52:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:52:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:53:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:53:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 362 states and 938 transitions. [2018-11-23 02:53:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 938 transitions. [2018-11-23 02:53:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:53:02,339 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:53:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:53:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:53:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:53:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 364 states and 961 transitions. [2018-11-23 02:53:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 961 transitions. [2018-11-23 02:53:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:53:05,326 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:53:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:53:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:53:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:53:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 366 states and 967 transitions. [2018-11-23 02:53:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 967 transitions. [2018-11-23 02:53:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:53:09,070 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:53:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:53:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:53:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:53:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 370 states and 980 transitions. [2018-11-23 02:53:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 980 transitions. [2018-11-23 02:53:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:53:18,974 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:53:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:53:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:53:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:53:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 371 states and 985 transitions. [2018-11-23 02:53:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 985 transitions. [2018-11-23 02:53:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:53:21,147 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:53:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:53:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:53:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:53:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 377 states and 1001 transitions. [2018-11-23 02:53:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1001 transitions. [2018-11-23 02:53:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:53:33,338 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:53:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:53:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 02:53:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:53:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 383 states and 1018 transitions. [2018-11-23 02:53:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1018 transitions. [2018-11-23 02:53:43,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:53:43,119 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:53:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:53:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:54:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:54:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 396 states and 1065 transitions. [2018-11-23 02:54:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1065 transitions. [2018-11-23 02:54:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:54:10,880 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:54:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:54:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:54:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:54:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 405 states and 1085 transitions. [2018-11-23 02:54:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1085 transitions. [2018-11-23 02:54:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:54:43,685 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:54:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:54:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:54:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:54:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 407 states and 1094 transitions. [2018-11-23 02:54:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1094 transitions. [2018-11-23 02:54:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:54:45,822 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:54:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:54:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:55:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:55:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 412 states and 1105 transitions. [2018-11-23 02:55:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1105 transitions. [2018-11-23 02:55:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:55:15,807 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:55:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:55:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:55:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:55:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:55:15,951 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 86 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~nondet1, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7, main_#t~short8, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~short12, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem20, main_#t~mem21, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem18, main_#t~short19, main_#t~mem23, main_#t~mem24, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset, main_~marked~0, main_~tmp~0.base, main_~tmp~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4);call write~int(0, main_~head~0.base, 4 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset;main_~marked~0 := 0; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~nondet1|=(- 1)] [?] assume !!(0 != main_#t~nondet1 || 0 == main_~marked~0);havoc main_#t~nondet1;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;call write~$Pointer$(0, 0, main_~x~0.base, main_~x~0.offset, 4);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~marked~0 := 1;ParallelCodeBlock1: assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 != main_~marked~0;call write~int(1, main_~x~0.base, 4 + main_~x~0.offset, 4);ParallelCodeBlock1: assume !(0 != main_~marked~0);call write~int(0, main_~x~0.base, 4 + main_~x~0.offset, 4);}EndParallelComposition VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=7, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=7, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~nondet1|=0] [?] assume !(0 != main_#t~nondet1 || 0 == main_~marked~0);havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=7, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(0 != main_~x~0.base || 0 != main_~x~0.offset); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_~marked~0 := 0; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_#t~short8 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short8;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem7 := read~int(main_#t~mem6.base, 4 + main_#t~mem6.offset, 4);main_#t~short8 := 0 == main_#t~mem7;ParallelCodeBlock1: assume !main_#t~short8;}EndParallelComposition VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem5.base|=7, |ULTIMATE.start_main_#t~mem5.offset|=0, |ULTIMATE.start_main_#t~mem6.base|=7, |ULTIMATE.start_main_#t~mem6.offset|=0, |ULTIMATE.start_main_#t~mem7|=1, |ULTIMATE.start_main_#t~short8|=false] [?] assume !main_#t~short8;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem7;havoc main_#t~short8; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_#t~short12 := main_#t~mem10.base != 0 || main_#t~mem10.offset != 0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short12;assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647;main_#t~short12 := 0 != main_#t~nondet11;ParallelCodeBlock1: assume !main_#t~short12;}EndParallelComposition VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem10.base|=7, |ULTIMATE.start_main_#t~mem10.offset|=0, |ULTIMATE.start_main_#t~nondet11|=0, |ULTIMATE.start_main_#t~short12|=false] [?] assume !main_#t~short12;havoc main_#t~nondet11;havoc main_#t~short12;havoc main_#t~mem10.base, main_#t~mem10.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(8);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(1, main_~tmp~0.base, 4 + main_~tmp~0.offset, 4);call write~$Pointer$(0, 0, main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);BeginParallelComposition{ParallelCodeBlock0: assume main_#t~mem16.base == 0 && main_#t~mem16.offset == 0;havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~tmp~0.base, main_~tmp~0.offset, main_~x~0.base, main_~x~0.offset, 4);ParallelCodeBlock1: assume !(main_#t~mem16.base == 0 && main_#t~mem16.offset == 0);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset;call write~$Pointer$(main_~tmp~0.base, main_~tmp~0.offset, main_~x~0.base, main_~x~0.offset, 4);}EndParallelCompositionmain_~marked~0 := 0;main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short19;call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4);main_#t~short19 := 1 != main_#t~mem18;ParallelCodeBlock1: assume !main_#t~short19;}EndParallelComposition VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0, |ULTIMATE.start_main_#t~mem18|=0, |ULTIMATE.start_main_#t~short19|=true] [?] assume !!main_#t~short19;havoc main_#t~short19;havoc main_#t~mem18;call main_#t~mem20 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4);main_~marked~0 := main_#t~mem20;havoc main_#t~mem20; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] call main_#t~mem21 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0, |ULTIMATE.start_main_#t~mem21|=0] [?] assume !!(0 == main_#t~mem21);havoc main_#t~mem21; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] assume !!(0 == main_~marked~0); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem22.base, main_#t~mem22.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short19;call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4);main_#t~short19 := 1 != main_#t~mem18;ParallelCodeBlock1: assume !main_#t~short19;}EndParallelComposition VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0, |ULTIMATE.start_main_#t~mem18|=1, |ULTIMATE.start_main_#t~short19|=false] [?] assume !main_#t~short19;havoc main_#t~short19;havoc main_#t~mem18; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0);call main_#t~mem23 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4);main_~marked~0 := main_#t~mem23;havoc main_#t~mem23; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] call main_#t~mem24 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0, |ULTIMATE.start_main_#t~mem24|=1] [?] assume !(1 != main_#t~mem24);havoc main_#t~mem24; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] assume !false; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~nondet1, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7, main_#t~short8, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~short12, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem20, main_#t~mem21, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem18, main_#t~short19, main_#t~mem23, main_#t~mem24, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset, main_~marked~0, main_~tmp~0.base, main_~tmp~0.offset; [L985] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L985] main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L986] call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4); [L987] call write~int(0, main_~head~0.base, 4 + main_~head~0.offset, 4); [L989] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; [L990] main_~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet1=-1, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L993-L1009] assume !!(0 != main_#t~nondet1 || 0 == main_~marked~0); [L993] havoc main_#t~nondet1; [L996] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L996] call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~x~0.base, main_~x~0.offset, 4); [L997] call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L997] main_~x~0.base, main_~x~0.offset := main_#t~mem3.base, main_#t~mem3.offset; [L997] havoc main_#t~mem3.base, main_#t~mem3.offset; [L998] call write~$Pointer$(0, 0, main_~x~0.base, main_~x~0.offset, 4); [L1000] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L1000-L1003] assume 0 != main_#t~nondet4; [L1000] havoc main_#t~nondet4; [L1002] main_~marked~0 := 1; [L1005-L1008] assume 0 != main_~marked~0; [L1006] call write~int(1, main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~nondet1=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L993-L1009] assume !(0 != main_#t~nondet1 || 0 == main_~marked~0); [L993] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L1011] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=3, main_~x~0.offset=0] [L1013] assume !!(0 != main_~x~0.base || 0 != main_~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=3, main_~x~0.offset=0] [L1014] main_~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1016] call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1016] main_#t~short8 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; [L1016] assume main_#t~short8; [L1016] call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1016] call main_#t~mem7 := read~int(main_#t~mem6.base, 4 + main_#t~mem6.offset, 4); [L1016] main_#t~short8 := 0 == main_#t~mem7; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem5.base=7, main_#t~mem5.offset=0, main_#t~mem6.base=7, main_#t~mem6.offset=0, main_#t~mem7=1, main_#t~short8=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1016-L1019] assume !main_#t~short8; [L1016] havoc main_#t~mem5.base, main_#t~mem5.offset; [L1016] havoc main_#t~mem6.base, main_#t~mem6.offset; [L1016] havoc main_#t~mem7; [L1016] havoc main_#t~short8; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1021] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1021] main_#t~short12 := main_#t~mem10.base != 0 || main_#t~mem10.offset != 0; [L1021] assume main_#t~short12; [L1021] assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; [L1021] main_#t~short12 := 0 != main_#t~nondet11; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem10.base=7, main_#t~mem10.offset=0, main_#t~nondet11=0, main_#t~short12=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1021-L1025] assume !main_#t~short12; [L1021] havoc main_#t~nondet11; [L1021] havoc main_#t~short12; [L1021] havoc main_#t~mem10.base, main_#t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1027] call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(8); [L1027] main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset; [L1028] call write~int(1, main_~tmp~0.base, 4 + main_~tmp~0.offset, 4); [L1029] call write~$Pointer$(0, 0, main_~tmp~0.base, main_~tmp~0.offset, 4); [L1030] call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1030-L1036] assume !(main_#t~mem16.base == 0 && main_#t~mem16.offset == 0); [L1030] havoc main_#t~mem16.base, main_#t~mem16.offset; [L1034] call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1034] call write~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, main_~tmp~0.base, main_~tmp~0.offset, 4); [L1034] havoc main_#t~mem17.base, main_#t~mem17.offset; [L1035] call write~$Pointer$(main_~tmp~0.base, main_~tmp~0.offset, main_~x~0.base, main_~x~0.offset, 4); [L1038] main_~marked~0 := 0; [L1039] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1041] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0; [L1041] assume main_#t~short19; [L1041] call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem18=0, main_#t~short19=true, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1041-L1047] assume !!main_#t~short19; [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; [L1043] call main_#t~mem20 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1043] main_~marked~0 := main_#t~mem20; [L1043] havoc main_#t~mem20; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1044] call main_#t~mem21 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem21=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1044] assume !!(0 == main_#t~mem21); [L1044] havoc main_#t~mem21; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1045] assume !!(0 == main_~marked~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1046] call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1046] main_~x~0.base, main_~x~0.offset := main_#t~mem22.base, main_#t~mem22.offset; [L1046] havoc main_#t~mem22.base, main_#t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1041] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0; [L1041] assume main_#t~short19; [L1041] call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem18=1, main_#t~short19=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1041-L1047] assume !main_#t~short19; [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1048-L1054] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1050] call main_#t~mem23 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1050] main_~marked~0 := main_#t~mem23; [L1050] havoc main_#t~mem23; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] call main_#t~mem24 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem24=1, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] assume !(1 != main_#t~mem24); [L1051] havoc main_#t~mem24; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~nondet1, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7, main_#t~short8, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~short12, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem20, main_#t~mem21, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem18, main_#t~short19, main_#t~mem23, main_#t~mem24, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset, main_~marked~0, main_~tmp~0.base, main_~tmp~0.offset; [L985] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L985] main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L986] call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4); [L987] call write~int(0, main_~head~0.base, 4 + main_~head~0.offset, 4); [L989] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; [L990] main_~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet1=-1, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L993-L1009] assume !!(0 != main_#t~nondet1 || 0 == main_~marked~0); [L993] havoc main_#t~nondet1; [L996] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L996] call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~x~0.base, main_~x~0.offset, 4); [L997] call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L997] main_~x~0.base, main_~x~0.offset := main_#t~mem3.base, main_#t~mem3.offset; [L997] havoc main_#t~mem3.base, main_#t~mem3.offset; [L998] call write~$Pointer$(0, 0, main_~x~0.base, main_~x~0.offset, 4); [L1000] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L1000-L1003] assume 0 != main_#t~nondet4; [L1000] havoc main_#t~nondet4; [L1002] main_~marked~0 := 1; [L1005-L1008] assume 0 != main_~marked~0; [L1006] call write~int(1, main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~nondet1=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L993-L1009] assume !(0 != main_#t~nondet1 || 0 == main_~marked~0); [L993] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L1011] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=3, main_~x~0.offset=0] [L1013] assume !!(0 != main_~x~0.base || 0 != main_~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=3, main_~x~0.offset=0] [L1014] main_~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1016] call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1016] main_#t~short8 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; [L1016] assume main_#t~short8; [L1016] call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1016] call main_#t~mem7 := read~int(main_#t~mem6.base, 4 + main_#t~mem6.offset, 4); [L1016] main_#t~short8 := 0 == main_#t~mem7; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem5.base=7, main_#t~mem5.offset=0, main_#t~mem6.base=7, main_#t~mem6.offset=0, main_#t~mem7=1, main_#t~short8=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1016-L1019] assume !main_#t~short8; [L1016] havoc main_#t~mem5.base, main_#t~mem5.offset; [L1016] havoc main_#t~mem6.base, main_#t~mem6.offset; [L1016] havoc main_#t~mem7; [L1016] havoc main_#t~short8; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1021] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1021] main_#t~short12 := main_#t~mem10.base != 0 || main_#t~mem10.offset != 0; [L1021] assume main_#t~short12; [L1021] assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; [L1021] main_#t~short12 := 0 != main_#t~nondet11; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem10.base=7, main_#t~mem10.offset=0, main_#t~nondet11=0, main_#t~short12=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1021-L1025] assume !main_#t~short12; [L1021] havoc main_#t~nondet11; [L1021] havoc main_#t~short12; [L1021] havoc main_#t~mem10.base, main_#t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1027] call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(8); [L1027] main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset; [L1028] call write~int(1, main_~tmp~0.base, 4 + main_~tmp~0.offset, 4); [L1029] call write~$Pointer$(0, 0, main_~tmp~0.base, main_~tmp~0.offset, 4); [L1030] call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1030-L1036] assume !(main_#t~mem16.base == 0 && main_#t~mem16.offset == 0); [L1030] havoc main_#t~mem16.base, main_#t~mem16.offset; [L1034] call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1034] call write~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, main_~tmp~0.base, main_~tmp~0.offset, 4); [L1034] havoc main_#t~mem17.base, main_#t~mem17.offset; [L1035] call write~$Pointer$(main_~tmp~0.base, main_~tmp~0.offset, main_~x~0.base, main_~x~0.offset, 4); [L1038] main_~marked~0 := 0; [L1039] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1041] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0; [L1041] assume main_#t~short19; [L1041] call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem18=0, main_#t~short19=true, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1041-L1047] assume !!main_#t~short19; [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; [L1043] call main_#t~mem20 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1043] main_~marked~0 := main_#t~mem20; [L1043] havoc main_#t~mem20; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1044] call main_#t~mem21 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem21=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1044] assume !!(0 == main_#t~mem21); [L1044] havoc main_#t~mem21; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1045] assume !!(0 == main_~marked~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1046] call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1046] main_~x~0.base, main_~x~0.offset := main_#t~mem22.base, main_#t~mem22.offset; [L1046] havoc main_#t~mem22.base, main_#t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1041] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0; [L1041] assume main_#t~short19; [L1041] call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem18=1, main_#t~short19=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1041-L1047] assume !main_#t~short19; [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1048-L1054] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1050] call main_#t~mem23 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1050] main_~marked~0 := main_#t~mem23; [L1050] havoc main_#t~mem23; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] call main_#t~mem24 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem24=1, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] assume !(1 != main_#t~mem24); [L1051] havoc main_#t~mem24; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc2, main_#t~mem3, main_#t~nondet4, main_#t~nondet1, main_#t~mem9, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~short8, main_#t~mem13, main_#t~mem14, main_#t~mem10, main_#t~nondet11, main_#t~short12, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem18, main_#t~short19, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem26, main_~head~0, main_~x~0, main_~marked~0, main_~tmp~0; [L985] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L985] main_~head~0 := main_#t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~head~0!base, offset: main_~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: main_~head~0!base, offset: 4 + main_~head~0!offset }, 4); [L989] main_~x~0 := main_~head~0; [L990] main_~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet1=-1, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != main_#t~nondet1 || 0 == main_~marked~0)) [L993] havoc main_#t~nondet1; [L996] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(main_#t~malloc2, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L997] FCALL call main_#t~mem3 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L997] main_~x~0 := main_#t~mem3; [L997] havoc main_#t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1000] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L1000-L1003] COND TRUE 0 != main_#t~nondet4 [L1000] havoc main_#t~nondet4; [L1002] main_~marked~0 := 1; [L1005-L1008] COND TRUE 0 != main_~marked~0 [L1006] FCALL call write~int(1, { base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~nondet1=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L993-L1009] COND TRUE !(0 != main_#t~nondet1 || 0 == main_~marked~0) [L993] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L1011] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=3, main_~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != main_~x~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=3, main_~x~0!offset=0] [L1014] main_~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1016] FCALL call main_#t~mem5 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1016] main_#t~short8 := main_#t~mem5 != { base: 0, offset: 0 }; [L1016] COND TRUE main_#t~short8 [L1016] FCALL call main_#t~mem6 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1016] FCALL call main_#t~mem7 := read~int({ base: main_#t~mem6!base, offset: 4 + main_#t~mem6!offset }, 4); [L1016] main_#t~short8 := 0 == main_#t~mem7; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem5!base=7, main_#t~mem5!offset=0, main_#t~mem6!base=7, main_#t~mem6!offset=0, main_#t~mem7=1, main_#t~short8=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1016-L1019] COND TRUE !main_#t~short8 [L1016] havoc main_#t~mem5; [L1016] havoc main_#t~mem6; [L1016] havoc main_#t~mem7; [L1016] havoc main_#t~short8; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1021] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1021] main_#t~short12 := main_#t~mem10 != { base: 0, offset: 0 }; [L1021] COND TRUE main_#t~short12 [L1021] assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; [L1021] main_#t~short12 := 0 != main_#t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem10!base=7, main_#t~mem10!offset=0, main_#t~nondet11=0, main_#t~short12=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1021-L1025] COND TRUE !main_#t~short12 [L1021] havoc main_#t~nondet11; [L1021] havoc main_#t~short12; [L1021] havoc main_#t~mem10; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1027] FCALL call main_#t~malloc15 := #Ultimate.alloc(8); [L1027] main_~tmp~0 := main_#t~malloc15; [L1028] FCALL call write~int(1, { base: main_~tmp~0!base, offset: 4 + main_~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~tmp~0!base, offset: main_~tmp~0!offset }, 4); [L1030] FCALL call main_#t~mem16 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1030] COND FALSE !(main_#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc main_#t~mem16; [L1034] FCALL call main_#t~mem17 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(main_#t~mem17, { base: main_~tmp~0!base, offset: main_~tmp~0!offset }, 4); [L1034] havoc main_#t~mem17; [L1035] FCALL call write~$Pointer$(main_~tmp~0, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1038] main_~marked~0 := 0; [L1039] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1041] main_#t~short19 := main_~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE main_#t~short19 [L1041] FCALL call main_#t~mem18 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem18=0, main_#t~short19=true, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1041-L1047] COND FALSE !(!main_#t~short19) [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; [L1043] FCALL call main_#t~mem20 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1043] main_~marked~0 := main_#t~mem20; [L1043] havoc main_#t~mem20; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1044] FCALL call main_#t~mem21 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem21=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1044] COND FALSE !(!(0 == main_#t~mem21)) [L1044] havoc main_#t~mem21; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1045] COND FALSE !(!(0 == main_~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1046] FCALL call main_#t~mem22 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1046] main_~x~0 := main_#t~mem22; [L1046] havoc main_#t~mem22; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1041] main_#t~short19 := main_~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE main_#t~short19 [L1041] FCALL call main_#t~mem18 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem18=1, main_#t~short19=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1041-L1047] COND TRUE !main_#t~short19 [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1048-L1054] COND FALSE !(!(main_~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call main_#t~mem23 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1050] main_~marked~0 := main_#t~mem23; [L1050] havoc main_#t~mem23; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] FCALL call main_#t~mem24 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem24=1, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] COND TRUE !(1 != main_#t~mem24) [L1051] havoc main_#t~mem24; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc2, main_#t~mem3, main_#t~nondet4, main_#t~nondet1, main_#t~mem9, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~short8, main_#t~mem13, main_#t~mem14, main_#t~mem10, main_#t~nondet11, main_#t~short12, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem18, main_#t~short19, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem26, main_~head~0, main_~x~0, main_~marked~0, main_~tmp~0; [L985] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L985] main_~head~0 := main_#t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~head~0!base, offset: main_~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: main_~head~0!base, offset: 4 + main_~head~0!offset }, 4); [L989] main_~x~0 := main_~head~0; [L990] main_~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet1=-1, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != main_#t~nondet1 || 0 == main_~marked~0)) [L993] havoc main_#t~nondet1; [L996] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(main_#t~malloc2, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L997] FCALL call main_#t~mem3 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L997] main_~x~0 := main_#t~mem3; [L997] havoc main_#t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1000] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L1000-L1003] COND TRUE 0 != main_#t~nondet4 [L1000] havoc main_#t~nondet4; [L1002] main_~marked~0 := 1; [L1005-L1008] COND TRUE 0 != main_~marked~0 [L1006] FCALL call write~int(1, { base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~nondet1=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L993-L1009] COND TRUE !(0 != main_#t~nondet1 || 0 == main_~marked~0) [L993] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L1011] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=3, main_~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != main_~x~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=3, main_~x~0!offset=0] [L1014] main_~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1016] FCALL call main_#t~mem5 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1016] main_#t~short8 := main_#t~mem5 != { base: 0, offset: 0 }; [L1016] COND TRUE main_#t~short8 [L1016] FCALL call main_#t~mem6 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1016] FCALL call main_#t~mem7 := read~int({ base: main_#t~mem6!base, offset: 4 + main_#t~mem6!offset }, 4); [L1016] main_#t~short8 := 0 == main_#t~mem7; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem5!base=7, main_#t~mem5!offset=0, main_#t~mem6!base=7, main_#t~mem6!offset=0, main_#t~mem7=1, main_#t~short8=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1016-L1019] COND TRUE !main_#t~short8 [L1016] havoc main_#t~mem5; [L1016] havoc main_#t~mem6; [L1016] havoc main_#t~mem7; [L1016] havoc main_#t~short8; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1021] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1021] main_#t~short12 := main_#t~mem10 != { base: 0, offset: 0 }; [L1021] COND TRUE main_#t~short12 [L1021] assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; [L1021] main_#t~short12 := 0 != main_#t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem10!base=7, main_#t~mem10!offset=0, main_#t~nondet11=0, main_#t~short12=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1021-L1025] COND TRUE !main_#t~short12 [L1021] havoc main_#t~nondet11; [L1021] havoc main_#t~short12; [L1021] havoc main_#t~mem10; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1027] FCALL call main_#t~malloc15 := #Ultimate.alloc(8); [L1027] main_~tmp~0 := main_#t~malloc15; [L1028] FCALL call write~int(1, { base: main_~tmp~0!base, offset: 4 + main_~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~tmp~0!base, offset: main_~tmp~0!offset }, 4); [L1030] FCALL call main_#t~mem16 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1030] COND FALSE !(main_#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc main_#t~mem16; [L1034] FCALL call main_#t~mem17 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(main_#t~mem17, { base: main_~tmp~0!base, offset: main_~tmp~0!offset }, 4); [L1034] havoc main_#t~mem17; [L1035] FCALL call write~$Pointer$(main_~tmp~0, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1038] main_~marked~0 := 0; [L1039] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1041] main_#t~short19 := main_~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE main_#t~short19 [L1041] FCALL call main_#t~mem18 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem18=0, main_#t~short19=true, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1041-L1047] COND FALSE !(!main_#t~short19) [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; [L1043] FCALL call main_#t~mem20 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1043] main_~marked~0 := main_#t~mem20; [L1043] havoc main_#t~mem20; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1044] FCALL call main_#t~mem21 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem21=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1044] COND FALSE !(!(0 == main_#t~mem21)) [L1044] havoc main_#t~mem21; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1045] COND FALSE !(!(0 == main_~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1046] FCALL call main_#t~mem22 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1046] main_~x~0 := main_#t~mem22; [L1046] havoc main_#t~mem22; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1041] main_#t~short19 := main_~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE main_#t~short19 [L1041] FCALL call main_#t~mem18 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem18=1, main_#t~short19=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1041-L1047] COND TRUE !main_#t~short19 [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1048-L1054] COND FALSE !(!(main_~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call main_#t~mem23 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1050] main_~marked~0 := main_#t~mem23; [L1050] havoc main_#t~mem23; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] FCALL call main_#t~mem24 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem24=1, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] COND TRUE !(1 != main_#t~mem24) [L1051] havoc main_#t~mem24; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~mem7; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~short12; [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~short19; [L1041] havoc #t~mem18; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~short19; [L1041] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~mem7; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~short12; [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~short19; [L1041] havoc #t~mem18; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~short19; [L1041] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L989] SLL* x = head; [L990] int marked = 0; [L993] COND TRUE __VERIFIER_nondet_int() || !marked [L996] x->next = malloc(sizeof(SLL)) [L997] EXPR x->next [L997] x = x->next [L998] x->next = ((void*)0) [L1000] COND TRUE __VERIFIER_nondet_int() [L1002] marked = 1 [L1005] COND TRUE \read(marked) [L1006] x->data = 1 [L993] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1014] marked = 0 [L1016] EXPR x->next [L1016] x->next != ((void*)0) && x->next->data == 0 [L1016] EXPR x->next [L1016] EXPR x->next->data [L1016] x->next != ((void*)0) && x->next->data == 0 [L1016] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1021] EXPR x->next [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1021] COND FALSE !(x->next != ((void*)0) && __VERIFIER_nondet_int()) [L1027] SLL* tmp = malloc(sizeof(SLL)); [L1028] tmp->data = 1 [L1029] tmp->next = ((void*)0) [L1030] EXPR x->next [L1030] COND FALSE !(x->next == ((void*)0)) [L1034] EXPR x->next [L1034] tmp->next = x->next [L1035] x->next = tmp [L1038] marked = 0 [L1039] x = head [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 [L1041] COND TRUE x != ((void*)0) && x->data != 1 [L1043] EXPR x->data [L1043] marked = x->data [L1044] EXPR x->data [L1044] COND FALSE !(!(x->data == 0)) [L1045] COND FALSE !(!(marked == 0)) [L1046] EXPR x->next [L1046] x = x->next [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 [L1041] COND FALSE !(x != ((void*)0) && x->data != 1) [L1048] COND TRUE x != ((void*)0) [L1050] EXPR x->data [L1050] marked = x->data [L1051] EXPR x->data [L1051] COND TRUE !(x->data != 1) [L1051] __VERIFIER_error() ----- [2018-11-23 02:55:16,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:55:16 ImpRootNode [2018-11-23 02:55:16,047 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 02:55:16,047 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:55:16,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:55:16,048 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:55:16,048 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:24" (3/4) ... [2018-11-23 02:55:16,050 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~nondet1, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7, main_#t~short8, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~short12, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem20, main_#t~mem21, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem18, main_#t~short19, main_#t~mem23, main_#t~mem24, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset, main_~marked~0, main_~tmp~0.base, main_~tmp~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8);main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4);call write~int(0, main_~head~0.base, 4 + main_~head~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset;main_~marked~0 := 0; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0] [?] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~nondet1|=(- 1)] [?] assume !!(0 != main_#t~nondet1 || 0 == main_~marked~0);havoc main_#t~nondet1;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem3.base, main_#t~mem3.offset;havoc main_#t~mem3.base, main_#t~mem3.offset;call write~$Pointer$(0, 0, main_~x~0.base, main_~x~0.offset, 4);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;BeginParallelComposition{ParallelCodeBlock0: assume 0 != main_#t~nondet4;havoc main_#t~nondet4;main_~marked~0 := 1;ParallelCodeBlock1: assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 != main_~marked~0;call write~int(1, main_~x~0.base, 4 + main_~x~0.offset, 4);ParallelCodeBlock1: assume !(0 != main_~marked~0);call write~int(0, main_~x~0.base, 4 + main_~x~0.offset, 4);}EndParallelComposition VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=7, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=7, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~nondet1|=0] [?] assume !(0 != main_#t~nondet1 || 0 == main_~marked~0);havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=7, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] assume !!(0 != main_~x~0.base || 0 != main_~x~0.offset); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] main_~marked~0 := 0; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_#t~short8 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short8;call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call main_#t~mem7 := read~int(main_#t~mem6.base, 4 + main_#t~mem6.offset, 4);main_#t~short8 := 0 == main_#t~mem7;ParallelCodeBlock1: assume !main_#t~short8;}EndParallelComposition VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem5.base|=7, |ULTIMATE.start_main_#t~mem5.offset|=0, |ULTIMATE.start_main_#t~mem6.base|=7, |ULTIMATE.start_main_#t~mem6.offset|=0, |ULTIMATE.start_main_#t~mem7|=1, |ULTIMATE.start_main_#t~short8|=false] [?] assume !main_#t~short8;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem7;havoc main_#t~short8; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_#t~short12 := main_#t~mem10.base != 0 || main_#t~mem10.offset != 0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short12;assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647;main_#t~short12 := 0 != main_#t~nondet11;ParallelCodeBlock1: assume !main_#t~short12;}EndParallelComposition VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem10.base|=7, |ULTIMATE.start_main_#t~mem10.offset|=0, |ULTIMATE.start_main_#t~nondet11|=0, |ULTIMATE.start_main_#t~short12|=false] [?] assume !main_#t~short12;havoc main_#t~nondet11;havoc main_#t~short12;havoc main_#t~mem10.base, main_#t~mem10.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0] [?] call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(8);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(1, main_~tmp~0.base, 4 + main_~tmp~0.offset, 4);call write~$Pointer$(0, 0, main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);BeginParallelComposition{ParallelCodeBlock0: assume main_#t~mem16.base == 0 && main_#t~mem16.offset == 0;havoc main_#t~mem16.base, main_#t~mem16.offset;call write~$Pointer$(main_~tmp~0.base, main_~tmp~0.offset, main_~x~0.base, main_~x~0.offset, 4);ParallelCodeBlock1: assume !(main_#t~mem16.base == 0 && main_#t~mem16.offset == 0);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);call write~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset;call write~$Pointer$(main_~tmp~0.base, main_~tmp~0.offset, main_~x~0.base, main_~x~0.offset, 4);}EndParallelCompositionmain_~marked~0 := 0;main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short19;call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4);main_#t~short19 := 1 != main_#t~mem18;ParallelCodeBlock1: assume !main_#t~short19;}EndParallelComposition VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0, |ULTIMATE.start_main_#t~mem18|=0, |ULTIMATE.start_main_#t~short19|=true] [?] assume !!main_#t~short19;havoc main_#t~short19;havoc main_#t~mem18;call main_#t~mem20 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4);main_~marked~0 := main_#t~mem20;havoc main_#t~mem20; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] call main_#t~mem21 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0, |ULTIMATE.start_main_#t~mem21|=0] [?] assume !!(0 == main_#t~mem21);havoc main_#t~mem21; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] assume !!(0 == main_~marked~0); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] goto; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=3, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4);main_~x~0.base, main_~x~0.offset := main_#t~mem22.base, main_#t~mem22.offset;havoc main_#t~mem22.base, main_#t~mem22.offset; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short19;call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4);main_#t~short19 := 1 != main_#t~mem18;ParallelCodeBlock1: assume !main_#t~short19;}EndParallelComposition VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0, |ULTIMATE.start_main_#t~mem18|=1, |ULTIMATE.start_main_#t~short19|=false] [?] assume !main_#t~short19;havoc main_#t~short19;havoc main_#t~mem18; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=0, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0);call main_#t~mem23 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4);main_~marked~0 := main_#t~mem23;havoc main_#t~mem23; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] call main_#t~mem24 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0, |ULTIMATE.start_main_#t~mem24|=1] [?] assume !(1 != main_#t~mem24);havoc main_#t~mem24; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] assume !false; VAL [ULTIMATE.start_main_~head~0.base=3, ULTIMATE.start_main_~head~0.offset=0, ULTIMATE.start_main_~marked~0=1, ULTIMATE.start_main_~tmp~0.base=13, ULTIMATE.start_main_~tmp~0.offset=0, ULTIMATE.start_main_~x~0.base=13, ULTIMATE.start_main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~malloc0.base|=3, |ULTIMATE.start_main_#t~malloc0.offset|=0, |ULTIMATE.start_main_#t~malloc15.base|=13, |ULTIMATE.start_main_#t~malloc15.offset|=0, |ULTIMATE.start_main_#t~malloc2.base|=7, |ULTIMATE.start_main_#t~malloc2.offset|=0, |ULTIMATE.start_main_#t~mem17.base|=0, |ULTIMATE.start_main_#t~mem17.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~nondet1, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7, main_#t~short8, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~short12, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem20, main_#t~mem21, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem18, main_#t~short19, main_#t~mem23, main_#t~mem24, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset, main_~marked~0, main_~tmp~0.base, main_~tmp~0.offset; [L985] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L985] main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L986] call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4); [L987] call write~int(0, main_~head~0.base, 4 + main_~head~0.offset, 4); [L989] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; [L990] main_~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet1=-1, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L993-L1009] assume !!(0 != main_#t~nondet1 || 0 == main_~marked~0); [L993] havoc main_#t~nondet1; [L996] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L996] call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~x~0.base, main_~x~0.offset, 4); [L997] call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L997] main_~x~0.base, main_~x~0.offset := main_#t~mem3.base, main_#t~mem3.offset; [L997] havoc main_#t~mem3.base, main_#t~mem3.offset; [L998] call write~$Pointer$(0, 0, main_~x~0.base, main_~x~0.offset, 4); [L1000] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L1000-L1003] assume 0 != main_#t~nondet4; [L1000] havoc main_#t~nondet4; [L1002] main_~marked~0 := 1; [L1005-L1008] assume 0 != main_~marked~0; [L1006] call write~int(1, main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~nondet1=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L993-L1009] assume !(0 != main_#t~nondet1 || 0 == main_~marked~0); [L993] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L1011] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=3, main_~x~0.offset=0] [L1013] assume !!(0 != main_~x~0.base || 0 != main_~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=3, main_~x~0.offset=0] [L1014] main_~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1016] call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1016] main_#t~short8 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; [L1016] assume main_#t~short8; [L1016] call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1016] call main_#t~mem7 := read~int(main_#t~mem6.base, 4 + main_#t~mem6.offset, 4); [L1016] main_#t~short8 := 0 == main_#t~mem7; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem5.base=7, main_#t~mem5.offset=0, main_#t~mem6.base=7, main_#t~mem6.offset=0, main_#t~mem7=1, main_#t~short8=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1016-L1019] assume !main_#t~short8; [L1016] havoc main_#t~mem5.base, main_#t~mem5.offset; [L1016] havoc main_#t~mem6.base, main_#t~mem6.offset; [L1016] havoc main_#t~mem7; [L1016] havoc main_#t~short8; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1021] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1021] main_#t~short12 := main_#t~mem10.base != 0 || main_#t~mem10.offset != 0; [L1021] assume main_#t~short12; [L1021] assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; [L1021] main_#t~short12 := 0 != main_#t~nondet11; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem10.base=7, main_#t~mem10.offset=0, main_#t~nondet11=0, main_#t~short12=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1021-L1025] assume !main_#t~short12; [L1021] havoc main_#t~nondet11; [L1021] havoc main_#t~short12; [L1021] havoc main_#t~mem10.base, main_#t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1027] call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(8); [L1027] main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset; [L1028] call write~int(1, main_~tmp~0.base, 4 + main_~tmp~0.offset, 4); [L1029] call write~$Pointer$(0, 0, main_~tmp~0.base, main_~tmp~0.offset, 4); [L1030] call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1030-L1036] assume !(main_#t~mem16.base == 0 && main_#t~mem16.offset == 0); [L1030] havoc main_#t~mem16.base, main_#t~mem16.offset; [L1034] call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1034] call write~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, main_~tmp~0.base, main_~tmp~0.offset, 4); [L1034] havoc main_#t~mem17.base, main_#t~mem17.offset; [L1035] call write~$Pointer$(main_~tmp~0.base, main_~tmp~0.offset, main_~x~0.base, main_~x~0.offset, 4); [L1038] main_~marked~0 := 0; [L1039] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1041] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0; [L1041] assume main_#t~short19; [L1041] call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem18=0, main_#t~short19=true, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1041-L1047] assume !!main_#t~short19; [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; [L1043] call main_#t~mem20 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1043] main_~marked~0 := main_#t~mem20; [L1043] havoc main_#t~mem20; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1044] call main_#t~mem21 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem21=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1044] assume !!(0 == main_#t~mem21); [L1044] havoc main_#t~mem21; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1045] assume !!(0 == main_~marked~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1046] call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1046] main_~x~0.base, main_~x~0.offset := main_#t~mem22.base, main_#t~mem22.offset; [L1046] havoc main_#t~mem22.base, main_#t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1041] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0; [L1041] assume main_#t~short19; [L1041] call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem18=1, main_#t~short19=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1041-L1047] assume !main_#t~short19; [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1048-L1054] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1050] call main_#t~mem23 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1050] main_~marked~0 := main_#t~mem23; [L1050] havoc main_#t~mem23; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] call main_#t~mem24 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem24=1, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] assume !(1 != main_#t~mem24); [L1051] havoc main_#t~mem24; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~mem3.base, main_#t~mem3.offset, main_#t~nondet4, main_#t~nondet1, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~mem7, main_#t~short8, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~short12, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem20, main_#t~mem21, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem18, main_#t~short19, main_#t~mem23, main_#t~mem24, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_~head~0.base, main_~head~0.offset, main_~x~0.base, main_~x~0.offset, main_~marked~0, main_~tmp~0.base, main_~tmp~0.offset; [L985] call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(8); [L985] main_~head~0.base, main_~head~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset; [L986] call write~$Pointer$(0, 0, main_~head~0.base, main_~head~0.offset, 4); [L987] call write~int(0, main_~head~0.base, 4 + main_~head~0.offset, 4); [L989] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; [L990] main_~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~nondet1=-1, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L993-L1009] assume !!(0 != main_#t~nondet1 || 0 == main_~marked~0); [L993] havoc main_#t~nondet1; [L996] call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(8); [L996] call write~$Pointer$(main_#t~malloc2.base, main_#t~malloc2.offset, main_~x~0.base, main_~x~0.offset, 4); [L997] call main_#t~mem3.base, main_#t~mem3.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L997] main_~x~0.base, main_~x~0.offset := main_#t~mem3.base, main_#t~mem3.offset; [L997] havoc main_#t~mem3.base, main_#t~mem3.offset; [L998] call write~$Pointer$(0, 0, main_~x~0.base, main_~x~0.offset, 4); [L1000] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L1000-L1003] assume 0 != main_#t~nondet4; [L1000] havoc main_#t~nondet4; [L1002] main_~marked~0 := 1; [L1005-L1008] assume 0 != main_~marked~0; [L1006] call write~int(1, main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~nondet1=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L993-L1009] assume !(0 != main_#t~nondet1 || 0 == main_~marked~0); [L993] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=7, main_~x~0.offset=0] [L1011] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=3, main_~x~0.offset=0] [L1013] assume !!(0 != main_~x~0.base || 0 != main_~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=3, main_~x~0.offset=0] [L1014] main_~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1016] call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1016] main_#t~short8 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; [L1016] assume main_#t~short8; [L1016] call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1016] call main_#t~mem7 := read~int(main_#t~mem6.base, 4 + main_#t~mem6.offset, 4); [L1016] main_#t~short8 := 0 == main_#t~mem7; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem5.base=7, main_#t~mem5.offset=0, main_#t~mem6.base=7, main_#t~mem6.offset=0, main_#t~mem7=1, main_#t~short8=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1016-L1019] assume !main_#t~short8; [L1016] havoc main_#t~mem5.base, main_#t~mem5.offset; [L1016] havoc main_#t~mem6.base, main_#t~mem6.offset; [L1016] havoc main_#t~mem7; [L1016] havoc main_#t~short8; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1021] call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1021] main_#t~short12 := main_#t~mem10.base != 0 || main_#t~mem10.offset != 0; [L1021] assume main_#t~short12; [L1021] assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; [L1021] main_#t~short12 := 0 != main_#t~nondet11; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem10.base=7, main_#t~mem10.offset=0, main_#t~nondet11=0, main_#t~short12=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1021-L1025] assume !main_#t~short12; [L1021] havoc main_#t~nondet11; [L1021] havoc main_#t~short12; [L1021] havoc main_#t~mem10.base, main_#t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=3, main_~x~0.offset=0] [L1027] call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(8); [L1027] main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset; [L1028] call write~int(1, main_~tmp~0.base, 4 + main_~tmp~0.offset, 4); [L1029] call write~$Pointer$(0, 0, main_~tmp~0.base, main_~tmp~0.offset, 4); [L1030] call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1030-L1036] assume !(main_#t~mem16.base == 0 && main_#t~mem16.offset == 0); [L1030] havoc main_#t~mem16.base, main_#t~mem16.offset; [L1034] call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1034] call write~$Pointer$(main_#t~mem17.base, main_#t~mem17.offset, main_~tmp~0.base, main_~tmp~0.offset, 4); [L1034] havoc main_#t~mem17.base, main_#t~mem17.offset; [L1035] call write~$Pointer$(main_~tmp~0.base, main_~tmp~0.offset, main_~x~0.base, main_~x~0.offset, 4); [L1038] main_~marked~0 := 0; [L1039] main_~x~0.base, main_~x~0.offset := main_~head~0.base, main_~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1041] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0; [L1041] assume main_#t~short19; [L1041] call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem18=0, main_#t~short19=true, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1041-L1047] assume !!main_#t~short19; [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; [L1043] call main_#t~mem20 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1043] main_~marked~0 := main_#t~mem20; [L1043] havoc main_#t~mem20; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1044] call main_#t~mem21 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem21=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1044] assume !!(0 == main_#t~mem21); [L1044] havoc main_#t~mem21; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1045] assume !!(0 == main_~marked~0); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=3, main_~x~0.offset=0] [L1046] call main_#t~mem22.base, main_#t~mem22.offset := read~$Pointer$(main_~x~0.base, main_~x~0.offset, 4); [L1046] main_~x~0.base, main_~x~0.offset := main_#t~mem22.base, main_#t~mem22.offset; [L1046] havoc main_#t~mem22.base, main_#t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1041] main_#t~short19 := main_~x~0.base != 0 || main_~x~0.offset != 0; [L1041] assume main_#t~short19; [L1041] call main_#t~mem18 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem18=1, main_#t~short19=false, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1041-L1047] assume !main_#t~short19; [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1048-L1054] assume !!(main_~x~0.base != 0 || main_~x~0.offset != 0); [L1050] call main_#t~mem23 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); [L1050] main_~marked~0 := main_#t~mem23; [L1050] havoc main_#t~mem23; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] call main_#t~mem24 := read~int(main_~x~0.base, 4 + main_~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_#t~mem24=1, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] assume !(1 != main_#t~mem24); [L1051] havoc main_#t~mem24; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [L1051] assert false; VAL [#NULL.base=0, #NULL.offset=0, main_#t~malloc0.base=3, main_#t~malloc0.offset=0, main_#t~malloc15.base=13, main_#t~malloc15.offset=0, main_#t~malloc2.base=7, main_#t~malloc2.offset=0, main_#t~mem17.base=0, main_#t~mem17.offset=0, main_~head~0.base=3, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=13, main_~tmp~0.offset=0, main_~x~0.base=13, main_~x~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc2, main_#t~mem3, main_#t~nondet4, main_#t~nondet1, main_#t~mem9, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~short8, main_#t~mem13, main_#t~mem14, main_#t~mem10, main_#t~nondet11, main_#t~short12, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem18, main_#t~short19, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem26, main_~head~0, main_~x~0, main_~marked~0, main_~tmp~0; [L985] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L985] main_~head~0 := main_#t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~head~0!base, offset: main_~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: main_~head~0!base, offset: 4 + main_~head~0!offset }, 4); [L989] main_~x~0 := main_~head~0; [L990] main_~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet1=-1, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != main_#t~nondet1 || 0 == main_~marked~0)) [L993] havoc main_#t~nondet1; [L996] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(main_#t~malloc2, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L997] FCALL call main_#t~mem3 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L997] main_~x~0 := main_#t~mem3; [L997] havoc main_#t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1000] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L1000-L1003] COND TRUE 0 != main_#t~nondet4 [L1000] havoc main_#t~nondet4; [L1002] main_~marked~0 := 1; [L1005-L1008] COND TRUE 0 != main_~marked~0 [L1006] FCALL call write~int(1, { base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~nondet1=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L993-L1009] COND TRUE !(0 != main_#t~nondet1 || 0 == main_~marked~0) [L993] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L1011] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=3, main_~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != main_~x~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=3, main_~x~0!offset=0] [L1014] main_~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1016] FCALL call main_#t~mem5 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1016] main_#t~short8 := main_#t~mem5 != { base: 0, offset: 0 }; [L1016] COND TRUE main_#t~short8 [L1016] FCALL call main_#t~mem6 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1016] FCALL call main_#t~mem7 := read~int({ base: main_#t~mem6!base, offset: 4 + main_#t~mem6!offset }, 4); [L1016] main_#t~short8 := 0 == main_#t~mem7; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem5!base=7, main_#t~mem5!offset=0, main_#t~mem6!base=7, main_#t~mem6!offset=0, main_#t~mem7=1, main_#t~short8=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1016-L1019] COND TRUE !main_#t~short8 [L1016] havoc main_#t~mem5; [L1016] havoc main_#t~mem6; [L1016] havoc main_#t~mem7; [L1016] havoc main_#t~short8; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1021] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1021] main_#t~short12 := main_#t~mem10 != { base: 0, offset: 0 }; [L1021] COND TRUE main_#t~short12 [L1021] assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; [L1021] main_#t~short12 := 0 != main_#t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem10!base=7, main_#t~mem10!offset=0, main_#t~nondet11=0, main_#t~short12=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1021-L1025] COND TRUE !main_#t~short12 [L1021] havoc main_#t~nondet11; [L1021] havoc main_#t~short12; [L1021] havoc main_#t~mem10; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1027] FCALL call main_#t~malloc15 := #Ultimate.alloc(8); [L1027] main_~tmp~0 := main_#t~malloc15; [L1028] FCALL call write~int(1, { base: main_~tmp~0!base, offset: 4 + main_~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~tmp~0!base, offset: main_~tmp~0!offset }, 4); [L1030] FCALL call main_#t~mem16 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1030] COND FALSE !(main_#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc main_#t~mem16; [L1034] FCALL call main_#t~mem17 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(main_#t~mem17, { base: main_~tmp~0!base, offset: main_~tmp~0!offset }, 4); [L1034] havoc main_#t~mem17; [L1035] FCALL call write~$Pointer$(main_~tmp~0, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1038] main_~marked~0 := 0; [L1039] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1041] main_#t~short19 := main_~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE main_#t~short19 [L1041] FCALL call main_#t~mem18 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem18=0, main_#t~short19=true, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1041-L1047] COND FALSE !(!main_#t~short19) [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; [L1043] FCALL call main_#t~mem20 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1043] main_~marked~0 := main_#t~mem20; [L1043] havoc main_#t~mem20; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1044] FCALL call main_#t~mem21 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem21=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1044] COND FALSE !(!(0 == main_#t~mem21)) [L1044] havoc main_#t~mem21; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1045] COND FALSE !(!(0 == main_~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1046] FCALL call main_#t~mem22 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1046] main_~x~0 := main_#t~mem22; [L1046] havoc main_#t~mem22; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1041] main_#t~short19 := main_~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE main_#t~short19 [L1041] FCALL call main_#t~mem18 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem18=1, main_#t~short19=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1041-L1047] COND TRUE !main_#t~short19 [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1048-L1054] COND FALSE !(!(main_~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call main_#t~mem23 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1050] main_~marked~0 := main_#t~mem23; [L1050] havoc main_#t~mem23; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] FCALL call main_#t~mem24 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem24=1, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] COND TRUE !(1 != main_#t~mem24) [L1051] havoc main_#t~mem24; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~malloc0, main_#t~malloc2, main_#t~mem3, main_#t~nondet4, main_#t~nondet1, main_#t~mem9, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~short8, main_#t~mem13, main_#t~mem14, main_#t~mem10, main_#t~nondet11, main_#t~short12, main_#t~malloc15, main_#t~mem16, main_#t~mem17, main_#t~mem20, main_#t~mem21, main_#t~mem22, main_#t~mem18, main_#t~short19, main_#t~mem23, main_#t~mem24, main_#t~mem25, main_#t~mem26, main_~head~0, main_~x~0, main_~marked~0, main_~tmp~0; [L985] FCALL call main_#t~malloc0 := #Ultimate.alloc(8); [L985] main_~head~0 := main_#t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~head~0!base, offset: main_~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: main_~head~0!base, offset: 4 + main_~head~0!offset }, 4); [L989] main_~x~0 := main_~head~0; [L990] main_~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~nondet1=-1, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != main_#t~nondet1 || 0 == main_~marked~0)) [L993] havoc main_#t~nondet1; [L996] FCALL call main_#t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(main_#t~malloc2, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L997] FCALL call main_#t~mem3 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L997] main_~x~0 := main_#t~mem3; [L997] havoc main_#t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1000] assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; [L1000-L1003] COND TRUE 0 != main_#t~nondet4 [L1000] havoc main_#t~nondet4; [L1002] main_~marked~0 := 1; [L1005-L1008] COND TRUE 0 != main_~marked~0 [L1006] FCALL call write~int(1, { base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L993] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~nondet1=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L993-L1009] COND TRUE !(0 != main_#t~nondet1 || 0 == main_~marked~0) [L993] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=7, main_~x~0!offset=0] [L1011] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=3, main_~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != main_~x~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~x~0!base=3, main_~x~0!offset=0] [L1014] main_~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1016] FCALL call main_#t~mem5 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1016] main_#t~short8 := main_#t~mem5 != { base: 0, offset: 0 }; [L1016] COND TRUE main_#t~short8 [L1016] FCALL call main_#t~mem6 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1016] FCALL call main_#t~mem7 := read~int({ base: main_#t~mem6!base, offset: 4 + main_#t~mem6!offset }, 4); [L1016] main_#t~short8 := 0 == main_#t~mem7; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem5!base=7, main_#t~mem5!offset=0, main_#t~mem6!base=7, main_#t~mem6!offset=0, main_#t~mem7=1, main_#t~short8=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1016-L1019] COND TRUE !main_#t~short8 [L1016] havoc main_#t~mem5; [L1016] havoc main_#t~mem6; [L1016] havoc main_#t~mem7; [L1016] havoc main_#t~short8; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1021] FCALL call main_#t~mem10 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1021] main_#t~short12 := main_#t~mem10 != { base: 0, offset: 0 }; [L1021] COND TRUE main_#t~short12 [L1021] assume -2147483648 <= main_#t~nondet11 && main_#t~nondet11 <= 2147483647; [L1021] main_#t~short12 := 0 != main_#t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem10!base=7, main_#t~mem10!offset=0, main_#t~nondet11=0, main_#t~short12=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1021-L1025] COND TRUE !main_#t~short12 [L1021] havoc main_#t~nondet11; [L1021] havoc main_#t~short12; [L1021] havoc main_#t~mem10; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~x~0!base=3, main_~x~0!offset=0] [L1027] FCALL call main_#t~malloc15 := #Ultimate.alloc(8); [L1027] main_~tmp~0 := main_#t~malloc15; [L1028] FCALL call write~int(1, { base: main_~tmp~0!base, offset: 4 + main_~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: main_~tmp~0!base, offset: main_~tmp~0!offset }, 4); [L1030] FCALL call main_#t~mem16 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1030] COND FALSE !(main_#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc main_#t~mem16; [L1034] FCALL call main_#t~mem17 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(main_#t~mem17, { base: main_~tmp~0!base, offset: main_~tmp~0!offset }, 4); [L1034] havoc main_#t~mem17; [L1035] FCALL call write~$Pointer$(main_~tmp~0, { base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1038] main_~marked~0 := 0; [L1039] main_~x~0 := main_~head~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1041] main_#t~short19 := main_~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE main_#t~short19 [L1041] FCALL call main_#t~mem18 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem18=0, main_#t~short19=true, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1041-L1047] COND FALSE !(!main_#t~short19) [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; [L1043] FCALL call main_#t~mem20 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1043] main_~marked~0 := main_#t~mem20; [L1043] havoc main_#t~mem20; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1044] FCALL call main_#t~mem21 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem21=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1044] COND FALSE !(!(0 == main_#t~mem21)) [L1044] havoc main_#t~mem21; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1045] COND FALSE !(!(0 == main_~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=3, main_~x~0!offset=0] [L1046] FCALL call main_#t~mem22 := read~$Pointer$({ base: main_~x~0!base, offset: main_~x~0!offset }, 4); [L1046] main_~x~0 := main_#t~mem22; [L1046] havoc main_#t~mem22; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1041] main_#t~short19 := main_~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE main_#t~short19 [L1041] FCALL call main_#t~mem18 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1041] main_#t~short19 := 1 != main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem18=1, main_#t~short19=false, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1041-L1047] COND TRUE !main_#t~short19 [L1041] havoc main_#t~short19; [L1041] havoc main_#t~mem18; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=0, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1048-L1054] COND FALSE !(!(main_~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call main_#t~mem23 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); [L1050] main_~marked~0 := main_#t~mem23; [L1050] havoc main_#t~mem23; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] FCALL call main_#t~mem24 := read~int({ base: main_~x~0!base, offset: 4 + main_~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_#t~mem24=1, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] COND TRUE !(1 != main_#t~mem24) [L1051] havoc main_#t~mem24; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, main_#t~malloc0!base=3, main_#t~malloc0!offset=0, main_#t~malloc15!base=13, main_#t~malloc15!offset=0, main_#t~malloc2!base=7, main_#t~malloc2!offset=0, main_#t~mem17!base=0, main_#t~mem17!offset=0, main_~head~0!base=3, main_~head~0!offset=0, main_~marked~0=1, main_~tmp~0!base=13, main_~tmp~0!offset=0, main_~x~0!base=13, main_~x~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~mem7; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~short12; [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~short19; [L1041] havoc #t~mem18; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~short19; [L1041] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~mem7; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~short12; [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~short19; [L1041] havoc #t~mem18; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~short19; [L1041] havoc #t~mem18; VAL [#NULL!base=0, #NULL!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L989] SLL* x = head; [L990] int marked = 0; [L993] COND TRUE __VERIFIER_nondet_int() || !marked [L996] x->next = malloc(sizeof(SLL)) [L997] EXPR x->next [L997] x = x->next [L998] x->next = ((void*)0) [L1000] COND TRUE __VERIFIER_nondet_int() [L1002] marked = 1 [L1005] COND TRUE \read(marked) [L1006] x->data = 1 [L993] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1014] marked = 0 [L1016] EXPR x->next [L1016] x->next != ((void*)0) && x->next->data == 0 [L1016] EXPR x->next [L1016] EXPR x->next->data [L1016] x->next != ((void*)0) && x->next->data == 0 [L1016] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1021] EXPR x->next [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1021] COND FALSE !(x->next != ((void*)0) && __VERIFIER_nondet_int()) [L1027] SLL* tmp = malloc(sizeof(SLL)); [L1028] tmp->data = 1 [L1029] tmp->next = ((void*)0) [L1030] EXPR x->next [L1030] COND FALSE !(x->next == ((void*)0)) [L1034] EXPR x->next [L1034] tmp->next = x->next [L1035] x->next = tmp [L1038] marked = 0 [L1039] x = head [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 [L1041] COND TRUE x != ((void*)0) && x->data != 1 [L1043] EXPR x->data [L1043] marked = x->data [L1044] EXPR x->data [L1044] COND FALSE !(!(x->data == 0)) [L1045] COND FALSE !(!(marked == 0)) [L1046] EXPR x->next [L1046] x = x->next [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 [L1041] COND FALSE !(x != ((void*)0) && x->data != 1) [L1048] COND TRUE x != ((void*)0) [L1050] EXPR x->data [L1050] marked = x->data [L1051] EXPR x->data [L1051] COND TRUE !(x->data != 1) [L1051] __VERIFIER_error() ----- [2018-11-23 02:55:16,288 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f576ce88-c435-4912-985b-8140c8cdb3a9/bin-2019/ukojak/witness.graphml [2018-11-23 02:55:16,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:55:16,289 INFO L168 Benchmark]: Toolchain (without parser) took 532907.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 400.6 MB). Free memory was 951.1 MB in the beginning and 578.5 MB in the end (delta: 372.5 MB). Peak memory consumption was 773.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:55:16,289 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:55:16,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -202.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:55:16,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:55:16,290 INFO L168 Benchmark]: Boogie Preprocessor took 23.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:55:16,290 INFO L168 Benchmark]: RCFGBuilder took 526.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:55:16,290 INFO L168 Benchmark]: CodeCheck took 531736.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 589.6 MB in the end (delta: 511.9 MB). Peak memory consumption was 743.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:55:16,290 INFO L168 Benchmark]: Witness Printer took 241.00 ms. Allocated memory is still 1.4 GB. Free memory was 589.6 MB in the beginning and 578.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:55:16,292 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 56 locations, 6 error locations. UNSAFE Result, 531.6s OverallTime, 86 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 262144 SDtfs, 1888595502 SDslu, -160625516 SDs, 0 SdLazy, -371774158 SolverSat, -2139535020 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 290.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23319 GetRequests, 20514 SyntacticMatches, 1115 SemanticMatches, 1690 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1726476 ImplicationChecksByTransitivity, 518.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 90.7s InterpolantComputationTime, 1992 NumberOfCodeBlocks, 1992 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 1879 ConstructedInterpolants, 0 QuantifiedInterpolants, 1576804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 85 InterpolantComputations, 13 PerfectInterpolantSequences, 99/1000 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 1051]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L989] SLL* x = head; [L990] int marked = 0; [L993] COND TRUE __VERIFIER_nondet_int() || !marked [L996] x->next = malloc(sizeof(SLL)) [L997] EXPR x->next [L997] x = x->next [L998] x->next = ((void*)0) [L1000] COND TRUE __VERIFIER_nondet_int() [L1002] marked = 1 [L1005] COND TRUE \read(marked) [L1006] x->data = 1 [L993] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1011] x = head [L1013] COND FALSE !(!(((void*)0) != x)) [L1014] marked = 0 [L1016] EXPR x->next [L1016] x->next != ((void*)0) && x->next->data == 0 [L1016] EXPR x->next [L1016] EXPR x->next->data [L1016] x->next != ((void*)0) && x->next->data == 0 [L1016] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1021] EXPR x->next [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1021] COND FALSE !(x->next != ((void*)0) && __VERIFIER_nondet_int()) [L1027] SLL* tmp = malloc(sizeof(SLL)); [L1028] tmp->data = 1 [L1029] tmp->next = ((void*)0) [L1030] EXPR x->next [L1030] COND FALSE !(x->next == ((void*)0)) [L1034] EXPR x->next [L1034] tmp->next = x->next [L1035] x->next = tmp [L1038] marked = 0 [L1039] x = head [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 [L1041] COND TRUE x != ((void*)0) && x->data != 1 [L1043] EXPR x->data [L1043] marked = x->data [L1044] EXPR x->data [L1044] COND FALSE !(!(x->data == 0)) [L1045] COND FALSE !(!(marked == 0)) [L1046] EXPR x->next [L1046] x = x->next [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 [L1041] COND FALSE !(x != ((void*)0) && x->data != 1) [L1048] COND TRUE x != ((void*)0) [L1050] EXPR x->data [L1050] marked = x->data [L1051] EXPR x->data [L1051] COND TRUE !(x->data != 1) [L1051] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -202.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 526.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * CodeCheck took 531736.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.1 GB in the beginning and 589.6 MB in the end (delta: 511.9 MB). Peak memory consumption was 743.6 MB. Max. memory is 11.5 GB. * Witness Printer took 241.00 ms. Allocated memory is still 1.4 GB. Free memory was 589.6 MB in the beginning and 578.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...