./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-token_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_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/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 35a5ccff58935eefedf723cd2243fac7c8b8e61b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 05:47:18,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:47:18,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:47:18,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:47:18,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:47:18,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:47:18,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:47:18,153 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:47:18,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:47:18,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:47:18,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:47:18,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:47:18,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:47:18,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:47:18,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:47:18,158 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:47:18,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:47:18,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:47:18,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:47:18,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:47:18,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:47:18,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:47:18,165 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:47:18,165 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:47:18,165 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:47:18,166 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:47:18,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:47:18,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:47:18,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:47:18,168 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:47:18,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:47:18,169 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:47:18,169 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:47:18,169 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:47:18,170 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:47:18,171 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:47:18,171 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 05:47:18,179 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:47:18,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:47:18,180 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:47:18,180 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:47:18,180 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:47:18,180 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:47:18,180 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:47:18,181 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 05:47:18,181 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:47:18,181 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:47:18,181 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 05:47:18,181 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 05:47:18,181 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:47:18,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:47:18,182 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:47:18,182 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:47:18,182 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:47:18,182 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:47:18,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:47:18,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:47:18,183 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:47:18,183 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:47:18,183 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:47:18,183 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:47:18,183 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:47:18,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:47:18,184 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:47:18,184 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:47:18,184 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:47:18,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:47:18,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:47:18,186 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:47:18,187 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:47:18,187 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 05:47:18,187 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:47:18,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:47:18,187 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 05:47:18,187 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_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/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 -> 35a5ccff58935eefedf723cd2243fac7c8b8e61b [2018-11-23 05:47:18,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:47:18,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:47:18,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:47:18,226 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:47:18,226 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:47:18,227 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-23 05:47:18,270 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/data/c6bec098b/270d66251e764c4a94f765dee04bddda/FLAGceb723dd7 [2018-11-23 05:47:18,642 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:47:18,642 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/sv-benchmarks/c/forester-heap/dll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-23 05:47:18,650 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/data/c6bec098b/270d66251e764c4a94f765dee04bddda/FLAGceb723dd7 [2018-11-23 05:47:19,033 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/data/c6bec098b/270d66251e764c4a94f765dee04bddda [2018-11-23 05:47:19,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:47:19,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:47:19,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:47:19,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:47:19,040 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:47:19,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9d8bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19, skipping insertion in model container [2018-11-23 05:47:19,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:47:19,078 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:47:19,278 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:47:19,286 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:47:19,322 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:47:19,396 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:47:19,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19 WrapperNode [2018-11-23 05:47:19,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:47:19,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:47:19,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:47:19,397 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:47:19,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:47:19,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:47:19,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:47:19,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:47:19,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (1/1) ... [2018-11-23 05:47:19,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:47:19,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:47:19,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:47:19,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:47:19,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/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 05:47:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:47:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:47:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:47:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:47:19,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:47:19,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:47:19,478 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:47:19,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 05:47:19,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 05:47:19,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:47:19,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:47:19,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:47:19,730 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:47:19,730 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 05:47:19,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:47:19 BoogieIcfgContainer [2018-11-23 05:47:19,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:47:19,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:47:19,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:47:19,734 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:47:19,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:47:19" (1/3) ... [2018-11-23 05:47:19,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fff058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:47:19, skipping insertion in model container [2018-11-23 05:47:19,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:47:19" (2/3) ... [2018-11-23 05:47:19,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fff058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:47:19, skipping insertion in model container [2018-11-23 05:47:19,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:47:19" (3/3) ... [2018-11-23 05:47:19,737 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-23 05:47:19,746 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:47:19,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-23 05:47:19,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-23 05:47:19,792 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:47:19,792 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:47:19,792 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:47:19,792 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:47:19,792 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:47:19,793 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:47:19,793 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:47:19,793 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:47:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-23 05:47:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:47:19,813 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:47:19,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:47:19,815 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:47:19,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:47:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash 71293511, now seen corresponding path program 1 times [2018-11-23 05:47:19,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:47:19,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:19,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:47:19,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:19,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:47:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:47:19,919 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 05:47:19,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:47:19,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:47:19,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:47:19,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:47:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:47:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:47:19,934 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-23 05:47:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:47:19,950 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2018-11-23 05:47:19,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:47:19,951 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 05:47:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:47:19,957 INFO L225 Difference]: With dead ends: 92 [2018-11-23 05:47:19,958 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 05:47:19,960 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 05:47:19,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 05:47:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 05:47:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 05:47:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 05:47:19,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2018-11-23 05:47:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:47:19,988 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 05:47:19,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:47:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 05:47:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 05:47:19,988 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:47:19,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:47:19,989 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:47:19,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:47:19,989 INFO L82 PathProgramCache]: Analyzing trace with hash 70526890, now seen corresponding path program 1 times [2018-11-23 05:47:19,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:47:19,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:19,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:47:19,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:19,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:47:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:47:20,077 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 05:47:20,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:47:20,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:47:20,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:47:20,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:47:20,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:47:20,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:47:20,079 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 4 states. [2018-11-23 05:47:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:47:20,140 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 05:47:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:47:20,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-23 05:47:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:47:20,141 INFO L225 Difference]: With dead ends: 43 [2018-11-23 05:47:20,141 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 05:47:20,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:47:20,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 05:47:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 05:47:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 05:47:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-23 05:47:20,145 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2018-11-23 05:47:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:47:20,146 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-23 05:47:20,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:47:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 05:47:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 05:47:20,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:47:20,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:47:20,146 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:47:20,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:47:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2108677217, now seen corresponding path program 1 times [2018-11-23 05:47:20,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:47:20,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:20,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:47:20,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:20,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:47:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:47:20,198 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 05:47:20,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:47:20,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:47:20,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:47:20,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:47:20,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:47:20,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:47:20,200 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 4 states. [2018-11-23 05:47:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:47:20,273 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 05:47:20,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:47:20,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 05:47:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:47:20,274 INFO L225 Difference]: With dead ends: 67 [2018-11-23 05:47:20,275 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 05:47:20,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:47:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 05:47:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2018-11-23 05:47:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 05:47:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 05:47:20,279 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2018-11-23 05:47:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:47:20,280 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 05:47:20,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:47:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 05:47:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:47:20,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:47:20,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:47:20,281 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:47:20,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:47:20,281 INFO L82 PathProgramCache]: Analyzing trace with hash 461941694, now seen corresponding path program 1 times [2018-11-23 05:47:20,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:47:20,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:20,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:47:20,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:20,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:47:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:47:20,413 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 05:47:20,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:47:20,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:47:20,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:47:20,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:47:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:47:20,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:47:20,414 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 5 states. [2018-11-23 05:47:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:47:20,550 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-23 05:47:20,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:47:20,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 05:47:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:47:20,551 INFO L225 Difference]: With dead ends: 78 [2018-11-23 05:47:20,551 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 05:47:20,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:47:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 05:47:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-11-23 05:47:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 05:47:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-23 05:47:20,555 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 16 [2018-11-23 05:47:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:47:20,556 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-23 05:47:20,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:47:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 05:47:20,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 05:47:20,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:47:20,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:47:20,557 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:47:20,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:47:20,557 INFO L82 PathProgramCache]: Analyzing trace with hash 461903958, now seen corresponding path program 1 times [2018-11-23 05:47:20,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:47:20,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:20,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:47:20,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:20,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:47:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:47:20,590 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 05:47:20,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:47:20,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:47:20,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:47:20,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:47:20,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:47:20,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:47:20,591 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-11-23 05:47:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:47:20,642 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 05:47:20,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:47:20,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 05:47:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:47:20,643 INFO L225 Difference]: With dead ends: 46 [2018-11-23 05:47:20,643 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 05:47:20,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:47:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 05:47:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 05:47:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 05:47:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-23 05:47:20,651 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2018-11-23 05:47:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:47:20,652 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-23 05:47:20,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:47:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-23 05:47:20,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 05:47:20,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:47:20,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:47:20,652 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:47:20,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:47:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1977605822, now seen corresponding path program 1 times [2018-11-23 05:47:20,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:47:20,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:20,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:47:20,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:47:20,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:47:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:47:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:47:20,695 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|=13, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] RET #161#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret18 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0] [?] call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] goto; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0, |main_#t~mem8|=1] [?] assume !(1 != #t~mem8);havoc #t~mem8; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0, |main_#t~mem11|=1] [?] assume !!(1 == #t~mem11);havoc #t~mem11; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] goto; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] call #t~mem13 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0, |main_#t~mem13|=2] [?] assume !(2 != #t~mem13);havoc #t~mem13; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] assume !false; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=13, old(#NULL.base)=15, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L993] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L993] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L994] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L995] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L996] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L998] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1001-L1009] assume !(0 != #t~nondet1); [L1001] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1010] call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); [L1011] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12); [L1011] call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); [L1012] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1012] call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); [L1012] havoc #t~mem6.base, #t~mem6.offset; [L1013] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1013] call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); [L1013] havoc #t~mem7.base, #t~mem7.offset; [L1015] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1017] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1019] call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem8=1, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1019-L1023] assume !(1 != #t~mem8); [L1019] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1024] call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem11=1, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1024] assume !!(1 == #t~mem11); [L1024] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1025] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1025] ~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset; [L1025] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] call #t~mem13 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem13=2, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] assume !(2 != #t~mem13); [L1026] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=13, old(#NULL.base)=15, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L993] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L993] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L994] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L995] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L996] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L998] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1001-L1009] assume !(0 != #t~nondet1); [L1001] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1010] call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); [L1011] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12); [L1011] call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); [L1012] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1012] call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); [L1012] havoc #t~mem6.base, #t~mem6.offset; [L1013] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1013] call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); [L1013] havoc #t~mem7.base, #t~mem7.offset; [L1015] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1017] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1019] call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem8=1, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1019-L1023] assume !(1 != #t~mem8); [L1019] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1024] call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem11=1, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1024] assume !!(1 == #t~mem11); [L1024] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1025] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1025] ~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset; [L1025] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] call #t~mem13 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem13=2, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] assume !(2 != #t~mem13); [L1026] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L993] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L993] ~head~0 := #t~malloc0; [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L998] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001-L1009] COND TRUE !(0 != #t~nondet1) [L1001] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call #t~malloc5 := #Ultimate.alloc(12); [L1011] FCALL call write~$Pointer$(#t~malloc5, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$(~x~0, { base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1012] havoc #t~mem6; [L1013] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1013] FCALL call write~int(2, { base: #t~mem7!base, offset: 8 + #t~mem7!offset }, 4); [L1013] havoc #t~mem7; [L1015] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019] FCALL call #t~mem8 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem8=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019-L1023] COND TRUE !(1 != #t~mem8) [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem11=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] COND FALSE !(!(1 == #t~mem11)) [L1024] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1025] FCALL call #t~mem12 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1025] ~x~0 := #t~mem12; [L1025] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] FCALL call #t~mem13 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem13=2, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] COND TRUE !(2 != #t~mem13) [L1026] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L993] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L993] ~head~0 := #t~malloc0; [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L998] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001-L1009] COND TRUE !(0 != #t~nondet1) [L1001] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call #t~malloc5 := #Ultimate.alloc(12); [L1011] FCALL call write~$Pointer$(#t~malloc5, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$(~x~0, { base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1012] havoc #t~mem6; [L1013] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1013] FCALL call write~int(2, { base: #t~mem7!base, offset: 8 + #t~mem7!offset }, 4); [L1013] havoc #t~mem7; [L1015] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019] FCALL call #t~mem8 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem8=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019-L1023] COND TRUE !(1 != #t~mem8) [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem11=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] COND FALSE !(!(1 == #t~mem11)) [L1024] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1025] FCALL call #t~mem12 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1025] ~x~0 := #t~mem12; [L1025] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] FCALL call #t~mem13 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem13=2, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] COND TRUE !(2 != #t~mem13) [L1026] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L993] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L993] ~head~0 := #t~malloc0; [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L998] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001-L1009] COND TRUE !(0 != #t~nondet1) [L1001] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call #t~malloc5 := #Ultimate.alloc(12); [L1011] FCALL call write~$Pointer$(#t~malloc5, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$(~x~0, { base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1012] havoc #t~mem6; [L1013] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1013] FCALL call write~int(2, { base: #t~mem7!base, offset: 8 + #t~mem7!offset }, 4); [L1013] havoc #t~mem7; [L1015] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019] FCALL call #t~mem8 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem8=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019-L1023] COND TRUE !(1 != #t~mem8) [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem11=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] COND FALSE !(!(1 == #t~mem11)) [L1024] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1025] FCALL call #t~mem12 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1025] ~x~0 := #t~mem12; [L1025] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] FCALL call #t~mem13 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem13=2, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] COND TRUE !(2 != #t~mem13) [L1026] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L993] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L993] ~head~0 := #t~malloc0; [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L998] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001-L1009] COND TRUE !(0 != #t~nondet1) [L1001] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call #t~malloc5 := #Ultimate.alloc(12); [L1011] FCALL call write~$Pointer$(#t~malloc5, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$(~x~0, { base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1012] havoc #t~mem6; [L1013] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1013] FCALL call write~int(2, { base: #t~mem7!base, offset: 8 + #t~mem7!offset }, 4); [L1013] havoc #t~mem7; [L1015] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019] FCALL call #t~mem8 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem8=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019-L1023] COND TRUE !(1 != #t~mem8) [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem11=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] COND FALSE !(!(1 == #t~mem11)) [L1024] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1025] FCALL call #t~mem12 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1025] ~x~0 := #t~mem12; [L1025] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] FCALL call #t~mem13 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem13=2, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] COND TRUE !(2 != #t~mem13) [L1026] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L993] SLL* head = malloc(sizeof(SLL)); [L994] head->next = ((void*)0) [L995] head->prev = ((void*)0) [L996] head->data = 0 [L998] SLL* x = head; VAL [head={24:0}, malloc(sizeof(SLL))={24:0}, x={24:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] x->data = 1 [L1011] x->next = malloc(sizeof(SLL)) [L1012] EXPR x->next [L1012] x->next->prev = x [L1013] EXPR x->next [L1013] x->next->data = 2 [L1015] x = head VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}] [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}] [L1019] EXPR x->data VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}, x->data=1] [L1019] COND FALSE !(1 != x->data) [L1024] EXPR x->data VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}, x->data=1] [L1024] COND FALSE !(!(1 == x->data)) [L1025] EXPR x->next [L1025] x = x->next [L1026] EXPR x->data VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={21:0}, x->data=2] [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={21:0}] ----- [2018-11-23 05:47:20,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:47:20 BoogieIcfgContainer [2018-11-23 05:47:20,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:47:20,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:47:20,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:47:20,745 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:47:20,745 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:47:19" (3/4) ... [2018-11-23 05:47:20,747 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|=13, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=13] [?] RET #161#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret18 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0] [?] call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] goto; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0, |main_#t~mem8|=1] [?] assume !(1 != #t~mem8);havoc #t~mem8; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0, |main_#t~mem11|=1] [?] assume !!(1 == #t~mem11);havoc #t~mem11; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] goto; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=24, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] call #t~mem13 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0, |main_#t~mem13|=2] [?] assume !(2 != #t~mem13);havoc #t~mem13; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] assume !false; VAL [main_~head~0.base=24, main_~head~0.offset=0, main_~x~0.base=21, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=24, |main_#t~malloc0.offset|=0, |main_#t~malloc5.base|=21, |main_#t~malloc5.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=13, old(#NULL.base)=15, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L993] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L993] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L994] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L995] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L996] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L998] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1001-L1009] assume !(0 != #t~nondet1); [L1001] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1010] call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); [L1011] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12); [L1011] call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); [L1012] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1012] call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); [L1012] havoc #t~mem6.base, #t~mem6.offset; [L1013] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1013] call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); [L1013] havoc #t~mem7.base, #t~mem7.offset; [L1015] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1017] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1019] call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem8=1, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1019-L1023] assume !(1 != #t~mem8); [L1019] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1024] call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem11=1, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1024] assume !!(1 == #t~mem11); [L1024] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1025] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1025] ~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset; [L1025] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] call #t~mem13 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem13=2, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] assume !(2 != #t~mem13); [L1026] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=13, old(#NULL.base)=15, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L993] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L993] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L994] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L995] call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); [L996] call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); [L998] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1001-L1009] assume !(0 != #t~nondet1); [L1001] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1010] call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); [L1011] call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12); [L1011] call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); [L1012] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1012] call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); [L1012] havoc #t~mem6.base, #t~mem6.offset; [L1013] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1013] call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); [L1013] havoc #t~mem7.base, #t~mem7.offset; [L1015] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1017] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1019] call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem8=1, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1019-L1023] assume !(1 != #t~mem8); [L1019] havoc #t~mem8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1024] call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem11=1, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1024] assume !!(1 == #t~mem11); [L1024] havoc #t~mem11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=24, ~x~0.offset=0] [L1025] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1025] ~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset; [L1025] havoc #t~mem12.base, #t~mem12.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] call #t~mem13 := read~int(~x~0.base, 8 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, #t~mem13=2, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] assume !(2 != #t~mem13); [L1026] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [L1026] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=24, #t~malloc0.offset=0, #t~malloc5.base=21, #t~malloc5.offset=0, ~head~0.base=24, ~head~0.offset=0, ~x~0.base=21, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L993] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L993] ~head~0 := #t~malloc0; [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L998] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001-L1009] COND TRUE !(0 != #t~nondet1) [L1001] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call #t~malloc5 := #Ultimate.alloc(12); [L1011] FCALL call write~$Pointer$(#t~malloc5, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$(~x~0, { base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1012] havoc #t~mem6; [L1013] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1013] FCALL call write~int(2, { base: #t~mem7!base, offset: 8 + #t~mem7!offset }, 4); [L1013] havoc #t~mem7; [L1015] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019] FCALL call #t~mem8 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem8=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019-L1023] COND TRUE !(1 != #t~mem8) [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem11=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] COND FALSE !(!(1 == #t~mem11)) [L1024] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1025] FCALL call #t~mem12 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1025] ~x~0 := #t~mem12; [L1025] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] FCALL call #t~mem13 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem13=2, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] COND TRUE !(2 != #t~mem13) [L1026] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L993] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L993] ~head~0 := #t~malloc0; [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L998] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001-L1009] COND TRUE !(0 != #t~nondet1) [L1001] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call #t~malloc5 := #Ultimate.alloc(12); [L1011] FCALL call write~$Pointer$(#t~malloc5, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$(~x~0, { base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1012] havoc #t~mem6; [L1013] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1013] FCALL call write~int(2, { base: #t~mem7!base, offset: 8 + #t~mem7!offset }, 4); [L1013] havoc #t~mem7; [L1015] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019] FCALL call #t~mem8 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem8=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019-L1023] COND TRUE !(1 != #t~mem8) [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem11=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] COND FALSE !(!(1 == #t~mem11)) [L1024] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1025] FCALL call #t~mem12 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1025] ~x~0 := #t~mem12; [L1025] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] FCALL call #t~mem13 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem13=2, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] COND TRUE !(2 != #t~mem13) [L1026] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L993] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L993] ~head~0 := #t~malloc0; [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L998] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001-L1009] COND TRUE !(0 != #t~nondet1) [L1001] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call #t~malloc5 := #Ultimate.alloc(12); [L1011] FCALL call write~$Pointer$(#t~malloc5, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$(~x~0, { base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1012] havoc #t~mem6; [L1013] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1013] FCALL call write~int(2, { base: #t~mem7!base, offset: 8 + #t~mem7!offset }, 4); [L1013] havoc #t~mem7; [L1015] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019] FCALL call #t~mem8 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem8=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019-L1023] COND TRUE !(1 != #t~mem8) [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem11=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] COND FALSE !(!(1 == #t~mem11)) [L1024] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1025] FCALL call #t~mem12 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1025] ~x~0 := #t~mem12; [L1025] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] FCALL call #t~mem13 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem13=2, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] COND TRUE !(2 != #t~mem13) [L1026] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=13, old(#NULL!base)=15, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L993] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L993] ~head~0 := #t~malloc0; [L994] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] FCALL call write~int(0, { base: ~head~0!base, offset: 8 + ~head~0!offset }, 4); [L998] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1001-L1009] COND TRUE !(0 != #t~nondet1) [L1001] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1010] FCALL call write~int(1, { base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); [L1011] FCALL call #t~malloc5 := #Ultimate.alloc(12); [L1011] FCALL call write~$Pointer$(#t~malloc5, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1012] FCALL call write~$Pointer$(~x~0, { base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1012] havoc #t~mem6; [L1013] FCALL call #t~mem7 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1013] FCALL call write~int(2, { base: #t~mem7!base, offset: 8 + #t~mem7!offset }, 4); [L1013] havoc #t~mem7; [L1015] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1017] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019] FCALL call #t~mem8 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem8=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1019-L1023] COND TRUE !(1 != #t~mem8) [L1019] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] FCALL call #t~mem11 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem11=1, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1024] COND FALSE !(!(1 == #t~mem11)) [L1024] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=24, ~x~0!offset=0] [L1025] FCALL call #t~mem12 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1025] ~x~0 := #t~mem12; [L1025] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] FCALL call #t~mem13 := read~int({ base: ~x~0!base, offset: 8 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, #t~mem13=2, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] COND TRUE !(2 != #t~mem13) [L1026] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L1026] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=24, #t~malloc0!offset=0, #t~malloc5!base=21, #t~malloc5!offset=0, ~head~0!base=24, ~head~0!offset=0, ~x~0!base=21, ~x~0!offset=0] [L993] SLL* head = malloc(sizeof(SLL)); [L994] head->next = ((void*)0) [L995] head->prev = ((void*)0) [L996] head->data = 0 [L998] SLL* x = head; VAL [head={24:0}, malloc(sizeof(SLL))={24:0}, x={24:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] x->data = 1 [L1011] x->next = malloc(sizeof(SLL)) [L1012] EXPR x->next [L1012] x->next->prev = x [L1013] EXPR x->next [L1013] x->next->data = 2 [L1015] x = head VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}] [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}] [L1019] EXPR x->data VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}, x->data=1] [L1019] COND FALSE !(1 != x->data) [L1024] EXPR x->data VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}, x->data=1] [L1024] COND FALSE !(!(1 == x->data)) [L1025] EXPR x->next [L1025] x = x->next [L1026] EXPR x->data VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={21:0}, x->data=2] [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={21:0}] ----- [2018-11-23 05:47:20,815 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8e3a78d8-a67a-4ccb-b1a4-51fcb38c50b9/bin-2019/utaipan/witness.graphml [2018-11-23 05:47:20,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:47:20,820 INFO L168 Benchmark]: Toolchain (without parser) took 1784.14 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.6 MB in the beginning and 994.6 MB in the end (delta: -38.0 MB). Peak memory consumption was 100.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:47:20,822 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:47:20,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.47 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.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:47:20,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.06 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:47:20,823 INFO L168 Benchmark]: Boogie Preprocessor took 22.86 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:47:20,824 INFO L168 Benchmark]: RCFGBuilder took 289.54 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.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:47:20,826 INFO L168 Benchmark]: TraceAbstraction took 1012.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.9 MB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:47:20,826 INFO L168 Benchmark]: Witness Printer took 70.93 ms. Allocated memory is still 1.2 GB. Free memory was 999.9 MB in the beginning and 994.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:47:20,829 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.47 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.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.06 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.86 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 289.54 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.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1012.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.9 MB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. * Witness Printer took 70.93 ms. Allocated memory is still 1.2 GB. Free memory was 999.9 MB in the beginning and 994.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L993] SLL* head = malloc(sizeof(SLL)); [L994] head->next = ((void*)0) [L995] head->prev = ((void*)0) [L996] head->data = 0 [L998] SLL* x = head; VAL [head={24:0}, malloc(sizeof(SLL))={24:0}, x={24:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] x->data = 1 [L1011] x->next = malloc(sizeof(SLL)) [L1012] EXPR x->next [L1012] x->next->prev = x [L1013] EXPR x->next [L1013] x->next->data = 2 [L1015] x = head VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}] [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}] [L1019] EXPR x->data VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}, x->data=1] [L1019] COND FALSE !(1 != x->data) [L1024] EXPR x->data VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={24:0}, x->data=1] [L1024] COND FALSE !(!(1 == x->data)) [L1025] EXPR x->next [L1025] x = x->next [L1026] EXPR x->data VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={21:0}, x->data=2] [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() VAL [head={24:0}, malloc(sizeof(SLL))={21:0}, malloc(sizeof(SLL))={24:0}, x={21:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 6 error locations. UNSAFE Result, 0.9s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 187 SDtfs, 95 SDslu, 238 SDs, 0 SdLazy, 139 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 32 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 2221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...