./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular_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_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b651d63eb42259dfd3a213a6671e4c58ee528ad0 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:26:00,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:26:00,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:26:00,139 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:26:00,140 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:26:00,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:26:00,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:26:00,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:26:00,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:26:00,144 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:26:00,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:26:00,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:26:00,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:26:00,146 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:26:00,147 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:26:00,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:26:00,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:26:00,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:26:00,150 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:26:00,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:26:00,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:26:00,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:26:00,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:26:00,154 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:26:00,154 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:26:00,155 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:26:00,155 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:26:00,156 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:26:00,156 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:26:00,157 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:26:00,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:26:00,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:26:00,158 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:26:00,158 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:26:00,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:26:00,159 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:26:00,159 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 12:26:00,168 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:26:00,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:26:00,169 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:26:00,169 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:26:00,169 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:26:00,169 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:26:00,170 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:26:00,170 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:26:00,170 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:26:00,170 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:26:00,170 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:26:00,170 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:26:00,170 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:26:00,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:26:00,171 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:26:00,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:26:00,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:26:00,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:26:00,171 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:26:00,171 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:26:00,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:26:00,172 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:26:00,172 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:26:00,172 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:26:00,172 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:26:00,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:26:00,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:26:00,173 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:26:00,173 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:26:00,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:26:00,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:26:00,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:26:00,173 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:26:00,173 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:26:00,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:26:00,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:26:00,174 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:26:00,174 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan 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 -> Taipan 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 -> b651d63eb42259dfd3a213a6671e4c58ee528ad0 [2018-11-23 12:26:00,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:26:00,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:26:00,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:26:00,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:26:00,212 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:26:00,212 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:26:00,245 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/data/fb3538295/fe5c04ec8a374b0a8012e8927827c14a/FLAG812a7bde1 [2018-11-23 12:26:00,686 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:26:00,686 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/sv-benchmarks/c/forester-heap/sll-circular_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:26:00,696 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/data/fb3538295/fe5c04ec8a374b0a8012e8927827c14a/FLAG812a7bde1 [2018-11-23 12:26:00,706 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/data/fb3538295/fe5c04ec8a374b0a8012e8927827c14a [2018-11-23 12:26:00,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:26:00,708 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:26:00,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:26:00,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:26:00,711 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:26:00,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:00" (1/1) ... [2018-11-23 12:26:00,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8583ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:00, skipping insertion in model container [2018-11-23 12:26:00,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:00" (1/1) ... [2018-11-23 12:26:00,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:26:00,749 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:26:00,931 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:26:00,939 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:26:01,008 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:26:01,035 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:26:01,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01 WrapperNode [2018-11-23 12:26:01,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:26:01,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:26:01,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:26:01,036 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:26:01,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (1/1) ... [2018-11-23 12:26:01,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (1/1) ... [2018-11-23 12:26:01,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:26:01,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:26:01,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:26:01,057 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:26:01,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (1/1) ... [2018-11-23 12:26:01,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (1/1) ... [2018-11-23 12:26:01,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (1/1) ... [2018-11-23 12:26:01,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (1/1) ... [2018-11-23 12:26:01,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (1/1) ... [2018-11-23 12:26:01,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (1/1) ... [2018-11-23 12:26:01,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (1/1) ... [2018-11-23 12:26:01,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:26:01,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:26:01,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:26:01,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:26:01,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:26:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:26:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:26:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:26:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:26:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:26:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:26:01,109 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:26:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:26:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:26:01,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:26:01,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:26:01,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:26:01,300 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:26:01,300 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 12:26:01,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:01 BoogieIcfgContainer [2018-11-23 12:26:01,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:26:01,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:26:01,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:26:01,303 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:26:01,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:26:00" (1/3) ... [2018-11-23 12:26:01,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149f533c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:26:01, skipping insertion in model container [2018-11-23 12:26:01,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:01" (2/3) ... [2018-11-23 12:26:01,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149f533c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:26:01, skipping insertion in model container [2018-11-23 12:26:01,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:01" (3/3) ... [2018-11-23 12:26:01,306 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:26:01,312 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:26:01,316 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 12:26:01,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 12:26:01,344 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:26:01,345 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:26:01,345 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:26:01,345 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:26:01,345 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:26:01,345 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:26:01,345 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:26:01,345 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:26:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 12:26:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:26:01,361 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:01,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:01,363 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:01,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:01,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1481134361, now seen corresponding path program 1 times [2018-11-23 12:26:01,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:26:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:01,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:26:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:26:01,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:26:01,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:26:01,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:26:01,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:26:01,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:26:01,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:26:01,475 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-23 12:26:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:01,489 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2018-11-23 12:26:01,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:26:01,490 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 12:26:01,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:01,496 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:26:01,496 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:26:01,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:26:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:26:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 12:26:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:26:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:26:01,521 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2018-11-23 12:26:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:01,522 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:26:01,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:26:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:26:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:26:01,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:01,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:01,522 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:01,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:01,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1288506705, now seen corresponding path program 1 times [2018-11-23 12:26:01,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:26:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:26:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:26:01,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:26:01,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:26:01,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:26:01,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:26:01,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:26:01,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:26:01,670 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2018-11-23 12:26:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:01,742 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 12:26:01,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:26:01,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 12:26:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:01,743 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:26:01,743 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:26:01,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:26:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:26:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-11-23 12:26:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:26:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 12:26:01,749 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2018-11-23 12:26:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:01,749 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 12:26:01,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:26:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:26:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:26:01,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:01,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:01,750 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:01,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1834766102, now seen corresponding path program 1 times [2018-11-23 12:26:01,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:26:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:26:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:26:01,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:26:01,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:26:01,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:26:01,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:26:01,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:26:01,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:26:01,788 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2018-11-23 12:26:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:01,805 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2018-11-23 12:26:01,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:26:01,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 12:26:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:01,807 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:26:01,808 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:26:01,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:26:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:26:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2018-11-23 12:26:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:26:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 12:26:01,813 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2018-11-23 12:26:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:01,813 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 12:26:01,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:26:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:26:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:26:01,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:01,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:01,814 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:01,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:01,814 INFO L82 PathProgramCache]: Analyzing trace with hash -959873059, now seen corresponding path program 1 times [2018-11-23 12:26:01,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:26:01,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:01,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:26:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:26:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:26:01,857 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=15, |#NULL.offset|=9, |old(#NULL.base)|=15, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=9] [?] RET #129#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~mem6|=1] [?] assume !!(0 != #t~mem6);havoc #t~mem6; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4);#t~short12 := 0 != #t~mem8; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~mem7.base|=12, |main_#t~mem7.offset|=0, |main_#t~mem8|=1, |main_#t~short12|=true] [?] assume #t~short12;call #t~mem10 := read~int(~x~0.base, 4 + ~x~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem11 := read~int(#t~mem9.base, 4 + #t~mem9.offset, 4);#t~short12 := #t~mem10 > #t~mem11; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~mem10|=1, |main_#t~mem11|=1, |main_#t~mem7.base|=12, |main_#t~mem7.offset|=0, |main_#t~mem8|=1, |main_#t~mem9.base|=12, |main_#t~mem9.offset|=0, |main_#t~short12|=false] [?] assume !#t~short12;havoc #t~mem10;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8;havoc #t~mem11;havoc #t~short12; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=9, old(#NULL.base)=15, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); [L987] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L989] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L990] ~state~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L993-L1013] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1014] call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); [L1016] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1016] ~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset; [L1016] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1017] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1019] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=1, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1019-L1023] assume !!(0 != #t~mem6); [L1019] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem7.base=12, #t~mem7.offset=0, #t~mem8=1, #t~short12=true, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assume #t~short12; [L1021] call #t~mem10 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1021] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] call #t~mem11 := read~int(#t~mem9.base, 4 + #t~mem9.offset, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem10=1, #t~mem11=1, #t~mem7.base=12, #t~mem7.offset=0, #t~mem8=1, #t~mem9.base=12, #t~mem9.offset=0, #t~short12=false, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assume !#t~short12; [L1021] havoc #t~mem10; [L1021] havoc #t~mem7.base, #t~mem7.offset; [L1021] havoc #t~mem9.base, #t~mem9.offset; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=9, old(#NULL.base)=15, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); [L987] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L989] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L990] ~state~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L993-L1013] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1014] call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); [L1016] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1016] ~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset; [L1016] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1017] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1019] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=1, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1019-L1023] assume !!(0 != #t~mem6); [L1019] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem7.base=12, #t~mem7.offset=0, #t~mem8=1, #t~short12=true, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assume #t~short12; [L1021] call #t~mem10 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1021] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] call #t~mem11 := read~int(#t~mem9.base, 4 + #t~mem9.offset, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem10=1, #t~mem11=1, #t~mem7.base=12, #t~mem7.offset=0, #t~mem8=1, #t~mem9.base=12, #t~mem9.offset=0, #t~short12=false, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assume !#t~short12; [L1021] havoc #t~mem10; [L1021] havoc #t~mem7.base, #t~mem7.offset; [L1021] havoc #t~mem9.base, #t~mem9.offset; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$(~head~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] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993-L1013] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1014] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1016] ~x~0 := #t~mem5; [L1016] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=1, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019-L1023] COND FALSE !(!(0 != #t~mem6)) [L1019] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~short12=true, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] FCALL call #t~mem10 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1021] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem11 := read~int({ base: #t~mem9!base, offset: 4 + #t~mem9!offset }, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem10=1, #t~mem11=1, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~mem9!base=12, #t~mem9!offset=0, #t~short12=false, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE !#t~short12 [L1021] havoc #t~mem10; [L1021] havoc #t~mem7; [L1021] havoc #t~mem9; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$(~head~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] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993-L1013] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1014] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1016] ~x~0 := #t~mem5; [L1016] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=1, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019-L1023] COND FALSE !(!(0 != #t~mem6)) [L1019] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~short12=true, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] FCALL call #t~mem10 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1021] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem11 := read~int({ base: #t~mem9!base, offset: 4 + #t~mem9!offset }, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem10=1, #t~mem11=1, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~mem9!base=12, #t~mem9!offset=0, #t~short12=false, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE !#t~short12 [L1021] havoc #t~mem10; [L1021] havoc #t~mem7; [L1021] havoc #t~mem9; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$(~head~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] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993-L1013] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1014] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1016] ~x~0 := #t~mem5; [L1016] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=1, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019-L1023] COND FALSE !(!(0 != #t~mem6)) [L1019] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~short12=true, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] FCALL call #t~mem10 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1021] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem11 := read~int({ base: #t~mem9!base, offset: 4 + #t~mem9!offset }, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem10=1, #t~mem11=1, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~mem9!base=12, #t~mem9!offset=0, #t~short12=false, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE !#t~short12 [L1021] havoc #t~mem10; [L1021] havoc #t~mem7; [L1021] havoc #t~mem9; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$(~head~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] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993-L1013] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1014] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1016] ~x~0 := #t~mem5; [L1016] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=1, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019-L1023] COND FALSE !(!(0 != #t~mem6)) [L1019] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~short12=true, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] FCALL call #t~mem10 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1021] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem11 := read~int({ base: #t~mem9!base, offset: 4 + #t~mem9!offset }, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem10=1, #t~mem11=1, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~mem9!base=12, #t~mem9!offset=0, #t~short12=false, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE !#t~short12 [L1021] havoc #t~mem10; [L1021] havoc #t~mem7; [L1021] havoc #t~mem9; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = head [L987] head->data = 0 [L989] SLL* x = head; [L990] int state = 1; VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x->data = state [L1016] EXPR head->next [L1016] x = head->next [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}] [L1019] EXPR x->data VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}, x->data=1] [L1019] COND TRUE x->data != 0 [L1021] EXPR x->next [L1021] EXPR x->next->data [L1021] EXPR x->next->data != 0 && x->data > x->next->data [L1021] EXPR x->data [L1021] EXPR x->next [L1021] EXPR x->next->data [L1021] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}, x->data=1, x->next={12:0}, x->next={12:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1021] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1021] __VERIFIER_error() VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}] ----- [2018-11-23 12:26:01,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:26:01 BoogieIcfgContainer [2018-11-23 12:26:01,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:26:01,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:26:01,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:26:01,897 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:26:01,897 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:01" (3/4) ... [2018-11-23 12:26:01,901 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=15, |#NULL.offset|=9, |old(#NULL.base)|=15, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=9] [?] RET #129#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~state~0 := 1; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] goto; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~mem6|=1] [?] assume !!(0 != #t~mem6);havoc #t~mem6; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4);#t~short12 := 0 != #t~mem8; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~mem7.base|=12, |main_#t~mem7.offset|=0, |main_#t~mem8|=1, |main_#t~short12|=true] [?] assume #t~short12;call #t~mem10 := read~int(~x~0.base, 4 + ~x~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem11 := read~int(#t~mem9.base, 4 + #t~mem9.offset, 4);#t~short12 := #t~mem10 > #t~mem11; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0, |main_#t~mem10|=1, |main_#t~mem11|=1, |main_#t~mem7.base|=12, |main_#t~mem7.offset|=0, |main_#t~mem8|=1, |main_#t~mem9.base|=12, |main_#t~mem9.offset|=0, |main_#t~short12|=false] [?] assume !#t~short12;havoc #t~mem10;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8;havoc #t~mem11;havoc #t~short12; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] assume !false; VAL [main_~head~0.base=12, main_~head~0.offset=0, main_~state~0=1, main_~x~0.base=12, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=12, |main_#t~malloc0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=9, old(#NULL.base)=15, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); [L987] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L989] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L990] ~state~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L993-L1013] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1014] call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); [L1016] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1016] ~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset; [L1016] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1017] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1019] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=1, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1019-L1023] assume !!(0 != #t~mem6); [L1019] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem7.base=12, #t~mem7.offset=0, #t~mem8=1, #t~short12=true, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assume #t~short12; [L1021] call #t~mem10 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1021] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] call #t~mem11 := read~int(#t~mem9.base, 4 + #t~mem9.offset, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem10=1, #t~mem11=1, #t~mem7.base=12, #t~mem7.offset=0, #t~mem8=1, #t~mem9.base=12, #t~mem9.offset=0, #t~short12=false, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assume !#t~short12; [L1021] havoc #t~mem10; [L1021] havoc #t~mem7.base, #t~mem7.offset; [L1021] havoc #t~mem9.base, #t~mem9.offset; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=9, old(#NULL.base)=15, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~head~0.offset, 4); [L987] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L989] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L990] ~state~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L993-L1013] assume !(0 != #t~nondet1); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1014] call write~int(~state~0, ~x~0.base, 4 + ~x~0.offset, 4); [L1016] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1016] ~x~0.base, ~x~0.offset := #t~mem5.base, #t~mem5.offset; [L1016] havoc #t~mem5.base, #t~mem5.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1017] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1019] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem6=1, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1019-L1023] assume !!(0 != #t~mem6); [L1019] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem7.base=12, #t~mem7.offset=0, #t~mem8=1, #t~short12=true, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assume #t~short12; [L1021] call #t~mem10 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1021] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] call #t~mem11 := read~int(#t~mem9.base, 4 + #t~mem9.offset, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, #t~mem10=1, #t~mem11=1, #t~mem7.base=12, #t~mem7.offset=0, #t~mem8=1, #t~mem9.base=12, #t~mem9.offset=0, #t~short12=false, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assume !#t~short12; [L1021] havoc #t~mem10; [L1021] havoc #t~mem7.base, #t~mem7.offset; [L1021] havoc #t~mem9.base, #t~mem9.offset; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [L1021] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=12, #t~malloc0.offset=0, ~head~0.base=12, ~head~0.offset=0, ~state~0=1, ~x~0.base=12, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$(~head~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] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993-L1013] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1014] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1016] ~x~0 := #t~mem5; [L1016] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=1, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019-L1023] COND FALSE !(!(0 != #t~mem6)) [L1019] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~short12=true, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] FCALL call #t~mem10 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1021] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem11 := read~int({ base: #t~mem9!base, offset: 4 + #t~mem9!offset }, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem10=1, #t~mem11=1, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~mem9!base=12, #t~mem9!offset=0, #t~short12=false, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE !#t~short12 [L1021] havoc #t~mem10; [L1021] havoc #t~mem7; [L1021] havoc #t~mem9; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$(~head~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] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993-L1013] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1014] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1016] ~x~0 := #t~mem5; [L1016] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=1, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019-L1023] COND FALSE !(!(0 != #t~mem6)) [L1019] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~short12=true, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] FCALL call #t~mem10 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1021] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem11 := read~int({ base: #t~mem9!base, offset: 4 + #t~mem9!offset }, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem10=1, #t~mem11=1, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~mem9!base=12, #t~mem9!offset=0, #t~short12=false, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE !#t~short12 [L1021] havoc #t~mem10; [L1021] havoc #t~mem7; [L1021] havoc #t~mem9; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$(~head~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] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993-L1013] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1014] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1016] ~x~0 := #t~mem5; [L1016] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=1, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019-L1023] COND FALSE !(!(0 != #t~mem6)) [L1019] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~short12=true, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] FCALL call #t~mem10 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1021] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem11 := read~int({ base: #t~mem9!base, offset: 4 + #t~mem9!offset }, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem10=1, #t~mem11=1, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~mem9!base=12, #t~mem9!offset=0, #t~short12=false, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE !#t~short12 [L1021] havoc #t~mem10; [L1021] havoc #t~mem7; [L1021] havoc #t~mem9; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret17 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$(~head~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] ~state~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L993-L1013] COND TRUE !(0 != #t~nondet1) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1014] FCALL call write~int(~state~0, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1016] ~x~0 := #t~mem5; [L1016] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem6=1, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1019-L1023] COND FALSE !(!(0 != #t~mem6)) [L1019] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); [L1021] #t~short12 := 0 != #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~short12=true, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] FCALL call #t~mem10 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1021] FCALL call #t~mem9 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] FCALL call #t~mem11 := read~int({ base: #t~mem9!base, offset: 4 + #t~mem9!offset }, 4); [L1021] #t~short12 := #t~mem10 > #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, #t~mem10=1, #t~mem11=1, #t~mem7!base=12, #t~mem7!offset=0, #t~mem8=1, #t~mem9!base=12, #t~mem9!offset=0, #t~short12=false, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] COND TRUE !#t~short12 [L1021] havoc #t~mem10; [L1021] havoc #t~mem7; [L1021] havoc #t~mem9; [L1021] havoc #t~mem8; [L1021] havoc #t~mem11; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L1021] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=12, #t~malloc0!offset=0, ~head~0!base=12, ~head~0!offset=0, ~state~0=1, ~x~0!base=12, ~x~0!offset=0] [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = head [L987] head->data = 0 [L989] SLL* x = head; [L990] int state = 1; VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x->data = state [L1016] EXPR head->next [L1016] x = head->next [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}] [L1019] EXPR x->data VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}, x->data=1] [L1019] COND TRUE x->data != 0 [L1021] EXPR x->next [L1021] EXPR x->next->data [L1021] EXPR x->next->data != 0 && x->data > x->next->data [L1021] EXPR x->data [L1021] EXPR x->next [L1021] EXPR x->next->data [L1021] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}, x->data=1, x->next={12:0}, x->next={12:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1021] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1021] __VERIFIER_error() VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}] ----- [2018-11-23 12:26:01,950 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_41a32208-5732-4c0c-acfe-7d7bd814c1d8/bin-2019/utaipan/witness.graphml [2018-11-23 12:26:01,950 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:26:01,951 INFO L168 Benchmark]: Toolchain (without parser) took 1243.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -78.2 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:01,952 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:26:01,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:01,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:01,954 INFO L168 Benchmark]: Boogie Preprocessor took 19.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:26:01,954 INFO L168 Benchmark]: RCFGBuilder took 223.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:01,954 INFO L168 Benchmark]: TraceAbstraction took 595.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:01,955 INFO L168 Benchmark]: Witness Printer took 53.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:01,957 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 223.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 595.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * Witness Printer took 53.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1021]: 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 = head [L987] head->data = 0 [L989] SLL* x = head; [L990] int state = 1; VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x->data = state [L1016] EXPR head->next [L1016] x = head->next [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}] [L1019] EXPR x->data VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}, x->data=1] [L1019] COND TRUE x->data != 0 [L1021] EXPR x->next [L1021] EXPR x->next->data [L1021] EXPR x->next->data != 0 && x->data > x->next->data [L1021] EXPR x->data [L1021] EXPR x->next [L1021] EXPR x->next->data [L1021] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}, x->data=1, x->next={12:0}, x->next={12:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1021] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1021] __VERIFIER_error() VAL [head={12:0}, malloc(sizeof(SLL))={12:0}, state=1, x={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 98 SDtfs, 44 SDslu, 61 SDs, 0 SdLazy, 35 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 1084 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...