./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-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_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-token_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60dcf5da7f0124de96473d8010137f60c5cb2803 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:19:04,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:19:04,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:19:04,719 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:19:04,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:19:04,720 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:19:04,721 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:19:04,722 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:19:04,723 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:19:04,724 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:19:04,725 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:19:04,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:19:04,725 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:19:04,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:19:04,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:19:04,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:19:04,728 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:19:04,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:19:04,731 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:19:04,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:19:04,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:19:04,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:19:04,735 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:19:04,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:19:04,736 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:19:04,736 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:19:04,737 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:19:04,738 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:19:04,738 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:19:04,739 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:19:04,739 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:19:04,740 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:19:04,740 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:19:04,740 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:19:04,741 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:19:04,741 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:19:04,741 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 07:19:04,751 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:19:04,751 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:19:04,752 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:19:04,752 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:19:04,753 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:19:04,753 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:19:04,753 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:19:04,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:19:04,753 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:19:04,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:19:04,754 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:19:04,754 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:19:04,754 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:19:04,754 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:19:04,754 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:19:04,754 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:19:04,754 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:19:04,754 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:19:04,755 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:19:04,755 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:19:04,755 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:19:04,755 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:19:04,755 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:19:04,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:19:04,756 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:19:04,756 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:19:04,756 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:19:04,756 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:19:04,756 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:19:04,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:19:04,756 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer 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 -> Automizer 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 -> 60dcf5da7f0124de96473d8010137f60c5cb2803 [2018-11-23 07:19:04,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:19:04,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:19:04,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:19:04,788 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:19:04,788 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:19:04,789 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-23 07:19:04,825 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/data/3b737f7e8/3101325b159b433983d4aff5b8510a82/FLAG21c703ac9 [2018-11-23 07:19:05,202 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:19:05,202 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/sv-benchmarks/c/forester-heap/sll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-23 07:19:05,212 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/data/3b737f7e8/3101325b159b433983d4aff5b8510a82/FLAG21c703ac9 [2018-11-23 07:19:05,586 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/data/3b737f7e8/3101325b159b433983d4aff5b8510a82 [2018-11-23 07:19:05,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:19:05,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:19:05,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:19:05,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:19:05,592 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:19:05,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a6dbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05, skipping insertion in model container [2018-11-23 07:19:05,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:19:05,632 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:19:05,820 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:19:05,827 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:19:05,854 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:19:05,923 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:19:05,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05 WrapperNode [2018-11-23 07:19:05,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:19:05,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:19:05,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:19:05,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:19:05,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:19:05,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:19:05,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:19:05,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:19:05,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (1/1) ... [2018-11-23 07:19:05,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:19:05,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:19:05,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:19:05,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:19:05,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/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 07:19:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:19:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:19:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:19:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:19:06,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:19:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:19:06,003 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:19:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 07:19:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 07:19:06,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:19:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:19:06,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:19:06,215 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:19:06,215 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 07:19:06,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:19:06 BoogieIcfgContainer [2018-11-23 07:19:06,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:19:06,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:19:06,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:19:06,219 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:19:06,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:19:05" (1/3) ... [2018-11-23 07:19:06,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef67c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:19:06, skipping insertion in model container [2018-11-23 07:19:06,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:19:05" (2/3) ... [2018-11-23 07:19:06,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef67c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:19:06, skipping insertion in model container [2018-11-23 07:19:06,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:19:06" (3/3) ... [2018-11-23 07:19:06,222 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-token_false-unreach-call_false-valid-memcleanup.i [2018-11-23 07:19:06,227 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:19:06,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-23 07:19:06,241 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-23 07:19:06,258 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:19:06,258 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:19:06,259 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:19:06,259 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:19:06,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:19:06,259 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:19:06,259 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:19:06,259 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:19:06,259 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:19:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-23 07:19:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 07:19:06,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:19:06,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:19:06,275 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:19:06,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:19:06,279 INFO L82 PathProgramCache]: Analyzing trace with hash 71293511, now seen corresponding path program 1 times [2018-11-23 07:19:06,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:19:06,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:19:06,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:19:06,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:19:06,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:19:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:19:06,378 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 07:19:06,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:19:06,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:19:06,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 07:19:06,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 07:19:06,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:19:06,394 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-23 07:19:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:19:06,407 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2018-11-23 07:19:06,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 07:19:06,408 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 07:19:06,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:19:06,413 INFO L225 Difference]: With dead ends: 92 [2018-11-23 07:19:06,413 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 07:19:06,416 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 07:19:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 07:19:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 07:19:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 07:19:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 07:19:06,443 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2018-11-23 07:19:06,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:19:06,443 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 07:19:06,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 07:19:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 07:19:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 07:19:06,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:19:06,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:19:06,445 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:19:06,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:19:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash 70526890, now seen corresponding path program 1 times [2018-11-23 07:19:06,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:19:06,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:19:06,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:19:06,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:19:06,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:19:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:19:06,494 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 07:19:06,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:19:06,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:19:06,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:19:06,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:19:06,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:19:06,496 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 3 states. [2018-11-23 07:19:06,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:19:06,544 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 07:19:06,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:19:06,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 07:19:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:19:06,545 INFO L225 Difference]: With dead ends: 43 [2018-11-23 07:19:06,545 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 07:19:06,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:19:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 07:19:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 07:19:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 07:19:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-23 07:19:06,550 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2018-11-23 07:19:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:19:06,551 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-23 07:19:06,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:19:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 07:19:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 07:19:06,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:19:06,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:19:06,551 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:19:06,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:19:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2108677217, now seen corresponding path program 1 times [2018-11-23 07:19:06,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:19:06,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:19:06,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:19:06,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:19:06,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:19:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:19:06,596 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 07:19:06,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:19:06,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 07:19:06,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 07:19:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 07:19:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 07:19:06,597 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 4 states. [2018-11-23 07:19:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:19:06,656 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-23 07:19:06,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 07:19:06,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 07:19:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:19:06,657 INFO L225 Difference]: With dead ends: 67 [2018-11-23 07:19:06,658 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 07:19:06,658 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 07:19:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 07:19:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2018-11-23 07:19:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 07:19:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 07:19:06,661 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2018-11-23 07:19:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:19:06,662 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 07:19:06,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 07:19:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 07:19:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 07:19:06,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:19:06,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:19:06,663 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:19:06,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:19:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash 461941694, now seen corresponding path program 1 times [2018-11-23 07:19:06,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:19:06,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:19:06,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:19:06,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:19:06,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:19:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:19:06,765 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 07:19:06,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:19:06,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:19:06,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:19:06,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:19:06,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:19:06,766 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 5 states. [2018-11-23 07:19:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:19:06,882 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-23 07:19:06,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:19:06,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 07:19:06,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:19:06,883 INFO L225 Difference]: With dead ends: 78 [2018-11-23 07:19:06,883 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 07:19:06,884 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 07:19:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 07:19:06,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-11-23 07:19:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 07:19:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-23 07:19:06,889 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 16 [2018-11-23 07:19:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:19:06,889 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-23 07:19:06,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:19:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 07:19:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 07:19:06,890 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:19:06,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:19:06,891 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:19:06,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:19:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash 461903958, now seen corresponding path program 1 times [2018-11-23 07:19:06,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:19:06,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:19:06,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:19:06,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:19:06,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:19:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:19:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:19:06,931 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=17, |#NULL.offset|=9, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] RET #161#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret16 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem5.base, 4 + #t~mem5.offset, 4);havoc #t~mem5.base, #t~mem5.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] goto; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0, |main_#t~mem6|=1] [?] assume !(1 != #t~mem6);havoc #t~mem6; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] call #t~mem9 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0, |main_#t~mem9|=1] [?] assume !(2 == #t~mem9);havoc #t~mem9; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] assume !false; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L992] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L992] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L993] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L994] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L996] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L999-L1006] assume !(0 != #t~nondet1); [L999] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1007] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); [L1008] call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8); [L1008] call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset, 4); [L1009] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1009] call write~int(2, #t~mem5.base, 4 + #t~mem5.offset, 4); [L1009] havoc #t~mem5.base, #t~mem5.offset; [L1011] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1013] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, #t~mem6=1, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015-L1019] assume !(1 != #t~mem6); [L1015] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] call #t~mem9 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, #t~mem9=1, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] assume !(2 == #t~mem9); [L1020] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L992] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L992] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L993] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L994] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L996] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L999-L1006] assume !(0 != #t~nondet1); [L999] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1007] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); [L1008] call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8); [L1008] call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset, 4); [L1009] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1009] call write~int(2, #t~mem5.base, 4 + #t~mem5.offset, 4); [L1009] havoc #t~mem5.base, #t~mem5.offset; [L1011] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1013] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, #t~mem6=1, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015-L1019] assume !(1 != #t~mem6); [L1015] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] call #t~mem9 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, #t~mem9=1, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] assume !(2 == #t~mem9); [L1020] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L992] ~head~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L994] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999-L1006] COND TRUE !(0 != #t~nondet1) [L999] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1007] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1008] FCALL call #t~malloc4 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc4, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call write~int(2, { base: #t~mem5!base, offset: 4 + #t~mem5!offset }, 4); [L1009] havoc #t~mem5; [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem6=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015-L1019] COND TRUE !(1 != #t~mem6) [L1015] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] FCALL call #t~mem9 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem9=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] COND TRUE !(2 == #t~mem9) [L1020] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L992] ~head~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L994] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999-L1006] COND TRUE !(0 != #t~nondet1) [L999] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1007] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1008] FCALL call #t~malloc4 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc4, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call write~int(2, { base: #t~mem5!base, offset: 4 + #t~mem5!offset }, 4); [L1009] havoc #t~mem5; [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem6=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015-L1019] COND TRUE !(1 != #t~mem6) [L1015] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] FCALL call #t~mem9 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem9=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] COND TRUE !(2 == #t~mem9) [L1020] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L992] ~head~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L994] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999-L1006] COND TRUE !(0 != #t~nondet1) [L999] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1007] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1008] FCALL call #t~malloc4 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc4, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call write~int(2, { base: #t~mem5!base, offset: 4 + #t~mem5!offset }, 4); [L1009] havoc #t~mem5; [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem6=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015-L1019] COND TRUE !(1 != #t~mem6) [L1015] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] FCALL call #t~mem9 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem9=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] COND TRUE !(2 == #t~mem9) [L1020] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L992] ~head~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L994] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999-L1006] COND TRUE !(0 != #t~nondet1) [L999] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1007] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1008] FCALL call #t~malloc4 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc4, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call write~int(2, { base: #t~mem5!base, offset: 4 + #t~mem5!offset }, 4); [L1009] havoc #t~mem5; [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem6=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015-L1019] COND TRUE !(1 != #t~mem6) [L1015] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] FCALL call #t~mem9 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem9=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] COND TRUE !(2 == #t~mem9) [L1020] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L992] SLL* head = malloc(sizeof(SLL)); [L993] head->next = ((void*)0) [L994] head->data = 0 [L996] SLL* x = head; VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] x->data = 1 [L1008] x->next = malloc(sizeof(SLL)) [L1009] EXPR x->next [L1009] x->next->data = 2 [L1011] x = head VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L1013] COND FALSE !(!(((void*)0) != x)) VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L1015] EXPR x->data VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->data=1] [L1015] COND FALSE !(1 != x->data) [L1020] EXPR x->data VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->data=1] [L1020] COND TRUE !(2 == x->data) [L1020] __VERIFIER_error() VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] ----- [2018-11-23 07:19:06,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:19:06 BoogieIcfgContainer [2018-11-23 07:19:06,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:19:06,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:19:06,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:19:06,969 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:19:06,969 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:19:06" (3/4) ... [2018-11-23 07:19:06,971 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|=17, |#NULL.offset|=9, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] RET #161#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret16 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0] [?] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem5.base, 4 + #t~mem5.offset, 4);havoc #t~mem5.base, #t~mem5.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] goto; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0, |main_#t~mem6|=1] [?] assume !(1 != #t~mem6);havoc #t~mem6; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] call #t~mem9 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0, |main_#t~mem9|=1] [?] assume !(2 == #t~mem9);havoc #t~mem9; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] assume !false; VAL [main_~head~0.base=15, main_~head~0.offset=0, main_~x~0.base=15, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=15, |main_#t~malloc0.offset|=0, |main_#t~malloc4.base|=13, |main_#t~malloc4.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L992] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L992] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L993] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L994] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L996] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L999-L1006] assume !(0 != #t~nondet1); [L999] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1007] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); [L1008] call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8); [L1008] call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset, 4); [L1009] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1009] call write~int(2, #t~mem5.base, 4 + #t~mem5.offset, 4); [L1009] havoc #t~mem5.base, #t~mem5.offset; [L1011] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1013] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, #t~mem6=1, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015-L1019] assume !(1 != #t~mem6); [L1015] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] call #t~mem9 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, #t~mem9=1, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] assume !(2 == #t~mem9); [L1020] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L992] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L992] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L993] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L994] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L996] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~nondet1=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L999-L1006] assume !(0 != #t~nondet1); [L999] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1007] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); [L1008] call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8); [L1008] call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset, 4); [L1009] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1009] call write~int(2, #t~mem5.base, 4 + #t~mem5.offset, 4); [L1009] havoc #t~mem5.base, #t~mem5.offset; [L1011] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1013] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015] call #t~mem6 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, #t~mem6=1, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1015-L1019] assume !(1 != #t~mem6); [L1015] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] call #t~mem9 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, #t~mem9=1, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] assume !(2 == #t~mem9); [L1020] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [L1020] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=15, #t~malloc0.offset=0, #t~malloc4.base=13, #t~malloc4.offset=0, ~head~0.base=15, ~head~0.offset=0, ~x~0.base=15, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L992] ~head~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L994] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999-L1006] COND TRUE !(0 != #t~nondet1) [L999] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1007] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1008] FCALL call #t~malloc4 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc4, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call write~int(2, { base: #t~mem5!base, offset: 4 + #t~mem5!offset }, 4); [L1009] havoc #t~mem5; [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem6=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015-L1019] COND TRUE !(1 != #t~mem6) [L1015] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] FCALL call #t~mem9 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem9=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] COND TRUE !(2 == #t~mem9) [L1020] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L992] ~head~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L994] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999-L1006] COND TRUE !(0 != #t~nondet1) [L999] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1007] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1008] FCALL call #t~malloc4 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc4, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call write~int(2, { base: #t~mem5!base, offset: 4 + #t~mem5!offset }, 4); [L1009] havoc #t~mem5; [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem6=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015-L1019] COND TRUE !(1 != #t~mem6) [L1015] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] FCALL call #t~mem9 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem9=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] COND TRUE !(2 == #t~mem9) [L1020] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L992] ~head~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L994] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999-L1006] COND TRUE !(0 != #t~nondet1) [L999] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1007] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1008] FCALL call #t~malloc4 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc4, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call write~int(2, { base: #t~mem5!base, offset: 4 + #t~mem5!offset }, 4); [L1009] havoc #t~mem5; [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem6=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015-L1019] COND TRUE !(1 != #t~mem6) [L1015] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] FCALL call #t~mem9 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem9=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] COND TRUE !(2 == #t~mem9) [L1020] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret16 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L992] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L992] ~head~0 := #t~malloc0; [L993] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L994] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L996] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~nondet1=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L999-L1006] COND TRUE !(0 != #t~nondet1) [L999] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1007] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1008] FCALL call #t~malloc4 := #Ultimate.alloc(8); [L1008] FCALL call write~$Pointer$(#t~malloc4, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1009] FCALL call write~int(2, { base: #t~mem5!base, offset: 4 + #t~mem5!offset }, 4); [L1009] havoc #t~mem5; [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015] FCALL call #t~mem6 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem6=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1015-L1019] COND TRUE !(1 != #t~mem6) [L1015] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] FCALL call #t~mem9 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, #t~mem9=1, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] COND TRUE !(2 == #t~mem9) [L1020] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L1020] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=15, #t~malloc0!offset=0, #t~malloc4!base=13, #t~malloc4!offset=0, ~head~0!base=15, ~head~0!offset=0, ~x~0!base=15, ~x~0!offset=0] [L992] SLL* head = malloc(sizeof(SLL)); [L993] head->next = ((void*)0) [L994] head->data = 0 [L996] SLL* x = head; VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] x->data = 1 [L1008] x->next = malloc(sizeof(SLL)) [L1009] EXPR x->next [L1009] x->next->data = 2 [L1011] x = head VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L1013] COND FALSE !(!(((void*)0) != x)) VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L1015] EXPR x->data VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->data=1] [L1015] COND FALSE !(1 != x->data) [L1020] EXPR x->data VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->data=1] [L1020] COND TRUE !(2 == x->data) [L1020] __VERIFIER_error() VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] ----- [2018-11-23 07:19:07,015 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_754028f1-dd66-40ac-a6db-71595789a5de/bin-2019/uautomizer/witness.graphml [2018-11-23 07:19:07,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:19:07,016 INFO L168 Benchmark]: Toolchain (without parser) took 1426.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -49.5 MB). Peak memory consumption was 78.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:19:07,017 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:19:07,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:19:07,017 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:19:07,018 INFO L168 Benchmark]: Boogie Preprocessor took 24.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:19:07,018 INFO L168 Benchmark]: RCFGBuilder took 246.39 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:19:07,019 INFO L168 Benchmark]: TraceAbstraction took 751.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.4 MB). Peak memory consumption was 77.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:19:07,019 INFO L168 Benchmark]: Witness Printer took 46.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:19:07,022 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 246.39 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: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 751.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.4 MB). Peak memory consumption was 77.4 MB. Max. memory is 11.5 GB. * Witness Printer took 46.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1020]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L992] SLL* head = malloc(sizeof(SLL)); [L993] head->next = ((void*)0) [L994] head->data = 0 [L996] SLL* x = head; VAL [head={15:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L999] COND FALSE !(__VERIFIER_nondet_int()) [L1007] x->data = 1 [L1008] x->next = malloc(sizeof(SLL)) [L1009] EXPR x->next [L1009] x->next->data = 2 [L1011] x = head VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L1013] COND FALSE !(!(((void*)0) != x)) VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] [L1015] EXPR x->data VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->data=1] [L1015] COND FALSE !(1 != x->data) [L1020] EXPR x->data VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}, x->data=1] [L1020] COND TRUE !(2 == x->data) [L1020] __VERIFIER_error() VAL [head={15:0}, malloc(sizeof(SLL))={13:0}, malloc(sizeof(SLL))={15:0}, x={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 6 error locations. UNSAFE Result, 0.7s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 90 SDslu, 140 SDs, 0 SdLazy, 84 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 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, 4 MinimizatonAttempts, 32 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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...