./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/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 e5083763cd1026dac92f37bc5a05779baf01a71b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 11:51:38,646 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:51:38,647 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:51:38,654 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:51:38,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:51:38,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:51:38,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:51:38,656 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:51:38,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:51:38,658 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:51:38,659 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:51:38,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:51:38,660 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:51:38,660 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:51:38,661 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:51:38,662 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:51:38,662 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:51:38,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:51:38,664 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:51:38,665 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:51:38,666 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:51:38,667 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:51:38,668 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:51:38,668 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:51:38,669 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:51:38,669 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:51:38,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:51:38,670 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:51:38,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:51:38,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:51:38,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:51:38,672 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:51:38,672 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:51:38,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:51:38,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:51:38,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:51:38,674 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 11:51:38,682 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:51:38,682 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:51:38,683 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:51:38,683 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:51:38,683 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:51:38,683 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:51:38,684 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:51:38,684 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:51:38,684 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:51:38,684 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:51:38,684 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:51:38,684 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:51:38,684 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:51:38,684 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:51:38,685 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:51:38,685 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:51:38,685 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:51:38,685 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:51:38,685 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:51:38,685 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:51:38,685 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:51:38,685 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:51:38,686 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:51:38,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:51:38,686 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:51:38,686 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:51:38,686 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:51:38,686 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:51:38,686 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:51:38,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:51:38,687 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_9f086031-a388-4c51-8c3f-7bab9c6ad5da/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 -> e5083763cd1026dac92f37bc5a05779baf01a71b [2018-11-23 11:51:38,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:51:38,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:51:38,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:51:38,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:51:38,721 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:51:38,721 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:51:38,755 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/data/af2a7b006/581ad983bf2a4c5eb42858ccb9ff43bf/FLAGe4c0d3c70 [2018-11-23 11:51:39,187 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:51:39,188 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:51:39,194 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/data/af2a7b006/581ad983bf2a4c5eb42858ccb9ff43bf/FLAGe4c0d3c70 [2018-11-23 11:51:39,202 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/data/af2a7b006/581ad983bf2a4c5eb42858ccb9ff43bf [2018-11-23 11:51:39,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:51:39,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:51:39,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:39,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:51:39,208 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:51:39,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,210 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 11:51:39, skipping insertion in model container [2018-11-23 11:51:39,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:51:39,244 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:51:39,432 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:39,438 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:51:39,511 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:51:39,534 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:51:39,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39 WrapperNode [2018-11-23 11:51:39,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:51:39,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:39,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:51:39,535 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:51:39,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:51:39,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:51:39,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:51:39,557 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:51:39,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (1/1) ... [2018-11-23 11:51:39,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:51:39,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:51:39,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:51:39,589 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:51:39,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/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 11:51:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:51:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:51:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 11:51:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:51:39,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:51:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:51:39,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:51:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:51:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:51:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:51:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:51:39,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:51:39,999 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:51:39,999 INFO L280 CfgBuilder]: Removed 31 assue(true) statements. [2018-11-23 11:51:40,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:39 BoogieIcfgContainer [2018-11-23 11:51:40,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:51:40,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:51:40,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:51:40,002 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:51:40,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:51:39" (1/3) ... [2018-11-23 11:51:40,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc90bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:40, skipping insertion in model container [2018-11-23 11:51:40,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:51:39" (2/3) ... [2018-11-23 11:51:40,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc90bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:51:40, skipping insertion in model container [2018-11-23 11:51:40,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:39" (3/3) ... [2018-11-23 11:51:40,005 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:51:40,010 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:51:40,015 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-11-23 11:51:40,024 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-11-23 11:51:40,042 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:51:40,043 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:51:40,043 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:51:40,043 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:51:40,043 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:51:40,043 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:51:40,043 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:51:40,043 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:51:40,043 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:51:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-11-23 11:51:40,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 11:51:40,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:40,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:40,063 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:40,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:40,068 INFO L82 PathProgramCache]: Analyzing trace with hash 786723767, now seen corresponding path program 1 times [2018-11-23 11:51:40,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:40,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:40,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:40,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:40,157 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 11:51:40,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:40,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:51:40,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:51:40,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:51:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:51:40,169 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2018-11-23 11:51:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:40,189 INFO L93 Difference]: Finished difference Result 174 states and 284 transitions. [2018-11-23 11:51:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:51:40,190 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-23 11:51:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:40,199 INFO L225 Difference]: With dead ends: 174 [2018-11-23 11:51:40,200 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 11:51:40,202 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 11:51:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 11:51:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-23 11:51:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 11:51:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-23 11:51:40,226 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 9 [2018-11-23 11:51:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:40,226 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-23 11:51:40,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:51:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-23 11:51:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:51:40,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:40,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:40,227 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:40,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:40,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1383122703, now seen corresponding path program 1 times [2018-11-23 11:51:40,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:40,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:40,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:40,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:40,273 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 11:51:40,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:40,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:40,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:40,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:40,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:40,276 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 3 states. [2018-11-23 11:51:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:40,304 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-11-23 11:51:40,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:40,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:51:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:40,306 INFO L225 Difference]: With dead ends: 84 [2018-11-23 11:51:40,306 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:51:40,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:51:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-23 11:51:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 11:51:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-11-23 11:51:40,310 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2018-11-23 11:51:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:40,311 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-23 11:51:40,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-23 11:51:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:51:40,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:40,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:40,312 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:40,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:40,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1313288485, now seen corresponding path program 1 times [2018-11-23 11:51:40,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:40,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:40,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:40,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:40,344 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 11:51:40,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:40,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:40,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:40,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:40,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:40,345 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 3 states. [2018-11-23 11:51:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:40,374 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-23 11:51:40,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:40,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:51:40,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:40,375 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:51:40,375 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:51:40,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:51:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 11:51:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:51:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-11-23 11:51:40,379 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 13 [2018-11-23 11:51:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:40,379 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-11-23 11:51:40,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-23 11:51:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:51:40,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:40,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:40,380 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:40,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:40,381 INFO L82 PathProgramCache]: Analyzing trace with hash -577581690, now seen corresponding path program 1 times [2018-11-23 11:51:40,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:40,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:40,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:40,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:40,407 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 11:51:40,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:40,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:40,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:40,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:40,408 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2018-11-23 11:51:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:40,433 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2018-11-23 11:51:40,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:40,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 11:51:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:40,434 INFO L225 Difference]: With dead ends: 157 [2018-11-23 11:51:40,434 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:51:40,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:51:40,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2018-11-23 11:51:40,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 11:51:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-23 11:51:40,441 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 16 [2018-11-23 11:51:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:40,442 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-23 11:51:40,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-23 11:51:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:51:40,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:40,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:40,443 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:40,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:40,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1346327205, now seen corresponding path program 1 times [2018-11-23 11:51:40,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:40,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:40,468 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 11:51:40,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:40,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:40,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:40,469 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2018-11-23 11:51:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:40,481 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-23 11:51:40,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:40,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 11:51:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:40,482 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:51:40,482 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 11:51:40,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 11:51:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 11:51:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 11:51:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-11-23 11:51:40,485 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 21 [2018-11-23 11:51:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:40,486 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-11-23 11:51:40,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-23 11:51:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:51:40,486 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:40,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:40,487 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:40,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:40,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1346325283, now seen corresponding path program 1 times [2018-11-23 11:51:40,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:40,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:40,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:40,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:40,516 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 11:51:40,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:40,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:51:40,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:51:40,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:51:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:51:40,517 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 4 states. [2018-11-23 11:51:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:40,569 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2018-11-23 11:51:40,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:51:40,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 11:51:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:40,570 INFO L225 Difference]: With dead ends: 101 [2018-11-23 11:51:40,570 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 11:51:40,571 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 11:51:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 11:51:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 11:51:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:51:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-11-23 11:51:40,579 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2018-11-23 11:51:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:40,580 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-11-23 11:51:40,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:51:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-23 11:51:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:51:40,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:40,580 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] [2018-11-23 11:51:40,581 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:40,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2021783647, now seen corresponding path program 1 times [2018-11-23 11:51:40,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:40,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:40,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:40,654 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 11:51:40,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:40,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/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 11:51:40,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:40,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:40,727 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 6 treesize of output 5 [2018-11-23 11:51:40,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 11:51:40,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:40,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:40,773 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:51:40,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,797 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 27 treesize of output 20 [2018-11-23 11:51:40,802 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 8 treesize of output 7 [2018-11-23 11:51:40,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,813 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 19 treesize of output 20 [2018-11-23 11:51:40,815 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 11:51:40,815 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,819 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,822 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 11:51:40,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,828 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2018-11-23 11:51:40,854 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 59 treesize of output 49 [2018-11-23 11:51:40,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:40,869 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 30 treesize of output 18 [2018-11-23 11:51:40,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:40,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2018-11-23 11:51:40,919 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 35 treesize of output 23 [2018-11-23 11:51:40,921 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 18 treesize of output 9 [2018-11-23 11:51:40,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,934 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 11:51:40,934 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:40,939 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 11:51:40,939 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2018-11-23 11:51:40,943 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 11:51:40,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:40,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-23 11:51:40,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:51:40,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:51:40,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:51:40,968 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 8 states. [2018-11-23 11:51:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:41,143 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2018-11-23 11:51:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:51:41,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 11:51:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:41,145 INFO L225 Difference]: With dead ends: 151 [2018-11-23 11:51:41,145 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:51:41,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:51:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:51:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 89. [2018-11-23 11:51:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 11:51:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-11-23 11:51:41,151 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 23 [2018-11-23 11:51:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:41,151 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-11-23 11:51:41,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:51:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-11-23 11:51:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:51:41,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:41,152 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] [2018-11-23 11:51:41,153 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:41,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:41,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2066926113, now seen corresponding path program 1 times [2018-11-23 11:51:41,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:41,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:41,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:41,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:41,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:41,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:41,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:41,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:41,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:41,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:41,178 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 3 states. [2018-11-23 11:51:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:41,212 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2018-11-23 11:51:41,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:41,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 11:51:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:41,214 INFO L225 Difference]: With dead ends: 181 [2018-11-23 11:51:41,214 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 11:51:41,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 11:51:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-11-23 11:51:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:51:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-11-23 11:51:41,221 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 24 [2018-11-23 11:51:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:41,222 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-11-23 11:51:41,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-11-23 11:51:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:51:41,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:41,223 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:41,223 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:41,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1129078447, now seen corresponding path program 1 times [2018-11-23 11:51:41,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:41,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:41,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:51:41,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:41,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:41,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:41,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:41,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:41,264 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 3 states. [2018-11-23 11:51:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:41,295 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2018-11-23 11:51:41,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:41,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 11:51:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:41,297 INFO L225 Difference]: With dead ends: 179 [2018-11-23 11:51:41,297 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 11:51:41,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 11:51:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2018-11-23 11:51:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 11:51:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-11-23 11:51:41,301 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 31 [2018-11-23 11:51:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:41,301 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-11-23 11:51:41,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-23 11:51:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:51:41,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:41,305 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:41,306 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:41,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash -323983759, now seen corresponding path program 1 times [2018-11-23 11:51:41,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:41,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:41,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:41,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:41,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:41,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:41,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/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 11:51:41,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:41,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:41,453 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 6 treesize of output 5 [2018-11-23 11:51:41,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 11:51:41,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:41,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:41,470 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 17 treesize of output 21 [2018-11-23 11:51:41,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,490 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 27 treesize of output 20 [2018-11-23 11:51:41,493 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 8 treesize of output 7 [2018-11-23 11:51:41,493 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,503 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 19 treesize of output 20 [2018-11-23 11:51:41,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:51:41,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,515 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 11:51:41,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,525 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-11-23 11:51:41,553 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 34 treesize of output 33 [2018-11-23 11:51:41,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:41,557 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 22 treesize of output 14 [2018-11-23 11:51:41,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-11-23 11:51:41,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:41,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:41,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:41,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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 11:51:41,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,612 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 79 treesize of output 56 [2018-11-23 11:51:41,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 11 [2018-11-23 11:51:41,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 47 treesize of output 51 [2018-11-23 11:51:41,655 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 11:51:41,656 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,699 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 11:51:41,715 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 11:51:41,715 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:90, output treesize:47 [2018-11-23 11:51:41,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 103 treesize of output 76 [2018-11-23 11:51:41,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:41,747 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 38 treesize of output 22 [2018-11-23 11:51:41,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,767 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 11:51:41,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2018-11-23 11:51:41,803 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2018-11-23 11:51:41,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-23 11:51:41,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,815 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 11:51:41,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,822 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:51:41,822 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:41,828 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 11:51:41,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2018-11-23 11:51:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:41,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:41,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-11-23 11:51:41,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:41,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:41,861 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 12 states. [2018-11-23 11:51:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:42,162 INFO L93 Difference]: Finished difference Result 165 states and 181 transitions. [2018-11-23 11:51:42,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:51:42,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-23 11:51:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:42,164 INFO L225 Difference]: With dead ends: 165 [2018-11-23 11:51:42,164 INFO L226 Difference]: Without dead ends: 163 [2018-11-23 11:51:42,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:51:42,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-23 11:51:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 85. [2018-11-23 11:51:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 11:51:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-11-23 11:51:42,170 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 32 [2018-11-23 11:51:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:42,170 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-11-23 11:51:42,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:51:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-11-23 11:51:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:51:42,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:42,173 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:42,173 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:42,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:42,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1584673033, now seen corresponding path program 1 times [2018-11-23 11:51:42,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:42,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:42,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:42,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:42,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:42,395 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 11:51:42,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:42,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/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 11:51:42,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:42,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:42,430 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 6 treesize of output 5 [2018-11-23 11:51:42,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 11:51:42,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:42,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:42,464 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 11:51:42,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,480 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 27 treesize of output 20 [2018-11-23 11:51:42,482 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 11:51:42,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,493 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 19 treesize of output 20 [2018-11-23 11:51:42,496 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 11 [2018-11-23 11:51:42,497 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,502 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,506 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 11:51:42,516 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 27 treesize of output 20 [2018-11-23 11:51:42,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, 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 11:51:42,519 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,526 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 19 treesize of output 20 [2018-11-23 11:51:42,528 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 11 [2018-11-23 11:51:42,528 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,532 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,536 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 11:51:42,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,543 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-11-23 11:51:42,562 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 19 treesize of output 12 [2018-11-23 11:51:42,564 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 11:51:42,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,582 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 65 treesize of output 60 [2018-11-23 11:51:42,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:42,587 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 30 treesize of output 24 [2018-11-23 11:51:42,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,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 77 treesize of output 67 [2018-11-23 11:51:42,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:42,646 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 30 treesize of output 24 [2018-11-23 11:51:42,647 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,653 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,659 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:57 [2018-11-23 11:51:42,681 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 57 treesize of output 43 [2018-11-23 11:51:42,684 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 34 treesize of output 23 [2018-11-23 11:51:42,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,690 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 9 treesize of output 7 [2018-11-23 11:51:42,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,703 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 26 treesize of output 22 [2018-11-23 11:51:42,705 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 5 [2018-11-23 11:51:42,705 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,710 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 11:51:42,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,712 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:42,715 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 11:51:42,716 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:11 [2018-11-23 11:51:42,733 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 11:51:42,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:42,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2018-11-23 11:51:42,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:51:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:51:42,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:51:42,749 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 14 states. [2018-11-23 11:51:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:43,074 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-11-23 11:51:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:43,074 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-23 11:51:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:43,075 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:51:43,075 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 11:51:43,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:51:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 11:51:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2018-11-23 11:51:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 11:51:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-11-23 11:51:43,081 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 33 [2018-11-23 11:51:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:43,081 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-11-23 11:51:43,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:51:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-11-23 11:51:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:51:43,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:43,082 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:43,082 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:43,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1808152883, now seen corresponding path program 1 times [2018-11-23 11:51:43,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:43,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:43,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:43,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:43,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:51:43,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:43,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:43,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:43,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:43,104 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 3 states. [2018-11-23 11:51:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:43,134 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2018-11-23 11:51:43,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:43,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 11:51:43,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:43,135 INFO L225 Difference]: With dead ends: 152 [2018-11-23 11:51:43,136 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 11:51:43,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 11:51:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-11-23 11:51:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:51:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-11-23 11:51:43,142 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 33 [2018-11-23 11:51:43,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:43,142 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-11-23 11:51:43,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-11-23 11:51:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:51:43,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:43,143 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 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] [2018-11-23 11:51:43,143 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:43,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:43,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1004579722, now seen corresponding path program 1 times [2018-11-23 11:51:43,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:43,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:43,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:43,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:43,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:43,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:43,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/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 11:51:43,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:43,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:43,285 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 6 treesize of output 5 [2018-11-23 11:51:43,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 11:51:43,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:43,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:43,321 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 11:51:43,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,354 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 27 treesize of output 20 [2018-11-23 11:51:43,357 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 11:51:43,358 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,373 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 19 treesize of output 20 [2018-11-23 11:51:43,378 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 11 [2018-11-23 11:51:43,378 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,385 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,391 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 11:51:43,409 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 27 treesize of output 20 [2018-11-23 11:51:43,411 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 11:51:43,411 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,422 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 19 treesize of output 20 [2018-11-23 11:51:43,424 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 11 [2018-11-23 11:51:43,425 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,433 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,436 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 11:51:43,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,446 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-23 11:51:43,481 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 38 treesize of output 37 [2018-11-23 11:51:43,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:43,486 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 26 treesize of output 22 [2018-11-23 11:51:43,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,514 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 49 treesize of output 52 [2018-11-23 11:51:43,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:43,521 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 30 treesize of output 45 [2018-11-23 11:51:43,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:58 [2018-11-23 11:51:43,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:43,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:43,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:43,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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 11:51:43,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:43,596 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 133 treesize of output 116 [2018-11-23 11:51:43,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-11-23 11:51:43,599 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 101 treesize of output 105 [2018-11-23 11:51:43,622 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 11:51:43,623 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,632 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,640 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 11:51:43,659 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 81 treesize of output 63 [2018-11-23 11:51:43,662 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 22 treesize of output 23 [2018-11-23 11:51:43,663 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-11-23 11:51:43,684 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 11:51:43,685 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,712 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,721 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 11:51:43,733 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 11:51:43,733 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:155, output treesize:61 [2018-11-23 11:51:43,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 209 treesize of output 154 [2018-11-23 11:51:43,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:43,773 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 46 treesize of output 26 [2018-11-23 11:51:43,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,803 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 153 treesize of output 127 [2018-11-23 11:51:43,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:43,808 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 46 treesize of output 26 [2018-11-23 11:51:43,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,822 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 11:51:43,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:216, output treesize:106 [2018-11-23 11:51:43,857 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 71 [2018-11-23 11:51:43,859 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 11:51:43,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,869 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:51:43,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,875 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 43 treesize of output 16 [2018-11-23 11:51:43,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,886 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 15 treesize of output 15 [2018-11-23 11:51:43,888 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 11:51:43,888 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,891 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 11:51:43,892 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,892 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:43,895 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:121, output treesize:4 [2018-11-23 11:51:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:43,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:43,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-11-23 11:51:43,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:51:43,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:51:43,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:51:43,921 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 12 states. [2018-11-23 11:51:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:44,161 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-23 11:51:44,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:51:44,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-23 11:51:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:44,163 INFO L225 Difference]: With dead ends: 128 [2018-11-23 11:51:44,163 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 11:51:44,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:51:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 11:51:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-11-23 11:51:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 11:51:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-11-23 11:51:44,170 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 35 [2018-11-23 11:51:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:44,170 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-11-23 11:51:44,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:51:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-11-23 11:51:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:51:44,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:44,171 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1] [2018-11-23 11:51:44,171 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:44,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:44,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1088300863, now seen corresponding path program 1 times [2018-11-23 11:51:44,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:44,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:44,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:44,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:44,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:51:44,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:44,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:51:44,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:51:44,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:51:44,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:51:44,198 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 4 states. [2018-11-23 11:51:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:44,244 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2018-11-23 11:51:44,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:51:44,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 11:51:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:44,246 INFO L225 Difference]: With dead ends: 131 [2018-11-23 11:51:44,246 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 11:51:44,246 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 11:51:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 11:51:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-11-23 11:51:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 11:51:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2018-11-23 11:51:44,255 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 41 [2018-11-23 11:51:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:44,255 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2018-11-23 11:51:44,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:51:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2018-11-23 11:51:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:51:44,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:44,256 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2018-11-23 11:51:44,256 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:44,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash -387236285, now seen corresponding path program 1 times [2018-11-23 11:51:44,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:44,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:44,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:44,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:44,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:44,389 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/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 11:51:44,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:44,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:44,412 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 6 treesize of output 5 [2018-11-23 11:51:44,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 11:51:44,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:44,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:44,421 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 11:51:44,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,433 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 27 treesize of output 20 [2018-11-23 11:51:44,435 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 11:51:44,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,443 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 19 treesize of output 20 [2018-11-23 11:51:44,445 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 11:51:44,445 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,452 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 11:51:44,460 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 27 treesize of output 20 [2018-11-23 11:51:44,461 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 11:51:44,461 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,467 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 19 treesize of output 24 [2018-11-23 11:51:44,468 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 15 [2018-11-23 11:51:44,468 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,472 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,474 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 11:51:44,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,480 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-11-23 11:51:44,494 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 89 treesize of output 79 [2018-11-23 11:51:44,496 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 26 treesize of output 11 [2018-11-23 11:51:44,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,510 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 50 treesize of output 45 [2018-11-23 11:51:44,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:44,513 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 30 treesize of output 24 [2018-11-23 11:51:44,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,521 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:42 [2018-11-23 11:51:44,551 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 65 treesize of output 52 [2018-11-23 11:51:44,553 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 33 treesize of output 27 [2018-11-23 11:51:44,554 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:44,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-11-23 11:51:44,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,565 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 11:51:44,572 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 11:51:44,574 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 11 [2018-11-23 11:51:44,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,582 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 16 treesize of output 7 [2018-11-23 11:51:44,582 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,585 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,588 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 11:51:44,588 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:72, output treesize:7 [2018-11-23 11:51:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:44,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:44,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-11-23 11:51:44,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:51:44,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:51:44,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:51:44,610 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 14 states. [2018-11-23 11:51:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:44,780 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-11-23 11:51:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:51:44,780 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-11-23 11:51:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:44,781 INFO L225 Difference]: With dead ends: 139 [2018-11-23 11:51:44,781 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 11:51:44,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:51:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 11:51:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-23 11:51:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 11:51:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-11-23 11:51:44,786 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 41 [2018-11-23 11:51:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:44,786 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-11-23 11:51:44,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:51:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-11-23 11:51:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:51:44,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:44,787 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:51:44,787 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:44,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:44,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1997813481, now seen corresponding path program 1 times [2018-11-23 11:51:44,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:44,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:44,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:44,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:44,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:44,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:44,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/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 11:51:44,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:44,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:44,936 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 6 treesize of output 5 [2018-11-23 11:51:44,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 11:51:44,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:44,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:44,947 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 17 treesize of output 21 [2018-11-23 11:51:44,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,958 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 27 treesize of output 20 [2018-11-23 11:51:44,960 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 8 treesize of output 7 [2018-11-23 11:51:44,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,967 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 19 treesize of output 20 [2018-11-23 11:51:44,968 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 11:51:44,969 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,975 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 11:51:44,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:44,981 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-11-23 11:51:44,999 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 34 treesize of output 33 [2018-11-23 11:51:45,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:45,002 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 22 treesize of output 14 [2018-11-23 11:51:45,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-11-23 11:51:45,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:45,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:45,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:45,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-11-23 11:51:45,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,065 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 88 treesize of output 65 [2018-11-23 11:51:45,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 11 [2018-11-23 11:51:45,069 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 56 treesize of output 60 [2018-11-23 11:51:45,112 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 11:51:45,112 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,139 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 11:51:45,156 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 11:51:45,156 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:96, output treesize:66 [2018-11-23 11:51:45,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 71 treesize of output 73 [2018-11-23 11:51:45,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:45,233 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 22 treesize of output 14 [2018-11-23 11:51:45,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:45,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:66 [2018-11-23 11:51:45,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:45,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:45,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:45,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:45,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-23 11:51:45,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 91 [2018-11-23 11:51:45,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-23 11:51:45,319 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 86 [2018-11-23 11:51:45,358 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 11:51:45,358 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,369 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,379 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 11:51:45,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:45,391 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:151, output treesize:91 [2018-11-23 11:51:45,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 115 [2018-11-23 11:51:45,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:45,430 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 46 treesize of output 26 [2018-11-23 11:51:45,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:45,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:179, output treesize:124 [2018-11-23 11:51:45,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 69 [2018-11-23 11:51:45,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-23 11:51:45,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,495 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 11:51:45,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-23 11:51:45,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,519 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:51:45,519 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:45,524 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2018-11-23 11:51:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:45,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:45,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-11-23 11:51:45,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:51:45,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:51:45,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:51:45,566 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 14 states. [2018-11-23 11:51:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:45,938 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2018-11-23 11:51:45,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:51:45,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-11-23 11:51:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:45,940 INFO L225 Difference]: With dead ends: 175 [2018-11-23 11:51:45,940 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 11:51:45,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:51:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 11:51:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 91. [2018-11-23 11:51:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 11:51:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-11-23 11:51:45,946 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 42 [2018-11-23 11:51:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:45,946 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-11-23 11:51:45,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:51:45,947 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-11-23 11:51:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:51:45,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:45,947 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1] [2018-11-23 11:51:45,947 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:45,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1874896500, now seen corresponding path program 1 times [2018-11-23 11:51:45,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:45,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:45,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:45,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:45,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:46,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:46,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:46,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:46,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:46,254 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 6 treesize of output 5 [2018-11-23 11:51:46,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 11:51:46,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:46,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:46,274 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 11:51:46,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,293 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 27 treesize of output 20 [2018-11-23 11:51:46,295 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 11:51:46,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,305 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 19 treesize of output 20 [2018-11-23 11:51:46,307 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 11:51:46,307 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,312 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,315 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 11:51:46,328 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 27 treesize of output 20 [2018-11-23 11:51:46,330 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 11:51:46,330 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,336 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 19 treesize of output 24 [2018-11-23 11:51:46,338 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 15 [2018-11-23 11:51:46,339 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,343 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,346 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 11:51:46,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,355 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-23 11:51:46,379 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 49 treesize of output 48 [2018-11-23 11:51:46,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:46,383 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 22 treesize of output 18 [2018-11-23 11:51:46,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,410 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 53 treesize of output 59 [2018-11-23 11:51:46,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:46,416 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 30 treesize of output 45 [2018-11-23 11:51:46,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,436 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 13 treesize of output 14 [2018-11-23 11:51:46,438 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 11:51:46,438 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,440 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,450 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:71 [2018-11-23 11:51:46,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:46,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:46,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:46,481 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 11:51:46,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,521 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 171 treesize of output 148 [2018-11-23 11:51:46,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 23 [2018-11-23 11:51:46,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,565 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 139 treesize of output 143 [2018-11-23 11:51:46,567 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 11:51:46,567 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,584 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,601 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 11:51:46,626 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 39 treesize of output 26 [2018-11-23 11:51:46,629 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 26 treesize of output 11 [2018-11-23 11:51:46,629 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,631 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,653 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 81 treesize of output 63 [2018-11-23 11:51:46,656 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 22 treesize of output 23 [2018-11-23 11:51:46,656 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,676 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-11-23 11:51:46,678 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 11:51:46,678 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,686 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,692 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 11:51:46,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-23 11:51:46,710 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 24 treesize of output 23 [2018-11-23 11:51:46,710 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,714 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,724 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:204, output treesize:68 [2018-11-23 11:51:46,774 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 241 treesize of output 182 [2018-11-23 11:51:46,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:46,780 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 46 treesize of output 26 [2018-11-23 11:51:46,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,826 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 174 treesize of output 148 [2018-11-23 11:51:46,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:46,830 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 46 treesize of output 26 [2018-11-23 11:51:46,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,859 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2018-11-23 11:51:46,861 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 11:51:46,861 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,865 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:46,875 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:248, output treesize:122 [2018-11-23 11:51:46,921 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 85 [2018-11-23 11:51:46,923 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 33 treesize of output 22 [2018-11-23 11:51:46,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,937 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2018-11-23 11:51:46,937 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 11:51:46,948 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 11:51:46,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:46,971 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 11:51:46,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 20 [2018-11-23 11:51:46,996 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 11:51:46,997 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,001 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 11:51:47,002 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,003 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:47,009 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:136, output treesize:24 [2018-11-23 11:51:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:47,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:47,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-23 11:51:47,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:51:47,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:51:47,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2018-11-23 11:51:47,056 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 16 states. [2018-11-23 11:51:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:47,598 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-11-23 11:51:47,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:51:47,598 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-23 11:51:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:47,599 INFO L225 Difference]: With dead ends: 116 [2018-11-23 11:51:47,599 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 11:51:47,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=502, Unknown=1, NotChecked=0, Total=600 [2018-11-23 11:51:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 11:51:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2018-11-23 11:51:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 11:51:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-11-23 11:51:47,605 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 44 [2018-11-23 11:51:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:47,605 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-11-23 11:51:47,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:51:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-11-23 11:51:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:51:47,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:47,605 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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 11:51:47,606 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:47,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1415179328, now seen corresponding path program 1 times [2018-11-23 11:51:47,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:47,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:47,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:47,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 11:51:47,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:51:47,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:51:47,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:51:47,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:51:47,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:47,623 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 3 states. [2018-11-23 11:51:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:47,640 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-23 11:51:47,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:51:47,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-23 11:51:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:47,642 INFO L225 Difference]: With dead ends: 125 [2018-11-23 11:51:47,642 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 11:51:47,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:51:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 11:51:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2018-11-23 11:51:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 11:51:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-11-23 11:51:47,648 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-11-23 11:51:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:47,648 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-11-23 11:51:47,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:51:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 11:51:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:51:47,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:47,649 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2018-11-23 11:51:47,649 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:47,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1495461684, now seen corresponding path program 1 times [2018-11-23 11:51:47,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:47,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:47,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:47,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:47,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:47,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:47,869 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 6 treesize of output 5 [2018-11-23 11:51:47,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 11:51:47,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:47,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:47,912 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 11:51:47,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,928 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 27 treesize of output 20 [2018-11-23 11:51:47,931 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 11:51:47,931 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,940 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 19 treesize of output 20 [2018-11-23 11:51:47,942 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 11 [2018-11-23 11:51:47,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,946 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,950 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 11:51:47,962 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 27 treesize of output 20 [2018-11-23 11:51:47,964 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 11:51:47,964 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,971 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 19 treesize of output 20 [2018-11-23 11:51:47,973 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 11 [2018-11-23 11:51:47,973 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,977 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,983 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 11:51:47,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:47,990 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-23 11:51:48,011 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 49 treesize of output 52 [2018-11-23 11:51:48,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,015 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 30 treesize of output 45 [2018-11-23 11:51:48,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,037 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 53 treesize of output 52 [2018-11-23 11:51:48,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,040 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 26 treesize of output 22 [2018-11-23 11:51:48,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:61 [2018-11-23 11:51:48,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-11-23 11:51:48,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,114 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 140 treesize of output 118 [2018-11-23 11:51:48,119 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 26 treesize of output 23 [2018-11-23 11:51:48,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 117 [2018-11-23 11:51:48,143 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 11:51:48,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,154 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,162 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 11:51:48,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,185 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 107 treesize of output 90 [2018-11-23 11:51:48,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-11-23 11:51:48,188 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 67 treesize of output 71 [2018-11-23 11:51:48,208 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 11:51:48,209 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,218 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,225 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 11:51:48,241 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 11:51:48,241 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:180, output treesize:83 [2018-11-23 11:51:48,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-11-23 11:51:48,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,297 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 22 treesize of output 14 [2018-11-23 11:51:48,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 67 treesize of output 69 [2018-11-23 11:51:48,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,331 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 22 treesize of output 14 [2018-11-23 11:51:48,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:118, output treesize:80 [2018-11-23 11:51:48,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-11-23 11:51:48,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 185 [2018-11-23 11:51:48,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-23 11:51:48,405 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 180 [2018-11-23 11:51:48,437 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 11:51:48,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,464 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 11:51:48,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 134 [2018-11-23 11:51:48,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, 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 19 [2018-11-23 11:51:48,489 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 125 treesize of output 129 [2018-11-23 11:51:48,506 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 11:51:48,507 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,518 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,529 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 11:51:48,542 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 11:51:48,543 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:292, output treesize:129 [2018-11-23 11:51:48,575 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 316 treesize of output 282 [2018-11-23 11:51:48,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,579 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 54 treesize of output 30 [2018-11-23 11:51:48,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 146 [2018-11-23 11:51:48,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:48,628 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 54 treesize of output 30 [2018-11-23 11:51:48,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:48,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:324, output treesize:190 [2018-11-23 11:51:48,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 98 [2018-11-23 11:51:48,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-23 11:51:48,702 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:48,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2018-11-23 11:51:48,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:51:48,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,746 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 11:51:48,746 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:48,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 15 [2018-11-23 11:51:48,766 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 11:51:48,766 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,771 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 11:51:48,771 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,773 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:48,781 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:205, output treesize:4 [2018-11-23 11:51:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:48,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:48,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-11-23 11:51:48,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:51:48,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:51:48,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:51:48,807 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 19 states. [2018-11-23 11:51:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:49,571 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2018-11-23 11:51:49,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:51:49,572 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-23 11:51:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:49,573 INFO L225 Difference]: With dead ends: 181 [2018-11-23 11:51:49,573 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 11:51:49,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:51:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 11:51:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 118. [2018-11-23 11:51:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 11:51:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-11-23 11:51:49,587 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 45 [2018-11-23 11:51:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:49,587 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-11-23 11:51:49,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:51:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-23 11:51:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:51:49,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:49,588 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2018-11-23 11:51:49,588 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:49,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:49,589 INFO L82 PathProgramCache]: Analyzing trace with hash 400881353, now seen corresponding path program 1 times [2018-11-23 11:51:49,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:49,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:49,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:51:49,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:51:49,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:51:49,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:51:49,954 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 6 treesize of output 5 [2018-11-23 11:51:49,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:49,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:49,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 11:51:50,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,012 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 11:51:50,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,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, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 11:51:50,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 8 treesize of output 7 [2018-11-23 11:51:50,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,112 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 19 treesize of output 20 [2018-11-23 11:51:50,115 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 11 [2018-11-23 11:51:50,115 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,130 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 11:51:50,151 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 27 treesize of output 20 [2018-11-23 11:51:50,154 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 11:51:50,154 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,165 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 19 treesize of output 20 [2018-11-23 11:51:50,169 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 11 [2018-11-23 11:51:50,169 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,175 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,188 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 11:51:50,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,210 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-23 11:51:50,251 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 38 treesize of output 37 [2018-11-23 11:51:50,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,257 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 26 treesize of output 22 [2018-11-23 11:51:50,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,286 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 49 treesize of output 52 [2018-11-23 11:51:50,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,292 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 30 treesize of output 45 [2018-11-23 11:51:50,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,314 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:61 [2018-11-23 11:51:50,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,358 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 26 treesize of output 46 [2018-11-23 11:51:50,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,394 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 142 treesize of output 119 [2018-11-23 11:51:50,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 23 [2018-11-23 11:51:50,398 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,417 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 110 treesize of output 114 [2018-11-23 11:51:50,420 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 11:51:50,420 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,444 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 11:51:50,466 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:51:50,467 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 81 treesize of output 68 [2018-11-23 11:51:50,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-23 11:51:50,469 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,482 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-11-23 11:51:50,484 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 19 [2018-11-23 11:51:50,484 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,493 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,498 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 11:51:50,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,514 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:163, output treesize:109 [2018-11-23 11:51:50,593 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 101 treesize of output 103 [2018-11-23 11:51:50,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,596 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 22 treesize of output 26 [2018-11-23 11:51:50,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,632 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 110 [2018-11-23 11:51:50,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-11-23 11:51:50,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:144, output treesize:118 [2018-11-23 11:51:50,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-11-23 11:51:50,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 215 [2018-11-23 11:51:50,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-11-23 11:51:50,741 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 203 [2018-11-23 11:51:50,782 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 11:51:50,782 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,817 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 11:51:50,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 153 [2018-11-23 11:51:50,851 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 38 treesize of output 47 [2018-11-23 11:51:50,851 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 156 [2018-11-23 11:51:50,880 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 11:51:50,880 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,894 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,903 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 11:51:50,918 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 11:51:50,919 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:307, output treesize:112 [2018-11-23 11:51:50,957 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 289 [2018-11-23 11:51:50,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,961 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 54 treesize of output 30 [2018-11-23 11:51:50,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:50,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:50,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:51,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 165 [2018-11-23 11:51:51,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:51,005 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 54 treesize of output 30 [2018-11-23 11:51:51,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:51,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:51,029 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 11:51:51,030 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:323, output treesize:189 [2018-11-23 11:51:51,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:51,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:51:51,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 126 [2018-11-23 11:51:51,107 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2018-11-23 11:51:51,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:51,118 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-11-23 11:51:51,119 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 11:51:51,129 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 11:51:51,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:51,138 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-23 11:51:51,138 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:51,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:51:51,152 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 26 treesize of output 30 [2018-11-23 11:51:51,154 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 11:51:51,154 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:51,159 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 13 treesize of output 5 [2018-11-23 11:51:51,159 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:51,160 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 11:51:51,161 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:51:51,161 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:51,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:51:51,164 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:220, output treesize:4 [2018-11-23 11:51:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:51:51,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:51:51,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-11-23 11:51:51,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:51:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:51:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:51:51,193 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 19 states. [2018-11-23 11:51:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:51:51,786 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-11-23 11:51:51,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:51:51,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-11-23 11:51:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:51:51,787 INFO L225 Difference]: With dead ends: 156 [2018-11-23 11:51:51,787 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 11:51:51,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:51:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 11:51:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2018-11-23 11:51:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 11:51:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2018-11-23 11:51:51,796 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 48 [2018-11-23 11:51:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:51:51,796 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2018-11-23 11:51:51,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:51:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2018-11-23 11:51:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:51:51,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:51:51,796 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2018-11-23 11:51:51,797 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:51:51,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:51:51,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1643497090, now seen corresponding path program 1 times [2018-11-23 11:51:51,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:51:51,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:51:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:51:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:51:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:51:51,839 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=17, |#NULL.offset|=10, |old(#NULL.base)|=17, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=10] [?] RET #344#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret25 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=23, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=23, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] assume 0 == ~status~0;call write~int(1, ~item~0.base, 4 + ~item~0.offset, 4);~status~0 := 1; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume !(0 == ~status~0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume 1 == ~status~0;call write~int(2, ~item~0.base, 4 + ~item~0.offset, 4);~status~0 := 2; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !(0 == ~status~0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !(1 == ~status~0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume ~status~0 >= 2;call write~int(3, ~item~0.base, 4 + ~item~0.offset, 4);~status~0 := 3; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !(1 == ~status~0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !(2 == ~status~0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume 3 == ~status~0; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0, |main_#t~mem8.base|=26, |main_#t~mem8.offset|=0] [?] assume !!(#t~mem8.base != 0 || #t~mem8.offset != 0);havoc #t~mem8.base, #t~mem8.offset; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0, |main_#t~mem10.base|=21, |main_#t~mem10.offset|=0, |main_#t~mem9.base|=26, |main_#t~mem9.offset|=0] [?] assume !!(#t~mem10.base != 0 || #t~mem10.offset != 0);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem10.base, #t~mem10.offset; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(#t~mem11.base, #t~mem11.offset, 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0, |main_#t~mem11.base|=26, |main_#t~mem11.offset|=0, |main_#t~mem12.base|=21, |main_#t~mem12.offset|=0, |main_#t~mem13.base|=29, |main_#t~mem13.offset|=0] [?] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem15.base, #t~mem15.offset := read~$Pointer$(#t~mem14.base, #t~mem14.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4);call #t~mem17 := read~int(#t~mem16.base, 4 + #t~mem16.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0, |main_#t~mem14.base|=26, |main_#t~mem14.offset|=0, |main_#t~mem15.base|=21, |main_#t~mem15.offset|=0, |main_#t~mem16.base|=29, |main_#t~mem16.offset|=0, |main_#t~mem17|=3] [?] assume !(3 != #t~mem17);havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem14.base, #t~mem14.offset;havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem17; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=10, old(#NULL.base)=17, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L987] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L988] ~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset; [L989] ~status~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=23, ~item~0.offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=23, ~item~0.offset=0, ~status~0=0] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=0] [L997-L1011] assume 0 == ~status~0; [L999] call write~int(1, ~item~0.base, 4 + ~item~0.offset, 4); [L1000] ~status~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=1] [L997-L1011] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=1] [L1002-L1011] assume 1 == ~status~0; [L1004] call write~int(2, ~item~0.base, 4 + ~item~0.offset, 4); [L1005] ~status~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L997-L1011] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L1002-L1011] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L1007-L1011] assume ~status~0 >= 2; [L1009] call write~int(3, ~item~0.base, 4 + ~item~0.offset, 4); [L1010] ~status~0 := 3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L991-L1015] assume !(0 != #t~nondet1); [L991] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1017] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1018-L1022] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1023-L1028] assume !(2 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1029-L1036] assume 3 == ~status~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1031] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1032] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem8.base=26, #t~mem8.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1032] assume !!(#t~mem8.base != 0 || #t~mem8.offset != 0); [L1032] havoc #t~mem8.base, #t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1033] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1033] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem10.base=21, #t~mem10.offset=0, #t~mem9.base=26, #t~mem9.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1033] assume !!(#t~mem10.base != 0 || #t~mem10.offset != 0); [L1033] havoc #t~mem9.base, #t~mem9.offset; [L1033] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1034] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1034] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(#t~mem11.base, #t~mem11.offset, 4); [L1034] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem11.base=26, #t~mem11.offset=0, #t~mem12.base=21, #t~mem12.offset=0, #t~mem13.base=29, #t~mem13.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1034] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0); [L1034] havoc #t~mem11.base, #t~mem11.offset; [L1034] havoc #t~mem12.base, #t~mem12.offset; [L1034] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1035] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(#t~mem14.base, #t~mem14.offset, 4); [L1035] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4); [L1035] call #t~mem17 := read~int(#t~mem16.base, 4 + #t~mem16.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem14.base=26, #t~mem14.offset=0, #t~mem15.base=21, #t~mem15.offset=0, #t~mem16.base=29, #t~mem16.offset=0, #t~mem17=3, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] assume !(3 != #t~mem17); [L1035] havoc #t~mem16.base, #t~mem16.offset; [L1035] havoc #t~mem14.base, #t~mem14.offset; [L1035] havoc #t~mem15.base, #t~mem15.offset; [L1035] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=10, old(#NULL.base)=17, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L987] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L988] ~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset; [L989] ~status~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=23, ~item~0.offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=23, ~item~0.offset=0, ~status~0=0] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=0] [L997-L1011] assume 0 == ~status~0; [L999] call write~int(1, ~item~0.base, 4 + ~item~0.offset, 4); [L1000] ~status~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=1] [L997-L1011] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=1] [L1002-L1011] assume 1 == ~status~0; [L1004] call write~int(2, ~item~0.base, 4 + ~item~0.offset, 4); [L1005] ~status~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L997-L1011] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L1002-L1011] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L1007-L1011] assume ~status~0 >= 2; [L1009] call write~int(3, ~item~0.base, 4 + ~item~0.offset, 4); [L1010] ~status~0 := 3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L991-L1015] assume !(0 != #t~nondet1); [L991] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1017] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1018-L1022] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1023-L1028] assume !(2 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1029-L1036] assume 3 == ~status~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1031] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1032] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem8.base=26, #t~mem8.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1032] assume !!(#t~mem8.base != 0 || #t~mem8.offset != 0); [L1032] havoc #t~mem8.base, #t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1033] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1033] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem10.base=21, #t~mem10.offset=0, #t~mem9.base=26, #t~mem9.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1033] assume !!(#t~mem10.base != 0 || #t~mem10.offset != 0); [L1033] havoc #t~mem9.base, #t~mem9.offset; [L1033] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1034] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1034] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(#t~mem11.base, #t~mem11.offset, 4); [L1034] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem11.base=26, #t~mem11.offset=0, #t~mem12.base=21, #t~mem12.offset=0, #t~mem13.base=29, #t~mem13.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1034] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0); [L1034] havoc #t~mem11.base, #t~mem11.offset; [L1034] havoc #t~mem12.base, #t~mem12.offset; [L1034] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1035] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(#t~mem14.base, #t~mem14.offset, 4); [L1035] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4); [L1035] call #t~mem17 := read~int(#t~mem16.base, 4 + #t~mem16.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem14.base=26, #t~mem14.offset=0, #t~mem15.base=21, #t~mem15.offset=0, #t~mem16.base=29, #t~mem16.offset=0, #t~mem17=3, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] assume !(3 != #t~mem17); [L1035] havoc #t~mem16.base, #t~mem16.offset; [L1035] havoc #t~mem14.base, #t~mem14.offset; [L1035] havoc #t~mem15.base, #t~mem15.offset; [L1035] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=10, old(#NULL!base)=17, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L988] ~item~0 := ~head~0; [L989] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=0] [L997] COND TRUE 0 == ~status~0 [L999] FCALL call write~int(1, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1000] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L1002] COND TRUE 1 == ~status~0 [L1004] FCALL call write~int(2, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1005] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1002] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1007] COND TRUE ~status~0 >= 2 [L1009] FCALL call write~int(3, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1010] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991-L1015] COND TRUE !(0 != #t~nondet1) [L991] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1018] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1023] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1029] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1031] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] FCALL call #t~mem8 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem8!base=26, #t~mem8!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] COND FALSE !(!(#t~mem8 != { base: 0, offset: 0 })) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1033] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem10!base=21, #t~mem10!offset=0, #t~mem9!base=26, #t~mem9!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] COND FALSE !(!(#t~mem10 != { base: 0, offset: 0 })) [L1033] havoc #t~mem9; [L1033] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] FCALL call #t~mem11 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1034] FCALL call #t~mem12 := read~$Pointer$({ base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L1034] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem11!base=26, #t~mem11!offset=0, #t~mem12!base=21, #t~mem12!offset=0, #t~mem13!base=29, #t~mem13!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L1034] havoc #t~mem11; [L1034] havoc #t~mem12; [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem14 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1035] FCALL call #t~mem15 := read~$Pointer$({ base: #t~mem14!base, offset: #t~mem14!offset }, 4); [L1035] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1035] FCALL call #t~mem17 := read~int({ base: #t~mem16!base, offset: 4 + #t~mem16!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem14!base=26, #t~mem14!offset=0, #t~mem15!base=21, #t~mem15!offset=0, #t~mem16!base=29, #t~mem16!offset=0, #t~mem17=3, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] COND TRUE !(3 != #t~mem17) [L1035] havoc #t~mem16; [L1035] havoc #t~mem14; [L1035] havoc #t~mem15; [L1035] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=10, old(#NULL!base)=17, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L988] ~item~0 := ~head~0; [L989] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=0] [L997] COND TRUE 0 == ~status~0 [L999] FCALL call write~int(1, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1000] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L1002] COND TRUE 1 == ~status~0 [L1004] FCALL call write~int(2, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1005] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1002] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1007] COND TRUE ~status~0 >= 2 [L1009] FCALL call write~int(3, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1010] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991-L1015] COND TRUE !(0 != #t~nondet1) [L991] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1018] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1023] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1029] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1031] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] FCALL call #t~mem8 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem8!base=26, #t~mem8!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] COND FALSE !(!(#t~mem8 != { base: 0, offset: 0 })) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1033] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem10!base=21, #t~mem10!offset=0, #t~mem9!base=26, #t~mem9!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] COND FALSE !(!(#t~mem10 != { base: 0, offset: 0 })) [L1033] havoc #t~mem9; [L1033] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] FCALL call #t~mem11 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1034] FCALL call #t~mem12 := read~$Pointer$({ base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L1034] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem11!base=26, #t~mem11!offset=0, #t~mem12!base=21, #t~mem12!offset=0, #t~mem13!base=29, #t~mem13!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L1034] havoc #t~mem11; [L1034] havoc #t~mem12; [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem14 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1035] FCALL call #t~mem15 := read~$Pointer$({ base: #t~mem14!base, offset: #t~mem14!offset }, 4); [L1035] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1035] FCALL call #t~mem17 := read~int({ base: #t~mem16!base, offset: 4 + #t~mem16!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem14!base=26, #t~mem14!offset=0, #t~mem15!base=21, #t~mem15!offset=0, #t~mem16!base=29, #t~mem16!offset=0, #t~mem17=3, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] COND TRUE !(3 != #t~mem17) [L1035] havoc #t~mem16; [L1035] havoc #t~mem14; [L1035] havoc #t~mem15; [L1035] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=10, old(#NULL!base)=17, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L988] ~item~0 := ~head~0; [L989] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=0] [L997] COND TRUE 0 == ~status~0 [L999] FCALL call write~int(1, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1000] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L1002] COND TRUE 1 == ~status~0 [L1004] FCALL call write~int(2, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1005] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1002] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1007] COND TRUE ~status~0 >= 2 [L1009] FCALL call write~int(3, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1010] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991-L1015] COND TRUE !(0 != #t~nondet1) [L991] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1018] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1023] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1029] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1031] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] FCALL call #t~mem8 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem8!base=26, #t~mem8!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] COND FALSE !(!(#t~mem8 != { base: 0, offset: 0 })) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1033] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem10!base=21, #t~mem10!offset=0, #t~mem9!base=26, #t~mem9!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] COND FALSE !(!(#t~mem10 != { base: 0, offset: 0 })) [L1033] havoc #t~mem9; [L1033] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] FCALL call #t~mem11 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1034] FCALL call #t~mem12 := read~$Pointer$({ base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L1034] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem11!base=26, #t~mem11!offset=0, #t~mem12!base=21, #t~mem12!offset=0, #t~mem13!base=29, #t~mem13!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L1034] havoc #t~mem11; [L1034] havoc #t~mem12; [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem14 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1035] FCALL call #t~mem15 := read~$Pointer$({ base: #t~mem14!base, offset: #t~mem14!offset }, 4); [L1035] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1035] FCALL call #t~mem17 := read~int({ base: #t~mem16!base, offset: 4 + #t~mem16!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem14!base=26, #t~mem14!offset=0, #t~mem15!base=21, #t~mem15!offset=0, #t~mem16!base=29, #t~mem16!offset=0, #t~mem17=3, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] COND TRUE !(3 != #t~mem17) [L1035] havoc #t~mem16; [L1035] havoc #t~mem14; [L1035] havoc #t~mem15; [L1035] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=10, old(#NULL!base)=17, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L988] ~item~0 := ~head~0; [L989] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=0] [L997] COND TRUE 0 == ~status~0 [L999] FCALL call write~int(1, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1000] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L1002] COND TRUE 1 == ~status~0 [L1004] FCALL call write~int(2, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1005] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1002] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1007] COND TRUE ~status~0 >= 2 [L1009] FCALL call write~int(3, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1010] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991-L1015] COND TRUE !(0 != #t~nondet1) [L991] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1018] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1023] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1029] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1031] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] FCALL call #t~mem8 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem8!base=26, #t~mem8!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] COND FALSE !(!(#t~mem8 != { base: 0, offset: 0 })) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1033] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem10!base=21, #t~mem10!offset=0, #t~mem9!base=26, #t~mem9!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] COND FALSE !(!(#t~mem10 != { base: 0, offset: 0 })) [L1033] havoc #t~mem9; [L1033] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] FCALL call #t~mem11 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1034] FCALL call #t~mem12 := read~$Pointer$({ base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L1034] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem11!base=26, #t~mem11!offset=0, #t~mem12!base=21, #t~mem12!offset=0, #t~mem13!base=29, #t~mem13!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L1034] havoc #t~mem11; [L1034] havoc #t~mem12; [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem14 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1035] FCALL call #t~mem15 := read~$Pointer$({ base: #t~mem14!base, offset: #t~mem14!offset }, 4); [L1035] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1035] FCALL call #t~mem17 := read~int({ base: #t~mem16!base, offset: 4 + #t~mem16!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem14!base=26, #t~mem14!offset=0, #t~mem15!base=21, #t~mem15!offset=0, #t~mem16!base=29, #t~mem16!offset=0, #t~mem17=3, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] COND TRUE !(3 != #t~mem17) [L1035] havoc #t~mem16; [L1035] havoc #t~mem14; [L1035] havoc #t~mem15; [L1035] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L988] SLL* item = head; [L989] int status = 0; VAL [head={23:0}, item={23:0}, malloc(sizeof(SLL))={23:0}, status=0] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=0] [L997] COND TRUE !status [L999] item->data = 1 [L1000] status = 1 VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=1] [L997] COND FALSE !(!status) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=1] [L1002] COND TRUE status == 1 [L1004] item->data = 2 [L1005] status = 2 VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L997] COND FALSE !(!status) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L1002] COND FALSE !(status == 1) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L1007] COND TRUE status >= 2 [L1009] item->data = 3 [L1010] status = 3 VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1018] COND FALSE !(status == 1) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1023] COND FALSE !(status == 2) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1029] COND TRUE status == 3 VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1031] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1032] EXPR head->next VAL [head={23:0}, head->next={26:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1033] EXPR head->next [L1033] EXPR head->next->next VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1034] EXPR head->next [L1034] EXPR head->next->next [L1034] EXPR head->next->next->next VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, head->next->next->next={29:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1035] EXPR head->next [L1035] EXPR head->next->next [L1035] EXPR head->next->next->next [L1035] EXPR head->next->next->next->data VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, head->next->next->next={29:0}, head->next->next->next->data=3, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] ----- [2018-11-23 11:51:52,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:51:52 BoogieIcfgContainer [2018-11-23 11:51:52,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:51:52,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:51:52,061 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:51:52,061 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:51:52,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:51:39" (3/4) ... [2018-11-23 11:51:52,063 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=17, |#NULL.offset|=10, |old(#NULL.base)|=17, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=10] [?] RET #344#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret25 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset;~status~0 := 0; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=23, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=23, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] assume 0 == ~status~0;call write~int(1, ~item~0.base, 4 + ~item~0.offset, 4);~status~0 := 1; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=26, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=26, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume !(0 == ~status~0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume 1 == ~status~0;call write~int(2, ~item~0.base, 4 + ~item~0.offset, 4);~status~0 := 2; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=21, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=21, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4);~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !(0 == ~status~0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !(1 == ~status~0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume ~status~0 >= 2;call write~int(3, ~item~0.base, 4 + ~item~0.offset, 4);~status~0 := 3; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1);havoc #t~nondet1; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !(1 == ~status~0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !(2 == ~status~0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume 3 == ~status~0; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0, |main_#t~mem8.base|=26, |main_#t~mem8.offset|=0] [?] assume !!(#t~mem8.base != 0 || #t~mem8.offset != 0);havoc #t~mem8.base, #t~mem8.offset; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0, |main_#t~mem10.base|=21, |main_#t~mem10.offset|=0, |main_#t~mem9.base|=26, |main_#t~mem9.offset|=0] [?] assume !!(#t~mem10.base != 0 || #t~mem10.offset != 0);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem10.base, #t~mem10.offset; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(#t~mem11.base, #t~mem11.offset, 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0, |main_#t~mem11.base|=26, |main_#t~mem11.offset|=0, |main_#t~mem12.base|=21, |main_#t~mem12.offset|=0, |main_#t~mem13.base|=29, |main_#t~mem13.offset|=0] [?] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4);call #t~mem15.base, #t~mem15.offset := read~$Pointer$(#t~mem14.base, #t~mem14.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4);call #t~mem17 := read~int(#t~mem16.base, 4 + #t~mem16.offset, 4); VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0, |main_#t~mem14.base|=26, |main_#t~mem14.offset|=0, |main_#t~mem15.base|=21, |main_#t~mem15.offset|=0, |main_#t~mem16.base|=29, |main_#t~mem16.offset|=0, |main_#t~mem17|=3] [?] assume !(3 != #t~mem17);havoc #t~mem16.base, #t~mem16.offset;havoc #t~mem14.base, #t~mem14.offset;havoc #t~mem15.base, #t~mem15.offset;havoc #t~mem17; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~head~0.base=23, main_~head~0.offset=0, main_~item~0.base=29, main_~item~0.offset=0, main_~status~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=23, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=29, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=10, old(#NULL.base)=17, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L987] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L988] ~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset; [L989] ~status~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=23, ~item~0.offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=23, ~item~0.offset=0, ~status~0=0] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=0] [L997-L1011] assume 0 == ~status~0; [L999] call write~int(1, ~item~0.base, 4 + ~item~0.offset, 4); [L1000] ~status~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=1] [L997-L1011] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=1] [L1002-L1011] assume 1 == ~status~0; [L1004] call write~int(2, ~item~0.base, 4 + ~item~0.offset, 4); [L1005] ~status~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L997-L1011] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L1002-L1011] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L1007-L1011] assume ~status~0 >= 2; [L1009] call write~int(3, ~item~0.base, 4 + ~item~0.offset, 4); [L1010] ~status~0 := 3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L991-L1015] assume !(0 != #t~nondet1); [L991] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1017] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1018-L1022] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1023-L1028] assume !(2 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1029-L1036] assume 3 == ~status~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1031] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1032] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem8.base=26, #t~mem8.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1032] assume !!(#t~mem8.base != 0 || #t~mem8.offset != 0); [L1032] havoc #t~mem8.base, #t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1033] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1033] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem10.base=21, #t~mem10.offset=0, #t~mem9.base=26, #t~mem9.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1033] assume !!(#t~mem10.base != 0 || #t~mem10.offset != 0); [L1033] havoc #t~mem9.base, #t~mem9.offset; [L1033] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1034] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1034] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(#t~mem11.base, #t~mem11.offset, 4); [L1034] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem11.base=26, #t~mem11.offset=0, #t~mem12.base=21, #t~mem12.offset=0, #t~mem13.base=29, #t~mem13.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1034] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0); [L1034] havoc #t~mem11.base, #t~mem11.offset; [L1034] havoc #t~mem12.base, #t~mem12.offset; [L1034] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1035] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(#t~mem14.base, #t~mem14.offset, 4); [L1035] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4); [L1035] call #t~mem17 := read~int(#t~mem16.base, 4 + #t~mem16.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem14.base=26, #t~mem14.offset=0, #t~mem15.base=21, #t~mem15.offset=0, #t~mem16.base=29, #t~mem16.offset=0, #t~mem17=3, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] assume !(3 != #t~mem17); [L1035] havoc #t~mem16.base, #t~mem16.offset; [L1035] havoc #t~mem14.base, #t~mem14.offset; [L1035] havoc #t~mem15.base, #t~mem15.offset; [L1035] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=10, old(#NULL.base)=17, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L985] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8); [L985] ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; [L986] call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); [L987] call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4); [L988] ~item~0.base, ~item~0.offset := ~head~0.base, ~head~0.offset; [L989] ~status~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=23, ~item~0.offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=23, ~item~0.offset=0, ~status~0=0] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=0] [L997-L1011] assume 0 == ~status~0; [L999] call write~int(1, ~item~0.base, 4 + ~item~0.offset, 4); [L1000] ~status~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=26, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=26, ~item~0.offset=0, ~status~0=1] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=1] [L997-L1011] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=1] [L1002-L1011] assume 1 == ~status~0; [L1004] call write~int(2, ~item~0.base, 4 + ~item~0.offset, 4); [L1005] ~status~0 := 2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=21, #t~malloc2.offset=0, #t~nondet1=1, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=21, ~item~0.offset=0, ~status~0=2] [L991-L1015] assume !!(0 != #t~nondet1); [L991] havoc #t~nondet1; [L993] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L993] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~item~0.base, ~item~0.offset, 4); [L994] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~item~0.base, ~item~0.offset, 4); [L994] ~item~0.base, ~item~0.offset := #t~mem3.base, #t~mem3.offset; [L994] havoc #t~mem3.base, #t~mem3.offset; [L995] call write~$Pointer$(0, 0, ~item~0.base, ~item~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L997-L1011] assume !(0 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L1002-L1011] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=2] [L1007-L1011] assume ~status~0 >= 2; [L1009] call write~int(3, ~item~0.base, 4 + ~item~0.offset, 4); [L1010] ~status~0 := 3; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1013] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1014] assume !!(~item~0.base != 0 || ~item~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L991-L1015] assume !(0 != #t~nondet1); [L991] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1017] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1018-L1022] assume !(1 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1023-L1028] assume !(2 == ~status~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1029-L1036] assume 3 == ~status~0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1031] assume !!(~head~0.base != 0 || ~head~0.offset != 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1032] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem8.base=26, #t~mem8.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1032] assume !!(#t~mem8.base != 0 || #t~mem8.offset != 0); [L1032] havoc #t~mem8.base, #t~mem8.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1033] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1033] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem10.base=21, #t~mem10.offset=0, #t~mem9.base=26, #t~mem9.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1033] assume !!(#t~mem10.base != 0 || #t~mem10.offset != 0); [L1033] havoc #t~mem9.base, #t~mem9.offset; [L1033] havoc #t~mem10.base, #t~mem10.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1034] call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1034] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(#t~mem11.base, #t~mem11.offset, 4); [L1034] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem11.base=26, #t~mem11.offset=0, #t~mem12.base=21, #t~mem12.offset=0, #t~mem13.base=29, #t~mem13.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1034] assume !!(#t~mem13.base != 0 || #t~mem13.offset != 0); [L1034] havoc #t~mem11.base, #t~mem11.offset; [L1034] havoc #t~mem12.base, #t~mem12.offset; [L1034] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head~0.base, ~head~0.offset, 4); [L1035] call #t~mem15.base, #t~mem15.offset := read~$Pointer$(#t~mem14.base, #t~mem14.offset, 4); [L1035] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(#t~mem15.base, #t~mem15.offset, 4); [L1035] call #t~mem17 := read~int(#t~mem16.base, 4 + #t~mem16.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, #t~mem14.base=26, #t~mem14.offset=0, #t~mem15.base=21, #t~mem15.offset=0, #t~mem16.base=29, #t~mem16.offset=0, #t~mem17=3, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] assume !(3 != #t~mem17); [L1035] havoc #t~mem16.base, #t~mem16.offset; [L1035] havoc #t~mem14.base, #t~mem14.offset; [L1035] havoc #t~mem15.base, #t~mem15.offset; [L1035] havoc #t~mem17; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=23, #t~malloc0.offset=0, #t~malloc2.base=29, #t~malloc2.offset=0, ~head~0.base=23, ~head~0.offset=0, ~item~0.base=29, ~item~0.offset=0, ~status~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=10, old(#NULL!base)=17, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L988] ~item~0 := ~head~0; [L989] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=0] [L997] COND TRUE 0 == ~status~0 [L999] FCALL call write~int(1, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1000] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L1002] COND TRUE 1 == ~status~0 [L1004] FCALL call write~int(2, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1005] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1002] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1007] COND TRUE ~status~0 >= 2 [L1009] FCALL call write~int(3, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1010] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991-L1015] COND TRUE !(0 != #t~nondet1) [L991] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1018] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1023] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1029] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1031] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] FCALL call #t~mem8 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem8!base=26, #t~mem8!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] COND FALSE !(!(#t~mem8 != { base: 0, offset: 0 })) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1033] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem10!base=21, #t~mem10!offset=0, #t~mem9!base=26, #t~mem9!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] COND FALSE !(!(#t~mem10 != { base: 0, offset: 0 })) [L1033] havoc #t~mem9; [L1033] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] FCALL call #t~mem11 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1034] FCALL call #t~mem12 := read~$Pointer$({ base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L1034] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem11!base=26, #t~mem11!offset=0, #t~mem12!base=21, #t~mem12!offset=0, #t~mem13!base=29, #t~mem13!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L1034] havoc #t~mem11; [L1034] havoc #t~mem12; [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem14 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1035] FCALL call #t~mem15 := read~$Pointer$({ base: #t~mem14!base, offset: #t~mem14!offset }, 4); [L1035] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1035] FCALL call #t~mem17 := read~int({ base: #t~mem16!base, offset: 4 + #t~mem16!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem14!base=26, #t~mem14!offset=0, #t~mem15!base=21, #t~mem15!offset=0, #t~mem16!base=29, #t~mem16!offset=0, #t~mem17=3, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] COND TRUE !(3 != #t~mem17) [L1035] havoc #t~mem16; [L1035] havoc #t~mem14; [L1035] havoc #t~mem15; [L1035] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=10, old(#NULL!base)=17, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L988] ~item~0 := ~head~0; [L989] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=0] [L997] COND TRUE 0 == ~status~0 [L999] FCALL call write~int(1, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1000] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L1002] COND TRUE 1 == ~status~0 [L1004] FCALL call write~int(2, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1005] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1002] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1007] COND TRUE ~status~0 >= 2 [L1009] FCALL call write~int(3, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1010] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991-L1015] COND TRUE !(0 != #t~nondet1) [L991] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1018] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1023] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1029] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1031] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] FCALL call #t~mem8 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem8!base=26, #t~mem8!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] COND FALSE !(!(#t~mem8 != { base: 0, offset: 0 })) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1033] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem10!base=21, #t~mem10!offset=0, #t~mem9!base=26, #t~mem9!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] COND FALSE !(!(#t~mem10 != { base: 0, offset: 0 })) [L1033] havoc #t~mem9; [L1033] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] FCALL call #t~mem11 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1034] FCALL call #t~mem12 := read~$Pointer$({ base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L1034] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem11!base=26, #t~mem11!offset=0, #t~mem12!base=21, #t~mem12!offset=0, #t~mem13!base=29, #t~mem13!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L1034] havoc #t~mem11; [L1034] havoc #t~mem12; [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem14 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1035] FCALL call #t~mem15 := read~$Pointer$({ base: #t~mem14!base, offset: #t~mem14!offset }, 4); [L1035] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1035] FCALL call #t~mem17 := read~int({ base: #t~mem16!base, offset: 4 + #t~mem16!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem14!base=26, #t~mem14!offset=0, #t~mem15!base=21, #t~mem15!offset=0, #t~mem16!base=29, #t~mem16!offset=0, #t~mem17=3, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] COND TRUE !(3 != #t~mem17) [L1035] havoc #t~mem16; [L1035] havoc #t~mem14; [L1035] havoc #t~mem15; [L1035] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=10, old(#NULL!base)=17, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L988] ~item~0 := ~head~0; [L989] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=0] [L997] COND TRUE 0 == ~status~0 [L999] FCALL call write~int(1, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1000] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L1002] COND TRUE 1 == ~status~0 [L1004] FCALL call write~int(2, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1005] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1002] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1007] COND TRUE ~status~0 >= 2 [L1009] FCALL call write~int(3, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1010] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991-L1015] COND TRUE !(0 != #t~nondet1) [L991] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1018] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1023] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1029] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1031] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] FCALL call #t~mem8 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem8!base=26, #t~mem8!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] COND FALSE !(!(#t~mem8 != { base: 0, offset: 0 })) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1033] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem10!base=21, #t~mem10!offset=0, #t~mem9!base=26, #t~mem9!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] COND FALSE !(!(#t~mem10 != { base: 0, offset: 0 })) [L1033] havoc #t~mem9; [L1033] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] FCALL call #t~mem11 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1034] FCALL call #t~mem12 := read~$Pointer$({ base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L1034] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem11!base=26, #t~mem11!offset=0, #t~mem12!base=21, #t~mem12!offset=0, #t~mem13!base=29, #t~mem13!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L1034] havoc #t~mem11; [L1034] havoc #t~mem12; [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem14 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1035] FCALL call #t~mem15 := read~$Pointer$({ base: #t~mem14!base, offset: #t~mem14!offset }, 4); [L1035] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1035] FCALL call #t~mem17 := read~int({ base: #t~mem16!base, offset: 4 + #t~mem16!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem14!base=26, #t~mem14!offset=0, #t~mem15!base=21, #t~mem15!offset=0, #t~mem16!base=29, #t~mem16!offset=0, #t~mem17=3, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] COND TRUE !(3 != #t~mem17) [L1035] havoc #t~mem16; [L1035] havoc #t~mem14; [L1035] havoc #t~mem15; [L1035] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=10, old(#NULL!base)=17, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret25 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L985] FCALL call #t~malloc0 := #Ultimate.alloc(8); [L985] ~head~0 := #t~malloc0; [L986] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~head~0!base, offset: ~head~0!offset }, 4); [L987] FCALL call write~int(0, { base: ~head~0!base, offset: 4 + ~head~0!offset }, 4); [L988] ~item~0 := ~head~0; [L989] ~status~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=23, ~item~0!offset=0, ~status~0=0] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=0] [L997] COND TRUE 0 == ~status~0 [L999] FCALL call write~int(1, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1000] ~status~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=26, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=26, ~item~0!offset=0, ~status~0=1] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=1] [L1002] COND TRUE 1 == ~status~0 [L1004] FCALL call write~int(2, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1005] ~status~0 := 2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=21, #t~malloc2!offset=0, #t~nondet1=1, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=21, ~item~0!offset=0, ~status~0=2] [L991-L1015] COND FALSE !(!(0 != #t~nondet1)) [L991] havoc #t~nondet1; [L993] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L993] FCALL call write~$Pointer$(#t~malloc2, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] FCALL call #t~mem3 := read~$Pointer$({ base: ~item~0!base, offset: ~item~0!offset }, 4); [L994] ~item~0 := #t~mem3; [L994] havoc #t~mem3; [L995] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~item~0!base, offset: ~item~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L997] COND FALSE !(0 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1002] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=2] [L1007] COND TRUE ~status~0 >= 2 [L1009] FCALL call write~int(3, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L1010] ~status~0 := 3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1013] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1014] COND FALSE !(!(~item~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L991-L1015] COND TRUE !(0 != #t~nondet1) [L991] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1017] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1018] COND FALSE !(1 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1023] COND FALSE !(2 == ~status~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1029] COND TRUE 3 == ~status~0 VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1031] COND FALSE !(!(~head~0 != { base: 0, offset: 0 })) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] FCALL call #t~mem8 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem8!base=26, #t~mem8!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1032] COND FALSE !(!(#t~mem8 != { base: 0, offset: 0 })) [L1032] havoc #t~mem8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] FCALL call #t~mem9 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1033] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem10!base=21, #t~mem10!offset=0, #t~mem9!base=26, #t~mem9!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1033] COND FALSE !(!(#t~mem10 != { base: 0, offset: 0 })) [L1033] havoc #t~mem9; [L1033] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] FCALL call #t~mem11 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1034] FCALL call #t~mem12 := read~$Pointer$({ base: #t~mem11!base, offset: #t~mem11!offset }, 4); [L1034] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem11!base=26, #t~mem11!offset=0, #t~mem12!base=21, #t~mem12!offset=0, #t~mem13!base=29, #t~mem13!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1034] COND FALSE !(!(#t~mem13 != { base: 0, offset: 0 })) [L1034] havoc #t~mem11; [L1034] havoc #t~mem12; [L1034] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] FCALL call #t~mem14 := read~$Pointer$({ base: ~head~0!base, offset: ~head~0!offset }, 4); [L1035] FCALL call #t~mem15 := read~$Pointer$({ base: #t~mem14!base, offset: #t~mem14!offset }, 4); [L1035] FCALL call #t~mem16 := read~$Pointer$({ base: #t~mem15!base, offset: #t~mem15!offset }, 4); [L1035] FCALL call #t~mem17 := read~int({ base: #t~mem16!base, offset: 4 + #t~mem16!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, #t~mem14!base=26, #t~mem14!offset=0, #t~mem15!base=21, #t~mem15!offset=0, #t~mem16!base=29, #t~mem16!offset=0, #t~mem17=3, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] COND TRUE !(3 != #t~mem17) [L1035] havoc #t~mem16; [L1035] havoc #t~mem14; [L1035] havoc #t~mem15; [L1035] havoc #t~mem17; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L1035] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=23, #t~malloc0!offset=0, #t~malloc2!base=29, #t~malloc2!offset=0, ~head~0!base=23, ~head~0!offset=0, ~item~0!base=29, ~item~0!offset=0, ~status~0=3] [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L988] SLL* item = head; [L989] int status = 0; VAL [head={23:0}, item={23:0}, malloc(sizeof(SLL))={23:0}, status=0] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=0] [L997] COND TRUE !status [L999] item->data = 1 [L1000] status = 1 VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=1] [L997] COND FALSE !(!status) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=1] [L1002] COND TRUE status == 1 [L1004] item->data = 2 [L1005] status = 2 VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L997] COND FALSE !(!status) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L1002] COND FALSE !(status == 1) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L1007] COND TRUE status >= 2 [L1009] item->data = 3 [L1010] status = 3 VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1018] COND FALSE !(status == 1) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1023] COND FALSE !(status == 2) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1029] COND TRUE status == 3 VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1031] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1032] EXPR head->next VAL [head={23:0}, head->next={26:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1033] EXPR head->next [L1033] EXPR head->next->next VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1034] EXPR head->next [L1034] EXPR head->next->next [L1034] EXPR head->next->next->next VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, head->next->next->next={29:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1035] EXPR head->next [L1035] EXPR head->next->next [L1035] EXPR head->next->next->next [L1035] EXPR head->next->next->next->data VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, head->next->next->next={29:0}, head->next->next->next->data=3, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] ----- [2018-11-23 11:51:52,600 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9f086031-a388-4c51-8c3f-7bab9c6ad5da/bin-2019/uautomizer/witness.graphml [2018-11-23 11:51:52,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:51:52,600 INFO L168 Benchmark]: Toolchain (without parser) took 13396.05 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 430.4 MB). Free memory was 951.1 MB in the beginning and 1.4 GB in the end (delta: -422.6 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:52,601 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:52,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:52,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:52,602 INFO L168 Benchmark]: Boogie Preprocessor took 31.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:52,602 INFO L168 Benchmark]: RCFGBuilder took 411.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: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:52,602 INFO L168 Benchmark]: TraceAbstraction took 12060.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 290.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -307.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 11:51:52,602 INFO L168 Benchmark]: Witness Printer took 539.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-11-23 11:51:52,603 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 411.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: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12060.19 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 290.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -307.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 539.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1035]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L988] SLL* item = head; [L989] int status = 0; VAL [head={23:0}, item={23:0}, malloc(sizeof(SLL))={23:0}, status=0] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=0] [L997] COND TRUE !status [L999] item->data = 1 [L1000] status = 1 VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=1] [L997] COND FALSE !(!status) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=1] [L1002] COND TRUE status == 1 [L1004] item->data = 2 [L1005] status = 2 VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L997] COND FALSE !(!status) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L1002] COND FALSE !(status == 1) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L1007] COND TRUE status >= 2 [L1009] item->data = 3 [L1010] status = 3 VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1018] COND FALSE !(status == 1) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1023] COND FALSE !(status == 2) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1029] COND TRUE status == 3 VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1031] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1032] EXPR head->next VAL [head={23:0}, head->next={26:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1033] EXPR head->next [L1033] EXPR head->next->next VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1034] EXPR head->next [L1034] EXPR head->next->next [L1034] EXPR head->next->next->next VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, head->next->next->next={29:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1035] EXPR head->next [L1035] EXPR head->next->next [L1035] EXPR head->next->next->next [L1035] EXPR head->next->next->next->data VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, head->next->next->next={29:0}, head->next->next->next->data=3, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 90 locations, 14 error locations. UNSAFE Result, 12.0s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1481 SDtfs, 1915 SDslu, 5161 SDs, 0 SdLazy, 2774 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 331 SyntacticMatches, 16 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=20, 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 415 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 920 ConstructedInterpolants, 141 QuantifiedInterpolants, 1243414 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1297 ConjunctsInSsa, 327 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 68/318 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...