./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.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_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:20:00,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:20:00,070 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:20:00,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:20:00,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:20:00,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:20:00,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:20:00,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:20:00,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:20:00,085 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:20:00,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:20:00,087 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:20:00,087 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:20:00,088 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:20:00,089 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:20:00,090 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:20:00,091 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:20:00,093 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:20:00,095 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:20:00,097 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:20:00,098 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:20:00,099 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:20:00,101 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:20:00,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:20:00,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:20:00,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:20:00,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:20:00,105 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:20:00,106 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:20:00,107 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:20:00,107 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:20:00,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:20:00,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:20:00,109 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:20:00,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:20:00,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:20:00,111 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 09:20:00,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:20:00,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:20:00,125 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:20:00,126 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:20:00,126 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:20:00,126 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:20:00,126 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:20:00,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:20:00,127 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:20:00,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:20:00,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:20:00,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:20:00,128 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:20:00,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:20:00,128 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:20:00,128 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:20:00,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:20:00,128 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:20:00,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:20:00,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:20:00,129 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:20:00,129 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:20:00,129 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:20:00,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:20:00,130 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:20:00,130 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:20:00,130 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:20:00,130 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:20:00,130 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:20:00,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:20:00,131 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_48d6f129-4202-46ff-861e-ea38d2cf287d/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-11-23 09:20:00,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:20:00,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:20:00,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:20:00,180 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:20:00,180 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:20:00,181 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 09:20:00,240 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/data/2765b2eb3/c1925096a4914d88956e060ce9363ad0/FLAG5b193e4bf [2018-11-23 09:20:00,676 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:20:00,677 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 09:20:00,687 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/data/2765b2eb3/c1925096a4914d88956e060ce9363ad0/FLAG5b193e4bf [2018-11-23 09:20:00,699 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/data/2765b2eb3/c1925096a4914d88956e060ce9363ad0 [2018-11-23 09:20:00,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:20:00,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:20:00,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:20:00,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:20:00,710 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:20:00,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:20:00" (1/1) ... [2018-11-23 09:20:00,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e1a27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:00, skipping insertion in model container [2018-11-23 09:20:00,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:20:00" (1/1) ... [2018-11-23 09:20:00,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:20:00,766 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:20:01,045 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:20:01,055 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:20:01,144 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:20:01,172 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:20:01,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01 WrapperNode [2018-11-23 09:20:01,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:20:01,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:20:01,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:20:01,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:20:01,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (1/1) ... [2018-11-23 09:20:01,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (1/1) ... [2018-11-23 09:20:01,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:20:01,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:20:01,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:20:01,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:20:01,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (1/1) ... [2018-11-23 09:20:01,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (1/1) ... [2018-11-23 09:20:01,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (1/1) ... [2018-11-23 09:20:01,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (1/1) ... [2018-11-23 09:20:01,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (1/1) ... [2018-11-23 09:20:01,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (1/1) ... [2018-11-23 09:20:01,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (1/1) ... [2018-11-23 09:20:01,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:20:01,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:20:01,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:20:01,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:20:01,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/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 09:20:01,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:20:01,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:20:01,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 09:20:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:20:01,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:20:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:20:01,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:20:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 09:20:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 09:20:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:20:01,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:20:01,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:20:01,634 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:20:01,634 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-23 09:20:01,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:01 BoogieIcfgContainer [2018-11-23 09:20:01,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:20:01,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:20:01,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:20:01,639 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:20:01,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:20:00" (1/3) ... [2018-11-23 09:20:01,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f626c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:20:01, skipping insertion in model container [2018-11-23 09:20:01,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:20:01" (2/3) ... [2018-11-23 09:20:01,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f626c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:20:01, skipping insertion in model container [2018-11-23 09:20:01,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:01" (3/3) ... [2018-11-23 09:20:01,644 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-23 09:20:01,655 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:20:01,663 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-23 09:20:01,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-23 09:20:01,698 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:20:01,699 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:20:01,699 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:20:01,699 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:20:01,699 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:20:01,699 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:20:01,699 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:20:01,699 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:20:01,700 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:20:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-11-23 09:20:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 09:20:01,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:01,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:01,724 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:01,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1252939669, now seen corresponding path program 1 times [2018-11-23 09:20:01,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:01,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:01,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:01,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:01,864 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 09:20:01,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:20:01,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:20:01,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:20:01,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:20:01,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:20:01,883 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2018-11-23 09:20:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:01,903 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-11-23 09:20:01,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:20:01,904 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 09:20:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:01,912 INFO L225 Difference]: With dead ends: 98 [2018-11-23 09:20:01,912 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 09:20:01,915 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 09:20:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 09:20:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 09:20:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 09:20:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-23 09:20:01,949 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2018-11-23 09:20:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:01,950 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-23 09:20:01,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:20:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-23 09:20:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 09:20:01,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:01,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:01,951 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:01,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:01,952 INFO L82 PathProgramCache]: Analyzing trace with hash -249318588, now seen corresponding path program 1 times [2018-11-23 09:20:01,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:01,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:01,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:01,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:01,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:02,041 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 09:20:02,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:20:02,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:20:02,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:20:02,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:20:02,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:20:02,043 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2018-11-23 09:20:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:02,134 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-23 09:20:02,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:20:02,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 09:20:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:02,136 INFO L225 Difference]: With dead ends: 51 [2018-11-23 09:20:02,136 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 09:20:02,137 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 09:20:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 09:20:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-23 09:20:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 09:20:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-23 09:20:02,143 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 11 [2018-11-23 09:20:02,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:02,144 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-23 09:20:02,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:20:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 09:20:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 09:20:02,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:02,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:02,145 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:02,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash 861058516, now seen corresponding path program 1 times [2018-11-23 09:20:02,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:02,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:02,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:02,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:02,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:02,227 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 09:20:02,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:20:02,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:20:02,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:20:02,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:20:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:20:02,229 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-11-23 09:20:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:02,298 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-23 09:20:02,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:20:02,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 09:20:02,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:02,299 INFO L225 Difference]: With dead ends: 43 [2018-11-23 09:20:02,300 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 09:20:02,300 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 09:20:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 09:20:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 09:20:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 09:20:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-23 09:20:02,305 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 12 [2018-11-23 09:20:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:02,305 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-23 09:20:02,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:20:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-23 09:20:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 09:20:02,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:02,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:02,306 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:02,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1447599299, now seen corresponding path program 1 times [2018-11-23 09:20:02,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:02,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:02,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:02,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:02,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:02,405 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 09:20:02,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:20:02,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 09:20:02,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 09:20:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 09:20:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:20:02,407 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2018-11-23 09:20:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:02,530 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-11-23 09:20:02,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:20:02,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 09:20:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:02,532 INFO L225 Difference]: With dead ends: 66 [2018-11-23 09:20:02,532 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 09:20:02,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 09:20:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 09:20:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-11-23 09:20:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:20:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-23 09:20:02,540 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 14 [2018-11-23 09:20:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:02,540 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-23 09:20:02,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 09:20:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-23 09:20:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 09:20:02,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:02,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:02,542 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:02,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:02,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2041464428, now seen corresponding path program 1 times [2018-11-23 09:20:02,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:02,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:02,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:02,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:02,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:02,623 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 09:20:02,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:20:02,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:20:02,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:20:02,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:20:02,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:20:02,625 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 4 states. [2018-11-23 09:20:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:02,733 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-23 09:20:02,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:20:02,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 09:20:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:02,734 INFO L225 Difference]: With dead ends: 48 [2018-11-23 09:20:02,734 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 09:20:02,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:20:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 09:20:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 09:20:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 09:20:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-23 09:20:02,738 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-11-23 09:20:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:02,739 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-23 09:20:02,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:20:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 09:20:02,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:20:02,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:02,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:02,740 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:02,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:02,740 INFO L82 PathProgramCache]: Analyzing trace with hash 952866840, now seen corresponding path program 1 times [2018-11-23 09:20:02,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:02,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:02,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:02,829 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 09:20:02,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:20:02,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:20:02,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:20:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:20:02,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:20:02,830 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-11-23 09:20:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:02,981 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 09:20:02,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:20:02,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 09:20:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:02,982 INFO L225 Difference]: With dead ends: 46 [2018-11-23 09:20:02,983 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 09:20:02,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:20:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 09:20:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 09:20:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 09:20:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-23 09:20:02,990 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2018-11-23 09:20:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:02,991 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 09:20:02,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:20:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 09:20:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 09:20:02,992 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:02,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:02,992 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:02,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1947786916, now seen corresponding path program 1 times [2018-11-23 09:20:02,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:02,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:02,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:03,107 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 09:20:03,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:20:03,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 09:20:03,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 09:20:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 09:20:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:20:03,109 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-11-23 09:20:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:03,190 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-23 09:20:03,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:20:03,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-23 09:20:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:03,191 INFO L225 Difference]: With dead ends: 59 [2018-11-23 09:20:03,191 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 09:20:03,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:20:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 09:20:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-23 09:20:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 09:20:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-23 09:20:03,197 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2018-11-23 09:20:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:03,198 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-23 09:20:03,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 09:20:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 09:20:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 09:20:03,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:03,199 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:03,199 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:03,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:03,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1663987840, now seen corresponding path program 1 times [2018-11-23 09:20:03,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:03,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:03,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:03,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:03,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:20:03,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:20:03,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:03,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:20:03,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 09:20:03,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-23 09:20:03,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:03,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-23 09:20:03,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:03,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:03,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:03,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-23 09:20:03,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,438 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 09:20:03,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-23 09:20:03,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:03,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-23 09:20:03,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:03,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:03,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:03,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-11-23 09:20:03,480 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,513 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,520 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,526 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,534 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-11-23 09:20:03,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 09:20:03,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:03,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 09:20:03,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 09:20:03,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:03,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 09:20:03,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:03,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-11-23 09:20:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:03,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:20:03,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 09:20:03,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 09:20:03,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 09:20:03,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 09:20:03,636 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2018-11-23 09:20:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:03,880 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 09:20:03,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:20:03,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 09:20:03,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:03,880 INFO L225 Difference]: With dead ends: 63 [2018-11-23 09:20:03,880 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 09:20:03,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 09:20:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 09:20:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 09:20:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 09:20:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-11-23 09:20:03,884 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 21 [2018-11-23 09:20:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:03,884 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-11-23 09:20:03,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 09:20:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-11-23 09:20:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 09:20:03,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:03,885 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:03,885 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:03,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:03,885 INFO L82 PathProgramCache]: Analyzing trace with hash -306382864, now seen corresponding path program 1 times [2018-11-23 09:20:03,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:03,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:03,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:03,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:03,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:04,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:20:04,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:20:04,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:04,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:20:04,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 09:20:04,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 09:20:04,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 09:20:04,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 09:20:04,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:04,113 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-11-23 09:20:04,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:04,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:04,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:20:04,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:04,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:04,207 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:04,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:04,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 51 [2018-11-23 09:20:04,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:04,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 09:20:04,243 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-23 09:20:04,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 09:20:04,263 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,307 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:20:04,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 73 [2018-11-23 09:20:04,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 87 [2018-11-23 09:20:04,330 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-23 09:20:04,346 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:20:04,360 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:20:04,373 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 09:20:04,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2018-11-23 09:20:04,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:04,451 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-23 09:20:04,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 09:20:04,461 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,465 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,471 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-11-23 09:20:04,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:04,495 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 09:20:04,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 09:20:04,507 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,509 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,514 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,530 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:105, output treesize:14 [2018-11-23 09:20:04,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 09:20:04,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 09:20:04,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:04,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-11-23 09:20:04,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 09:20:04,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 09:20:04,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 09:20:04,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:04,615 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-23 09:20:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:04,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:20:04,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 09:20:04,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 09:20:04,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 09:20:04,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-23 09:20:04,639 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 11 states. [2018-11-23 09:20:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:05,214 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-11-23 09:20:05,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 09:20:05,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-23 09:20:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:05,215 INFO L225 Difference]: With dead ends: 107 [2018-11-23 09:20:05,215 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 09:20:05,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-11-23 09:20:05,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 09:20:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-11-23 09:20:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 09:20:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-23 09:20:05,222 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 25 [2018-11-23 09:20:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:05,222 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-23 09:20:05,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 09:20:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-23 09:20:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 09:20:05,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:05,223 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:05,223 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:05,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1987060883, now seen corresponding path program 1 times [2018-11-23 09:20:05,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:05,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:05,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:05,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:05,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:05,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:20:05,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:20:05,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:05,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:20:05,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 09:20:05,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 09:20:05,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:05,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2018-11-23 09:20:05,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:05,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:05,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:20:05,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-11-23 09:20:05,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:05,624 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-23 09:20:05,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:05,648 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-23 09:20:05,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:05,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 47 [2018-11-23 09:20:05,683 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,697 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,707 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-11-23 09:20:05,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 09:20:05,774 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-11-23 09:20:05,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:05,810 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:05,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-11-23 09:20:05,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:05,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-23 09:20:05,835 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,845 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,855 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,863 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,875 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:191, output treesize:71 [2018-11-23 09:20:05,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-23 09:20:05,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 09:20:05,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 182 [2018-11-23 09:20:05,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:05,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:05,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:05,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 99 [2018-11-23 09:20:05,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:05,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 109 [2018-11-23 09:20:05,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:05,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 143 [2018-11-23 09:20:05,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,019 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:212, output treesize:94 [2018-11-23 09:20:06,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 67 [2018-11-23 09:20:06,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2018-11-23 09:20:06,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-11-23 09:20:06,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-11-23 09:20:06,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-23 09:20:06,125 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:06,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 09:20:06,149 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,156 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,161 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:108, output treesize:13 [2018-11-23 09:20:06,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 09:20:06,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 09:20:06,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:06,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 09:20:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:06,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:20:06,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-11-23 09:20:06,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 09:20:06,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 09:20:06,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-23 09:20:06,236 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 19 states. [2018-11-23 09:20:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:07,296 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-11-23 09:20:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 09:20:07,296 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-11-23 09:20:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:07,297 INFO L225 Difference]: With dead ends: 115 [2018-11-23 09:20:07,298 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 09:20:07,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-11-23 09:20:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 09:20:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2018-11-23 09:20:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 09:20:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-11-23 09:20:07,306 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 32 [2018-11-23 09:20:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:07,306 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-11-23 09:20:07,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 09:20:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-11-23 09:20:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 09:20:07,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:07,307 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:07,307 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:07,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:07,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2121074389, now seen corresponding path program 1 times [2018-11-23 09:20:07,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:07,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:07,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:07,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:07,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:07,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:20:07,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:20:07,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:07,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:20:07,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 09:20:07,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 09:20:07,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:07,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2018-11-23 09:20:07,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:07,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:07,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 09:20:07,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 57 [2018-11-23 09:20:07,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:07,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-23 09:20:07,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 09:20:07,647 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-23 09:20:07,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:07,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 53 [2018-11-23 09:20:07,675 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,701 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,725 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 84 [2018-11-23 09:20:07,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 09:20:07,795 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 78 [2018-11-23 09:20:07,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 09:20:07,828 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:07,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 73 [2018-11-23 09:20:07,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:07,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 41 [2018-11-23 09:20:07,855 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,867 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,877 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,886 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:07,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:07,910 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:212, output treesize:111 [2018-11-23 09:20:07,967 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:07,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:07,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:07,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 09:20:07,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:08,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 784 treesize of output 624 [2018-11-23 09:20:08,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:08,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:08,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:08,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 592 treesize of output 812 [2018-11-23 09:20:08,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:08,424 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:08,596 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:08,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:08,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 726 treesize of output 483 [2018-11-23 09:20:08,971 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-23 09:20:08,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:08,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:08,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:08,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 150 [2018-11-23 09:20:09,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,012 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:20:09,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 145 [2018-11-23 09:20:09,023 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,039 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 437 treesize of output 455 [2018-11-23 09:20:09,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 09:20:09,106 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,146 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:20:09,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 452 [2018-11-23 09:20:09,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 67 [2018-11-23 09:20:09,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 126 [2018-11-23 09:20:09,185 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,196 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,224 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,246 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 461 treesize of output 250 [2018-11-23 09:20:09,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 204 [2018-11-23 09:20:09,395 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 232 [2018-11-23 09:20:09,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 09:20:09,439 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,469 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:20:09,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 227 [2018-11-23 09:20:09,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 212 [2018-11-23 09:20:09,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 247 [2018-11-23 09:20:09,497 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,517 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,539 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,562 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,584 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:09,612 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:798, output treesize:200 [2018-11-23 09:20:09,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 125 [2018-11-23 09:20:09,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2018-11-23 09:20:09,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-11-23 09:20:09,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:09,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 09:20:09,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:09,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:309, output treesize:121 [2018-11-23 09:20:09,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 59 [2018-11-23 09:20:09,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-11-23 09:20:09,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 09:20:09,890 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 09:20:09,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:09,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:4 [2018-11-23 09:20:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:09,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:20:09,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-23 09:20:09,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 09:20:09,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 09:20:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-11-23 09:20:09,937 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 15 states. [2018-11-23 09:20:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:11,004 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-11-23 09:20:11,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 09:20:11,006 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-11-23 09:20:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:11,007 INFO L225 Difference]: With dead ends: 111 [2018-11-23 09:20:11,007 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 09:20:11,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-11-23 09:20:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 09:20:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 84. [2018-11-23 09:20:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 09:20:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-11-23 09:20:11,020 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 32 [2018-11-23 09:20:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:11,021 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-11-23 09:20:11,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 09:20:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-11-23 09:20:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:20:11,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:11,022 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:11,022 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:11,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2122609175, now seen corresponding path program 2 times [2018-11-23 09:20:11,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:11,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:11,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:11,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:20:11,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:11,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:20:11,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:20:11,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 09:20:11,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:20:11,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:20:11,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:20:11,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 09:20:11,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 09:20:11,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:11,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2018-11-23 09:20:11,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 09:20:11,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-11-23 09:20:11,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:11,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-23 09:20:11,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:11,539 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-23 09:20:11,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 47 [2018-11-23 09:20:11,584 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,602 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,614 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-11-23 09:20:11,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 09:20:11,698 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-11-23 09:20:11,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:11,732 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-11-23 09:20:11,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,755 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:20:11,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 46 [2018-11-23 09:20:11,756 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,768 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,776 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,785 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,802 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:197, output treesize:92 [2018-11-23 09:20:11,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 90 [2018-11-23 09:20:11,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2018-11-23 09:20:11,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-11-23 09:20:11,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:11,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 82 [2018-11-23 09:20:11,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:11,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:84 [2018-11-23 09:20:12,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 83 [2018-11-23 09:20:12,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:12,081 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:20:12,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2018-11-23 09:20:12,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:12,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-23 09:20:12,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:12,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:12,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-23 09:20:12,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:12,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2018-11-23 09:20:12,128 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:12,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 09:20:12,137 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:12,140 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:12,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:12,148 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:125, output treesize:10 [2018-11-23 09:20:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:12,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:20:12,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-23 09:20:12,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 09:20:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 09:20:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-23 09:20:12,187 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 17 states. [2018-11-23 09:20:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:12,733 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-11-23 09:20:12,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 09:20:12,733 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-11-23 09:20:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:12,735 INFO L225 Difference]: With dead ends: 100 [2018-11-23 09:20:12,735 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 09:20:12,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-11-23 09:20:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 09:20:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-23 09:20:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 09:20:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-11-23 09:20:12,741 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 35 [2018-11-23 09:20:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:12,742 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-23 09:20:12,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 09:20:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-11-23 09:20:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:20:12,742 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:12,743 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:12,743 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:12,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash -249130087, now seen corresponding path program 2 times [2018-11-23 09:20:12,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:12,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:12,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:20:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:20:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:13,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:20:13,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:20:13,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 09:20:13,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:20:13,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:20:13,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:20:13,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 09:20:13,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 09:20:13,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:13,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2018-11-23 09:20:13,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:13,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:13,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-23 09:20:13,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-11-23 09:20:13,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:13,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-23 09:20:13,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:13,209 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-23 09:20:13,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:13,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 47 [2018-11-23 09:20:13,246 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,277 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-11-23 09:20:13,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 09:20:13,366 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-11-23 09:20:13,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:13,395 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:13,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-11-23 09:20:13,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:13,427 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:20:13,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 46 [2018-11-23 09:20:13,428 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,448 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,456 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,463 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,480 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:203, output treesize:102 [2018-11-23 09:20:13,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:13,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:13,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:13,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 09:20:13,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:13,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:13,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:14,362 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:14,473 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:14,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3146 treesize of output 2201 [2018-11-23 09:20:15,211 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 83 [2018-11-23 09:20:15,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:15,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:15,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:15,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 130 [2018-11-23 09:20:15,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:15,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:15,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 139 [2018-11-23 09:20:15,271 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:15,306 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:15,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2001 treesize of output 2017 [2018-11-23 09:20:15,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 09:20:15,442 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:15,555 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:20:15,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1980 treesize of output 1892 [2018-11-23 09:20:15,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:15,635 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:20:15,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 250 [2018-11-23 09:20:15,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:15,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:15,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 327 [2018-11-23 09:20:15,662 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:15,695 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:15,770 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:15,854 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:15,921 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:16,041 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:16,051 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:16,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-11-23 09:20:16,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-11-23 09:20:16,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-11-23 09:20:16,189 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:16,201 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:16,207 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:16,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1540 treesize of output 566 [2018-11-23 09:20:16,573 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2018-11-23 09:20:16,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 468 [2018-11-23 09:20:16,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 465 treesize of output 630 [2018-11-23 09:20:16,623 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:16,688 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:16,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 552 treesize of output 456 [2018-11-23 09:20:16,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 09:20:16,766 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:16,834 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:20:16,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 512 [2018-11-23 09:20:16,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,897 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 550 treesize of output 546 [2018-11-23 09:20:16,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:16,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 539 treesize of output 609 [2018-11-23 09:20:16,936 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-23 09:20:17,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 527 [2018-11-23 09:20:17,422 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,501 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,538 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,570 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,601 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 157 [2018-11-23 09:20:17,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 09:20:17,646 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 154 [2018-11-23 09:20:17,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2018-11-23 09:20:17,671 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,679 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,684 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 144 [2018-11-23 09:20:17,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 135 [2018-11-23 09:20:17,724 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,735 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:17,761 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 10 variables, input treesize:2496, output treesize:210 [2018-11-23 09:20:17,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 169 [2018-11-23 09:20:17,890 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 99 [2018-11-23 09:20:17,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 09:20:17,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 101 [2018-11-23 09:20:17,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:17,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 09:20:17,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:17,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2018-11-23 09:20:17,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 36 [2018-11-23 09:20:17,978 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:17,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:17,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 09:20:17,993 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:18,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:18,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-23 09:20:18,002 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:18,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:18,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 09:20:18,014 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:282, output treesize:22 [2018-11-23 09:20:18,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:18,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:20:18,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-11-23 09:20:18,044 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-11-23 09:20:18,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:18,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 09:20:18,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:20:18,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:18,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:20:18,060 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-11-23 09:20:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:20:18,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:20:18,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-11-23 09:20:18,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 09:20:18,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 09:20:18,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-23 09:20:18,109 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-11-23 09:20:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:20:19,271 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-23 09:20:19,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 09:20:19,273 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-11-23 09:20:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:20:19,274 INFO L225 Difference]: With dead ends: 128 [2018-11-23 09:20:19,274 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 09:20:19,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-11-23 09:20:19,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 09:20:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-11-23 09:20:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 09:20:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-11-23 09:20:19,282 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 35 [2018-11-23 09:20:19,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:20:19,282 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-23 09:20:19,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 09:20:19,282 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-11-23 09:20:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:20:19,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:20:19,283 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:20:19,284 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:20:19,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:20:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1364216251, now seen corresponding path program 1 times [2018-11-23 09:20:19,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:20:19,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:20:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:19,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:20:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:20:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:20:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:20:19,354 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=22, |#NULL.offset|=15, |old(#NULL.base)|=22, |old(#NULL.offset)|=15] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=15] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=15] [?] RET #189#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret21 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~nondet2|=1] [?] assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem4.base, 4 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [main_~end~0.base=34, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~nondet6|=0] [?] assume !(0 != #t~nondet6);havoc #t~nondet6;call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem8.base, 4 + #t~mem8.offset, 4);havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem10|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem10);havoc #t~mem10; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem11.base|=33, |main_#t~mem11.offset|=0] [?] assume !!(~null~0.base == #t~mem11.base && ~null~0.offset == #t~mem11.offset);havoc #t~mem11.base, #t~mem11.offset; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem12|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem12);havoc #t~mem12; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem13|=1] [?] assume !(~unnamed1~0~RED == #t~mem13);havoc #t~mem13; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset; VAL [main_~end~0.base=34, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=34, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem13|=0] [?] assume ~unnamed1~0~RED == #t~mem13;havoc #t~mem13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] call #t~mem15 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem15|=1] [?] assume !(~unnamed1~0~BLACK != #t~mem15);havoc #t~mem15; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !false; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=15, old(#NULL.base)=22, old(#NULL.offset)=15] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=15] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; [L988] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); [L989] call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4); [L990] call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4); [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4); [L995] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~nondet2=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000-L1024] assume !!(0 != #t~nondet2); [L1000] havoc #t~nondet2; [L1003] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12); [L1003] call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); [L1004] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1004] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem4.base, 4 + #t~mem4.offset, 4); [L1004] havoc #t~mem4.base, #t~mem4.offset; [L1005] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1005] ~end~0.base, ~end~0.offset := #t~mem5.base, #t~mem5.offset; [L1005] havoc #t~mem5.base, #t~mem5.offset; [L1006] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~nondet6=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1008-L1020] assume !(0 != #t~nondet6); [L1008] havoc #t~nondet6; [L1014] call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4); [L1015] call #t~malloc7.base, #t~malloc7.offset := #Ultimate.alloc(12); [L1015] call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~end~0.base, ~end~0.offset, 4); [L1016] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1016] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem8.base, 4 + #t~mem8.offset, 4); [L1016] havoc #t~mem8.base, #t~mem8.offset; [L1017] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1017] ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset; [L1017] havoc #t~mem9.base, #t~mem9.offset; [L1018] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1019] call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1021] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem10=1, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1021] assume !!(~unnamed1~0~BLACK == #t~mem10); [L1021] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1022] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem11.base=33, #t~mem11.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1022] assume !!(~null~0.base == #t~mem11.base && ~null~0.offset == #t~mem11.offset); [L1022] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1023] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~nondet2=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000-L1024] assume !(0 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1031] call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem12=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem13=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem13=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1034-L1039] assume ~unnamed1~0~RED == #t~mem13; [L1034] havoc #t~mem13; [L1036] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1036] ~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset; [L1036] havoc #t~mem14.base, #t~mem14.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1037] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] call #t~mem15 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem15=1, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] assume !(~unnamed1~0~BLACK != #t~mem15); [L1038] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=15, old(#NULL.base)=22, old(#NULL.offset)=15] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=15] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; [L988] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); [L989] call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4); [L990] call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4); [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4); [L995] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~nondet2=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000-L1024] assume !!(0 != #t~nondet2); [L1000] havoc #t~nondet2; [L1003] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12); [L1003] call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); [L1004] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1004] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem4.base, 4 + #t~mem4.offset, 4); [L1004] havoc #t~mem4.base, #t~mem4.offset; [L1005] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1005] ~end~0.base, ~end~0.offset := #t~mem5.base, #t~mem5.offset; [L1005] havoc #t~mem5.base, #t~mem5.offset; [L1006] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~nondet6=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1008-L1020] assume !(0 != #t~nondet6); [L1008] havoc #t~nondet6; [L1014] call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4); [L1015] call #t~malloc7.base, #t~malloc7.offset := #Ultimate.alloc(12); [L1015] call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~end~0.base, ~end~0.offset, 4); [L1016] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1016] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem8.base, 4 + #t~mem8.offset, 4); [L1016] havoc #t~mem8.base, #t~mem8.offset; [L1017] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1017] ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset; [L1017] havoc #t~mem9.base, #t~mem9.offset; [L1018] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1019] call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1021] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem10=1, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1021] assume !!(~unnamed1~0~BLACK == #t~mem10); [L1021] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1022] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem11.base=33, #t~mem11.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1022] assume !!(~null~0.base == #t~mem11.base && ~null~0.offset == #t~mem11.offset); [L1022] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1023] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~nondet2=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000-L1024] assume !(0 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1031] call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem12=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem13=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem13=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1034-L1039] assume ~unnamed1~0~RED == #t~mem13; [L1034] havoc #t~mem13; [L1036] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1036] ~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset; [L1036] havoc #t~mem14.base, #t~mem14.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1037] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] call #t~mem15 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem15=1, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] assume !(~unnamed1~0~BLACK != #t~mem15); [L1038] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=15, old(#NULL!base)=22, old(#NULL!offset)=15] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1000] havoc #t~nondet2; [L1003] FCALL call #t~malloc3 := #Ultimate.alloc(12); [L1003] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call write~$Pointer$(~end~0, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L1004] havoc #t~mem4; [L1005] FCALL call #t~mem5 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1005] ~end~0 := #t~mem5; [L1005] havoc #t~mem5; [L1006] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~nondet6=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1008-L1020] COND FALSE !(0 != #t~nondet6) [L1008] havoc #t~nondet6; [L1014] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1015] FCALL call #t~malloc7 := #Ultimate.alloc(12); [L1015] FCALL call write~$Pointer$(#t~malloc7, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call write~$Pointer$(~end~0, { base: #t~mem8!base, offset: 4 + #t~mem8!offset }, 4); [L1016] havoc #t~mem8; [L1017] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1017] ~end~0 := #t~mem9; [L1017] havoc #t~mem9; [L1018] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem10=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem10)) [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem11!base=33, #t~mem11!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] COND FALSE !(!(~null~0 == #t~mem11)) [L1022] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1023] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~nondet2=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem12=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem13 [L1034] havoc #t~mem13; [L1036] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1036] ~end~0 := #t~mem14; [L1036] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1037] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] FCALL call #t~mem15 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem15=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] COND TRUE !(~unnamed1~0~BLACK != #t~mem15) [L1038] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=15, old(#NULL!base)=22, old(#NULL!offset)=15] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1000] havoc #t~nondet2; [L1003] FCALL call #t~malloc3 := #Ultimate.alloc(12); [L1003] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call write~$Pointer$(~end~0, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L1004] havoc #t~mem4; [L1005] FCALL call #t~mem5 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1005] ~end~0 := #t~mem5; [L1005] havoc #t~mem5; [L1006] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~nondet6=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1008-L1020] COND FALSE !(0 != #t~nondet6) [L1008] havoc #t~nondet6; [L1014] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1015] FCALL call #t~malloc7 := #Ultimate.alloc(12); [L1015] FCALL call write~$Pointer$(#t~malloc7, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call write~$Pointer$(~end~0, { base: #t~mem8!base, offset: 4 + #t~mem8!offset }, 4); [L1016] havoc #t~mem8; [L1017] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1017] ~end~0 := #t~mem9; [L1017] havoc #t~mem9; [L1018] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem10=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem10)) [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem11!base=33, #t~mem11!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] COND FALSE !(!(~null~0 == #t~mem11)) [L1022] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1023] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~nondet2=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem12=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem13 [L1034] havoc #t~mem13; [L1036] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1036] ~end~0 := #t~mem14; [L1036] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1037] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] FCALL call #t~mem15 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem15=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] COND TRUE !(~unnamed1~0~BLACK != #t~mem15) [L1038] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=15, old(#NULL!base)=22, old(#NULL!offset)=15] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1000] havoc #t~nondet2; [L1003] FCALL call #t~malloc3 := #Ultimate.alloc(12); [L1003] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call write~$Pointer$(~end~0, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L1004] havoc #t~mem4; [L1005] FCALL call #t~mem5 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1005] ~end~0 := #t~mem5; [L1005] havoc #t~mem5; [L1006] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~nondet6=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1008-L1020] COND FALSE !(0 != #t~nondet6) [L1008] havoc #t~nondet6; [L1014] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1015] FCALL call #t~malloc7 := #Ultimate.alloc(12); [L1015] FCALL call write~$Pointer$(#t~malloc7, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call write~$Pointer$(~end~0, { base: #t~mem8!base, offset: 4 + #t~mem8!offset }, 4); [L1016] havoc #t~mem8; [L1017] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1017] ~end~0 := #t~mem9; [L1017] havoc #t~mem9; [L1018] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem10=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem10)) [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem11!base=33, #t~mem11!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] COND FALSE !(!(~null~0 == #t~mem11)) [L1022] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1023] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~nondet2=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem12=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem13 [L1034] havoc #t~mem13; [L1036] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1036] ~end~0 := #t~mem14; [L1036] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1037] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] FCALL call #t~mem15 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem15=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] COND TRUE !(~unnamed1~0~BLACK != #t~mem15) [L1038] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=15, old(#NULL!base)=22, old(#NULL!offset)=15] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1000] havoc #t~nondet2; [L1003] FCALL call #t~malloc3 := #Ultimate.alloc(12); [L1003] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call write~$Pointer$(~end~0, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L1004] havoc #t~mem4; [L1005] FCALL call #t~mem5 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1005] ~end~0 := #t~mem5; [L1005] havoc #t~mem5; [L1006] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~nondet6=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1008-L1020] COND FALSE !(0 != #t~nondet6) [L1008] havoc #t~nondet6; [L1014] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1015] FCALL call #t~malloc7 := #Ultimate.alloc(12); [L1015] FCALL call write~$Pointer$(#t~malloc7, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call write~$Pointer$(~end~0, { base: #t~mem8!base, offset: 4 + #t~mem8!offset }, 4); [L1016] havoc #t~mem8; [L1017] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1017] ~end~0 := #t~mem9; [L1017] havoc #t~mem9; [L1018] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem10=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem10)) [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem11!base=33, #t~mem11!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] COND FALSE !(!(~null~0 == #t~mem11)) [L1022] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1023] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~nondet2=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem12=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem13 [L1034] havoc #t~mem13; [L1036] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1036] ~end~0 := #t~mem14; [L1036] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1037] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] FCALL call #t~mem15 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem15=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] COND TRUE !(~unnamed1~0~BLACK != #t~mem15) [L1038] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1021] EXPR end->colour VAL [end={36:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next VAL [end={36:0}, end->next={33:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1031] EXPR end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={34:0}, end->colour=0, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1038] EXPR end->colour VAL [end={36:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] ----- [2018-11-23 09:20:19,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:20:19 BoogieIcfgContainer [2018-11-23 09:20:19,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:20:19,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:20:19,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:20:19,539 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:20:19,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:20:01" (3/4) ... [2018-11-23 09:20:19,542 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|=22, |#NULL.offset|=15, |old(#NULL.base)|=22, |old(#NULL.offset)|=15] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=15] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=22, |old(#NULL.offset)|=15] [?] RET #189#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret21 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4);call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4);call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~nondet2|=1] [?] assume !!(0 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem4.base, 4 + #t~mem4.offset, 4);havoc #t~mem4.base, #t~mem4.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [main_~end~0.base=34, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~nondet6|=0] [?] assume !(0 != #t~nondet6);havoc #t~nondet6;call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~end~0.base, ~end~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem8.base, 4 + #t~mem8.offset, 4);havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4);call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem10|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem10);havoc #t~mem10; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem11.base|=33, |main_#t~mem11.offset|=0] [?] assume !!(~null~0.base == #t~mem11.base && ~null~0.offset == #t~mem11.offset);havoc #t~mem11.base, #t~mem11.offset; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem12|=1] [?] assume !!(~unnamed1~0~BLACK == #t~mem12);havoc #t~mem12; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem13|=1] [?] assume !(~unnamed1~0~RED == #t~mem13);havoc #t~mem13; VAL [main_~end~0.base=30, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset; VAL [main_~end~0.base=34, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=34, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem13|=0] [?] assume ~unnamed1~0~RED == #t~mem13;havoc #t~mem13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4);~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] goto; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] call #t~mem15 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0, |main_#t~mem15|=1] [?] assume !(~unnamed1~0~BLACK != #t~mem15);havoc #t~mem15; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] assume !false; VAL [main_~end~0.base=36, main_~end~0.offset=0, main_~list~0.base=30, main_~list~0.offset=0, main_~null~0.base=33, main_~null~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=33, |main_#t~malloc0.offset|=0, |main_#t~malloc1.base|=30, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=34, |main_#t~malloc3.offset|=0, |main_#t~malloc7.base|=36, |main_#t~malloc7.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=15, old(#NULL.base)=22, old(#NULL.offset)=15] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=15] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; [L988] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); [L989] call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4); [L990] call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4); [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4); [L995] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~nondet2=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000-L1024] assume !!(0 != #t~nondet2); [L1000] havoc #t~nondet2; [L1003] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12); [L1003] call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); [L1004] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1004] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem4.base, 4 + #t~mem4.offset, 4); [L1004] havoc #t~mem4.base, #t~mem4.offset; [L1005] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1005] ~end~0.base, ~end~0.offset := #t~mem5.base, #t~mem5.offset; [L1005] havoc #t~mem5.base, #t~mem5.offset; [L1006] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~nondet6=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1008-L1020] assume !(0 != #t~nondet6); [L1008] havoc #t~nondet6; [L1014] call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4); [L1015] call #t~malloc7.base, #t~malloc7.offset := #Ultimate.alloc(12); [L1015] call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~end~0.base, ~end~0.offset, 4); [L1016] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1016] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem8.base, 4 + #t~mem8.offset, 4); [L1016] havoc #t~mem8.base, #t~mem8.offset; [L1017] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1017] ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset; [L1017] havoc #t~mem9.base, #t~mem9.offset; [L1018] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1019] call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1021] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem10=1, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1021] assume !!(~unnamed1~0~BLACK == #t~mem10); [L1021] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1022] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem11.base=33, #t~mem11.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1022] assume !!(~null~0.base == #t~mem11.base && ~null~0.offset == #t~mem11.offset); [L1022] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1023] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~nondet2=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000-L1024] assume !(0 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1031] call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem12=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem13=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem13=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1034-L1039] assume ~unnamed1~0~RED == #t~mem13; [L1034] havoc #t~mem13; [L1036] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1036] ~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset; [L1036] havoc #t~mem14.base, #t~mem14.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1037] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] call #t~mem15 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem15=1, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] assume !(~unnamed1~0~BLACK != #t~mem15); [L1038] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=22, #NULL.offset=15, old(#NULL.base)=22, old(#NULL.offset)=15] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=15] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=22, old(#NULL.offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L987] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12); [L987] ~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset; [L988] call write~$Pointer$(0, 0, ~null~0.base, ~null~0.offset, 4); [L989] call write~$Pointer$(0, 0, ~null~0.base, 4 + ~null~0.offset, 4); [L990] call write~int(~unnamed1~0~BLACK, ~null~0.base, 8 + ~null~0.offset, 4); [L992] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12); [L992] ~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset; [L993] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4); [L994] call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, 4 + ~list~0.offset, 4); [L995] call write~int(~unnamed1~0~BLACK, ~list~0.base, 8 + ~list~0.offset, 4); [L997] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~nondet2=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000-L1024] assume !!(0 != #t~nondet2); [L1000] havoc #t~nondet2; [L1003] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12); [L1003] call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4); [L1004] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1004] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem4.base, 4 + #t~mem4.offset, 4); [L1004] havoc #t~mem4.base, #t~mem4.offset; [L1005] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1005] ~end~0.base, ~end~0.offset := #t~mem5.base, #t~mem5.offset; [L1005] havoc #t~mem5.base, #t~mem5.offset; [L1006] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~nondet6=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1008-L1020] assume !(0 != #t~nondet6); [L1008] havoc #t~nondet6; [L1014] call write~int(~unnamed1~0~RED, ~end~0.base, 8 + ~end~0.offset, 4); [L1015] call #t~malloc7.base, #t~malloc7.offset := #Ultimate.alloc(12); [L1015] call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~end~0.base, ~end~0.offset, 4); [L1016] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1016] call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem8.base, 4 + #t~mem8.offset, 4); [L1016] havoc #t~mem8.base, #t~mem8.offset; [L1017] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1017] ~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset; [L1017] havoc #t~mem9.base, #t~mem9.offset; [L1018] call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4); [L1019] call write~int(~unnamed1~0~BLACK, ~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1021] call #t~mem10 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem10=1, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1021] assume !!(~unnamed1~0~BLACK == #t~mem10); [L1021] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1022] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem11.base=33, #t~mem11.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1022] assume !!(~null~0.base == #t~mem11.base && ~null~0.offset == #t~mem11.offset); [L1022] havoc #t~mem11.base, #t~mem11.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1023] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~nondet2=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1000-L1024] assume !(0 != #t~nondet2); [L1000] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1026] ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset; [L1027] ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1030] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1031] call #t~mem12 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem12=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1031] assume !!(~unnamed1~0~BLACK == #t~mem12); [L1031] havoc #t~mem12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem13=1, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1034-L1039] assume !(~unnamed1~0~RED == #t~mem13); [L1034] havoc #t~mem13; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=30, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1041] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1041] ~end~0.base, ~end~0.offset := #t~mem16.base, #t~mem16.offset; [L1041] havoc #t~mem16.base, #t~mem16.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1032-L1042] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); [L1034] call #t~mem13 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem13=0, ~end~0.base=34, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1034-L1039] assume ~unnamed1~0~RED == #t~mem13; [L1034] havoc #t~mem13; [L1036] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); [L1036] ~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset; [L1036] havoc #t~mem14.base, #t~mem14.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1037] assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] call #t~mem15 := read~int(~end~0.base, 8 + ~end~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, #t~mem15=1, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] assume !(~unnamed1~0~BLACK != #t~mem15); [L1038] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [L1038] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=33, #t~malloc0.offset=0, #t~malloc1.base=30, #t~malloc1.offset=0, #t~malloc3.base=34, #t~malloc3.offset=0, #t~malloc7.base=36, #t~malloc7.offset=0, ~end~0.base=36, ~end~0.offset=0, ~list~0.base=30, ~list~0.offset=0, ~null~0.base=33, ~null~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=15, old(#NULL!base)=22, old(#NULL!offset)=15] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1000] havoc #t~nondet2; [L1003] FCALL call #t~malloc3 := #Ultimate.alloc(12); [L1003] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call write~$Pointer$(~end~0, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L1004] havoc #t~mem4; [L1005] FCALL call #t~mem5 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1005] ~end~0 := #t~mem5; [L1005] havoc #t~mem5; [L1006] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~nondet6=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1008-L1020] COND FALSE !(0 != #t~nondet6) [L1008] havoc #t~nondet6; [L1014] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1015] FCALL call #t~malloc7 := #Ultimate.alloc(12); [L1015] FCALL call write~$Pointer$(#t~malloc7, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call write~$Pointer$(~end~0, { base: #t~mem8!base, offset: 4 + #t~mem8!offset }, 4); [L1016] havoc #t~mem8; [L1017] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1017] ~end~0 := #t~mem9; [L1017] havoc #t~mem9; [L1018] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem10=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem10)) [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem11!base=33, #t~mem11!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] COND FALSE !(!(~null~0 == #t~mem11)) [L1022] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1023] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~nondet2=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem12=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem13 [L1034] havoc #t~mem13; [L1036] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1036] ~end~0 := #t~mem14; [L1036] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1037] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] FCALL call #t~mem15 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem15=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] COND TRUE !(~unnamed1~0~BLACK != #t~mem15) [L1038] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=15, old(#NULL!base)=22, old(#NULL!offset)=15] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1000] havoc #t~nondet2; [L1003] FCALL call #t~malloc3 := #Ultimate.alloc(12); [L1003] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call write~$Pointer$(~end~0, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L1004] havoc #t~mem4; [L1005] FCALL call #t~mem5 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1005] ~end~0 := #t~mem5; [L1005] havoc #t~mem5; [L1006] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~nondet6=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1008-L1020] COND FALSE !(0 != #t~nondet6) [L1008] havoc #t~nondet6; [L1014] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1015] FCALL call #t~malloc7 := #Ultimate.alloc(12); [L1015] FCALL call write~$Pointer$(#t~malloc7, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call write~$Pointer$(~end~0, { base: #t~mem8!base, offset: 4 + #t~mem8!offset }, 4); [L1016] havoc #t~mem8; [L1017] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1017] ~end~0 := #t~mem9; [L1017] havoc #t~mem9; [L1018] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem10=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem10)) [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem11!base=33, #t~mem11!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] COND FALSE !(!(~null~0 == #t~mem11)) [L1022] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1023] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~nondet2=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem12=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem13 [L1034] havoc #t~mem13; [L1036] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1036] ~end~0 := #t~mem14; [L1036] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1037] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] FCALL call #t~mem15 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem15=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] COND TRUE !(~unnamed1~0~BLACK != #t~mem15) [L1038] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=15, old(#NULL!base)=22, old(#NULL!offset)=15] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1000] havoc #t~nondet2; [L1003] FCALL call #t~malloc3 := #Ultimate.alloc(12); [L1003] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call write~$Pointer$(~end~0, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L1004] havoc #t~mem4; [L1005] FCALL call #t~mem5 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1005] ~end~0 := #t~mem5; [L1005] havoc #t~mem5; [L1006] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~nondet6=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1008-L1020] COND FALSE !(0 != #t~nondet6) [L1008] havoc #t~nondet6; [L1014] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1015] FCALL call #t~malloc7 := #Ultimate.alloc(12); [L1015] FCALL call write~$Pointer$(#t~malloc7, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call write~$Pointer$(~end~0, { base: #t~mem8!base, offset: 4 + #t~mem8!offset }, 4); [L1016] havoc #t~mem8; [L1017] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1017] ~end~0 := #t~mem9; [L1017] havoc #t~mem9; [L1018] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem10=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem10)) [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem11!base=33, #t~mem11!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] COND FALSE !(!(~null~0 == #t~mem11)) [L1022] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1023] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~nondet2=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem12=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem13 [L1034] havoc #t~mem13; [L1036] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1036] ~end~0 := #t~mem14; [L1036] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1037] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] FCALL call #t~mem15 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem15=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] COND TRUE !(~unnamed1~0~BLACK != #t~mem15) [L1038] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=22, #NULL!offset=15, old(#NULL!base)=22, old(#NULL!offset)=15] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=22, old(#NULL!offset)=15] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L987] FCALL call #t~malloc0 := #Ultimate.alloc(12); [L987] ~null~0 := #t~malloc0; [L988] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: ~null~0!offset }, 4); [L989] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~null~0!base, offset: 4 + ~null~0!offset }, 4); [L990] FCALL call write~int(~unnamed1~0~BLACK, { base: ~null~0!base, offset: 8 + ~null~0!offset }, 4); [L992] FCALL call #t~malloc1 := #Ultimate.alloc(12); [L992] ~list~0 := #t~malloc1; [L993] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: ~list~0!offset }, 4); [L994] FCALL call write~$Pointer$(~null~0, { base: ~list~0!base, offset: 4 + ~list~0!offset }, 4); [L995] FCALL call write~int(~unnamed1~0~BLACK, { base: ~list~0!base, offset: 8 + ~list~0!offset }, 4); [L997] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~nondet2=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND FALSE !(!(0 != #t~nondet2)) [L1000] havoc #t~nondet2; [L1003] FCALL call #t~malloc3 := #Ultimate.alloc(12); [L1003] FCALL call write~$Pointer$(#t~malloc3, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call #t~mem4 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1004] FCALL call write~$Pointer$(~end~0, { base: #t~mem4!base, offset: 4 + #t~mem4!offset }, 4); [L1004] havoc #t~mem4; [L1005] FCALL call #t~mem5 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1005] ~end~0 := #t~mem5; [L1005] havoc #t~mem5; [L1006] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1008] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~nondet6=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1008-L1020] COND FALSE !(0 != #t~nondet6) [L1008] havoc #t~nondet6; [L1014] FCALL call write~int(~unnamed1~0~RED, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); [L1015] FCALL call #t~malloc7 := #Ultimate.alloc(12); [L1015] FCALL call write~$Pointer$(#t~malloc7, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call #t~mem8 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1016] FCALL call write~$Pointer$(~end~0, { base: #t~mem8!base, offset: 4 + #t~mem8!offset }, 4); [L1016] havoc #t~mem8; [L1017] FCALL call #t~mem9 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1017] ~end~0 := #t~mem9; [L1017] havoc #t~mem9; [L1018] FCALL call write~$Pointer$(~null~0, { base: ~end~0!base, offset: ~end~0!offset }, 4); [L1019] FCALL call write~int(~unnamed1~0~BLACK, { base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] FCALL call #t~mem10 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem10=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1021] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem10)) [L1021] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] FCALL call #t~mem11 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem11!base=33, #t~mem11!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1022] COND FALSE !(!(~null~0 == #t~mem11)) [L1022] havoc #t~mem11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1023] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~nondet2=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1000-L1024] COND TRUE !(0 != #t~nondet2) [L1000] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1026] ~end~0 := ~null~0; [L1027] ~end~0 := ~list~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1030] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] FCALL call #t~mem12 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem12=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1031] COND FALSE !(!(~unnamed1~0~BLACK == #t~mem12)) [L1031] havoc #t~mem12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=1, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND FALSE !(~unnamed1~0~RED == #t~mem13) [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=30, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1041] FCALL call #t~mem16 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1041] ~end~0 := #t~mem16; [L1041] havoc #t~mem16; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1032-L1042] COND FALSE !(!(~null~0 != ~end~0)) [L1034] FCALL call #t~mem13 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem13=0, ~end~0!base=34, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1034] COND TRUE ~unnamed1~0~RED == #t~mem13 [L1034] havoc #t~mem13; [L1036] FCALL call #t~mem14 := read~$Pointer$({ base: ~end~0!base, offset: ~end~0!offset }, 4); [L1036] ~end~0 := #t~mem14; [L1036] havoc #t~mem14; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1037] COND FALSE !(!(~null~0 != ~end~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] FCALL call #t~mem15 := read~int({ base: ~end~0!base, offset: 8 + ~end~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, #t~mem15=1, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] COND TRUE !(~unnamed1~0~BLACK != #t~mem15) [L1038] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L1038] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=33, #t~malloc0!offset=0, #t~malloc1!base=30, #t~malloc1!offset=0, #t~malloc3!base=34, #t~malloc3!offset=0, #t~malloc7!base=36, #t~malloc7!offset=0, ~end~0!base=36, ~end~0!offset=0, ~list~0!base=30, ~list~0!offset=0, ~null~0!base=33, ~null~0!offset=0] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1021] EXPR end->colour VAL [end={36:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next VAL [end={36:0}, end->next={33:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1031] EXPR end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={34:0}, end->colour=0, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1038] EXPR end->colour VAL [end={36:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] ----- [2018-11-23 09:20:19,962 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_48d6f129-4202-46ff-861e-ea38d2cf287d/bin-2019/uautomizer/witness.graphml [2018-11-23 09:20:19,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:20:19,963 INFO L168 Benchmark]: Toolchain (without parser) took 19259.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 955.3 MB in the beginning and 1.3 GB in the end (delta: -360.9 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:20:19,963 INFO L168 Benchmark]: CDTParser took 0.19 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 09:20:19,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:20:19,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.12 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: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:20:19,964 INFO L168 Benchmark]: Boogie Preprocessor took 33.09 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 09:20:19,964 INFO L168 Benchmark]: RCFGBuilder took 397.95 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:20:19,964 INFO L168 Benchmark]: TraceAbstraction took 17903.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:20:19,964 INFO L168 Benchmark]: Witness Printer took 423.09 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:20:19,966 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.19 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 467.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.12 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: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.09 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 397.95 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17903.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 423.09 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1021] EXPR end->colour VAL [end={36:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next VAL [end={36:0}, end->next={33:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1031] EXPR end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={34:0}, end->colour=0, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1038] EXPR end->colour VAL [end={36:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, malloc(sizeof(struct TSLL))={36:0}, null={33:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 7 error locations. UNSAFE Result, 17.8s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 448 SDtfs, 736 SDslu, 2021 SDs, 0 SdLazy, 1683 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 165 SyntacticMatches, 9 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=13, 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, 13 MinimizatonAttempts, 131 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 492 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 438 ConstructedInterpolants, 59 QuantifiedInterpolants, 542113 SizeOfPredicates, 84 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 11/60 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...