./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-sorted_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_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-sorted_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 8be34918f5cf463066a3551693e083428b9e6ee2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:51:11,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:51:11,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:51:11,148 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:51:11,148 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:51:11,149 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:51:11,149 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:51:11,151 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:51:11,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:51:11,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:51:11,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:51:11,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:51:11,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:51:11,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:51:11,155 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:51:11,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:51:11,156 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:51:11,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:51:11,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:51:11,159 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:51:11,159 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:51:11,160 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:51:11,162 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:51:11,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:51:11,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:51:11,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:51:11,163 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:51:11,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:51:11,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:51:11,164 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:51:11,164 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:51:11,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:51:11,165 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:51:11,165 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:51:11,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:51:11,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:51:11,166 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 04:51:11,176 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:51:11,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:51:11,177 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:51:11,177 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:51:11,178 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:51:11,178 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:51:11,178 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:51:11,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:51:11,178 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:51:11,178 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:51:11,178 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:51:11,179 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:51:11,179 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:51:11,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:51:11,179 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:51:11,179 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:51:11,179 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:51:11,179 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:51:11,179 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:51:11,180 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:51:11,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:51:11,180 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:51:11,180 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:51:11,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:51:11,180 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:51:11,180 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:51:11,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:51:11,181 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:51:11,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:51:11,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:51:11,181 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_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 -> 8be34918f5cf463066a3551693e083428b9e6ee2 [2018-11-23 04:51:11,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:51:11,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:51:11,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:51:11,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:51:11,217 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:51:11,217 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-sorted_false-unreach-call_false-valid-memcleanup.i [2018-11-23 04:51:11,252 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/data/c2ee03623/5bacf0f660cc4d1e9aa7f7e274c2a5af/FLAG7277271a5 [2018-11-23 04:51:11,694 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:51:11,695 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/sv-benchmarks/c/forester-heap/sll-sorted_false-unreach-call_false-valid-memcleanup.i [2018-11-23 04:51:11,705 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/data/c2ee03623/5bacf0f660cc4d1e9aa7f7e274c2a5af/FLAG7277271a5 [2018-11-23 04:51:11,716 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/data/c2ee03623/5bacf0f660cc4d1e9aa7f7e274c2a5af [2018-11-23 04:51:11,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:51:11,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:51:11,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:51:11,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:51:11,721 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:51:11,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:51:11" (1/1) ... [2018-11-23 04:51:11,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7befe0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:11, skipping insertion in model container [2018-11-23 04:51:11,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:51:11" (1/1) ... [2018-11-23 04:51:11,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:51:11,759 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:51:11,951 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:51:11,958 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:51:12,040 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:51:12,063 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:51:12,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12 WrapperNode [2018-11-23 04:51:12,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:51:12,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:51:12,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:51:12,064 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:51:12,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (1/1) ... [2018-11-23 04:51:12,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (1/1) ... [2018-11-23 04:51:12,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:51:12,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:51:12,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:51:12,085 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:51:12,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (1/1) ... [2018-11-23 04:51:12,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (1/1) ... [2018-11-23 04:51:12,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (1/1) ... [2018-11-23 04:51:12,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (1/1) ... [2018-11-23 04:51:12,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (1/1) ... [2018-11-23 04:51:12,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (1/1) ... [2018-11-23 04:51:12,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (1/1) ... [2018-11-23 04:51:12,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:51:12,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:51:12,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:51:12,110 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:51:12,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 04:51:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:51:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 04:51:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 04:51:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:51:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:51:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:51:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:51:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 04:51:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 04:51:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 04:51:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:51:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:51:12,434 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:51:12,434 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-23 04:51:12,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:51:12 BoogieIcfgContainer [2018-11-23 04:51:12,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:51:12,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:51:12,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:51:12,437 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:51:12,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:51:11" (1/3) ... [2018-11-23 04:51:12,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fac8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:51:12, skipping insertion in model container [2018-11-23 04:51:12,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:51:12" (2/3) ... [2018-11-23 04:51:12,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fac8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:51:12, skipping insertion in model container [2018-11-23 04:51:12,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:51:12" (3/3) ... [2018-11-23 04:51:12,439 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted_false-unreach-call_false-valid-memcleanup.i [2018-11-23 04:51:12,445 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:51:12,450 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-23 04:51:12,459 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-23 04:51:12,479 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:51:12,479 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:51:12,480 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:51:12,480 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:51:12,480 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:51:12,480 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:51:12,480 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:51:12,480 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:51:12,480 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:51:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-23 04:51:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 04:51:12,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:12,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:12,499 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:12,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1783331453, now seen corresponding path program 1 times [2018-11-23 04:51:12,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:12,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:12,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:12,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:12,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:12,592 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 04:51:12,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:51:12,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:51:12,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 04:51:12,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 04:51:12,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 04:51:12,605 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-11-23 04:51:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:12,621 INFO L93 Difference]: Finished difference Result 112 states and 178 transitions. [2018-11-23 04:51:12,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 04:51:12,623 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 04:51:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:12,631 INFO L225 Difference]: With dead ends: 112 [2018-11-23 04:51:12,631 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 04:51:12,633 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 04:51:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 04:51:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 04:51:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 04:51:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-11-23 04:51:12,657 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 10 [2018-11-23 04:51:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:12,657 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-23 04:51:12,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 04:51:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-23 04:51:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 04:51:12,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:12,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:12,658 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:12,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash -569388701, now seen corresponding path program 1 times [2018-11-23 04:51:12,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:12,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:12,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:12,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:12,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:12,710 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 04:51:12,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:51:12,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:51:12,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:51:12,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:51:12,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:51:12,712 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 3 states. [2018-11-23 04:51:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:12,744 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-11-23 04:51:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:51:12,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-23 04:51:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:12,745 INFO L225 Difference]: With dead ends: 107 [2018-11-23 04:51:12,745 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 04:51:12,746 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 04:51:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 04:51:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 04:51:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 04:51:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-11-23 04:51:12,751 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 11 [2018-11-23 04:51:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:12,751 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-23 04:51:12,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:51:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-23 04:51:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 04:51:12,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:12,752 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:12,752 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:12,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash -846164232, now seen corresponding path program 1 times [2018-11-23 04:51:12,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:12,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:12,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:12,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:12,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 04:51:12,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:51:12,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:51:12,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:51:12,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:51:12,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:51:12,809 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 4 states. [2018-11-23 04:51:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:12,906 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2018-11-23 04:51:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:51:12,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 04:51:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:12,907 INFO L225 Difference]: With dead ends: 91 [2018-11-23 04:51:12,907 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 04:51:12,908 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 04:51:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 04:51:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2018-11-23 04:51:12,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 04:51:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-11-23 04:51:12,912 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 15 [2018-11-23 04:51:12,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:12,912 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-23 04:51:12,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:51:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-23 04:51:12,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 04:51:12,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:12,913 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:12,913 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:12,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:12,914 INFO L82 PathProgramCache]: Analyzing trace with hash 936567374, now seen corresponding path program 1 times [2018-11-23 04:51:12,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:12,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:12,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:12,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:12,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:13,181 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 04:51:13,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:13,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 04:51:13,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:13,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:13,243 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 04:51:13,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 04:51:13,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:13,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:13,278 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 04:51:13,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,294 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 04:51:13,297 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 04:51:13,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,318 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 04:51:13,321 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 04:51:13,321 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,328 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,333 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 04:51:13,345 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 04:51:13,348 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 04:51:13,348 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,359 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 04:51:13,361 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 04:51:13,362 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,366 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,369 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 04:51:13,377 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 04:51:13,378 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-11-23 04:51:13,409 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 108 treesize of output 98 [2018-11-23 04:51:13,417 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 04:51:13,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,448 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 04:51:13,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:51:13,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,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 50 treesize of output 45 [2018-11-23 04:51:13,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:13,472 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 04:51:13,472 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,477 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,483 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:115, output treesize:53 [2018-11-23 04:51:13,549 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 53 treesize of output 39 [2018-11-23 04:51:13,555 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 04:51:13,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,569 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 04:51:13,571 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 18 treesize of output 9 [2018-11-23 04:51:13,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,575 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 3 [2018-11-23 04:51:13,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,580 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 04:51:13,580 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:67, output treesize:11 [2018-11-23 04:51:13,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 04:51:13,589 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 04:51:13,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:13,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 04:51:13,609 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 04:51:13,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:13,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-11-23 04:51:13,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 04:51:13,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 04:51:13,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:51:13,624 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 13 states. [2018-11-23 04:51:14,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:14,251 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2018-11-23 04:51:14,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 04:51:14,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-23 04:51:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:14,253 INFO L225 Difference]: With dead ends: 102 [2018-11-23 04:51:14,253 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 04:51:14,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-11-23 04:51:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 04:51:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 74. [2018-11-23 04:51:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 04:51:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2018-11-23 04:51:14,261 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 25 [2018-11-23 04:51:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:14,261 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2018-11-23 04:51:14,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 04:51:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2018-11-23 04:51:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 04:51:14,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:14,263 INFO L402 BasicCegarLoop]: trace histogram [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 04:51:14,264 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:14,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:14,264 INFO L82 PathProgramCache]: Analyzing trace with hash 928005949, now seen corresponding path program 1 times [2018-11-23 04:51:14,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:14,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:14,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:14,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:14,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:14,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:14,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 04:51:14,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:14,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:14,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 04:51:14,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 04:51:14,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:14,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:14,467 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 04:51:14,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,479 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 04:51:14,481 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 04:51:14,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,489 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 04:51:14,491 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 04:51:14,492 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,495 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,499 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 04:51:14,508 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 04:51:14,509 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 04:51:14,509 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,516 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 04:51:14,521 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 04:51:14,521 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,525 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,528 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 04:51:14,533 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 04:51:14,534 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-11-23 04:51:14,552 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 04:51:14,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:14,556 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 04:51:14,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,572 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 66 treesize of output 56 [2018-11-23 04:51:14,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:14,575 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 04:51:14,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:14,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:46 [2018-11-23 04:51:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:14,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:14,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-11-23 04:51:14,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 04:51:14,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 04:51:14,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 04:51:14,666 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand 14 states. [2018-11-23 04:51:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:15,182 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2018-11-23 04:51:15,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 04:51:15,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 04:51:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:15,185 INFO L225 Difference]: With dead ends: 144 [2018-11-23 04:51:15,185 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 04:51:15,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=483, Unknown=2, NotChecked=0, Total=600 [2018-11-23 04:51:15,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 04:51:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 83. [2018-11-23 04:51:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 04:51:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2018-11-23 04:51:15,193 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 28 [2018-11-23 04:51:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:15,193 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2018-11-23 04:51:15,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 04:51:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2018-11-23 04:51:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 04:51:15,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:15,194 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:15,194 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:15,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1366931235, now seen corresponding path program 2 times [2018-11-23 04:51:15,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:15,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:15,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:15,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:15,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 04:51:15,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 04:51:15,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 04:51:15,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:51:15,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:15,549 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 04:51:15,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 04:51:15,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,574 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 04:51:15,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,605 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 04:51:15,610 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 04:51:15,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,620 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 04:51:15,623 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 04:51:15,623 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,628 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,631 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 04:51:15,644 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 04:51:15,649 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 04:51:15,650 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,656 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 04:51:15,658 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 04:51:15,658 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,662 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,665 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 04:51:15,675 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 04:51:15,675 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:53 [2018-11-23 04:51:15,703 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 45 treesize of output 44 [2018-11-23 04:51:15,706 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,708 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 04:51:15,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,733 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 04:51:15,735 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 04:51:15,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,757 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 38 treesize of output 44 [2018-11-23 04:51:15,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,761 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 37 [2018-11-23 04:51:15,762 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,768 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,780 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:104, output treesize:66 [2018-11-23 04:51:15,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,816 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 04:51:15,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,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, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 149 [2018-11-23 04:51:15,864 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 27 treesize of output 24 [2018-11-23 04:51:15,864 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,900 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 123 treesize of output 143 [2018-11-23 04:51:15,903 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 04:51:15,903 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,923 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,937 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 04:51:15,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,976 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 62 treesize of output 44 [2018-11-23 04:51:15,980 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 18 treesize of output 11 [2018-11-23 04:51:15,980 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:15,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:15,997 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 30 treesize of output 55 [2018-11-23 04:51:16,000 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 16 treesize of output 15 [2018-11-23 04:51:16,000 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,008 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,012 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 04:51:16,031 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 39 treesize of output 26 [2018-11-23 04:51:16,034 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 04:51:16,034 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,039 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,058 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 27 treesize of output 40 [2018-11-23 04:51:16,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 04:51:16,060 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,064 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,074 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 04:51:16,075 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:199, output treesize:67 [2018-11-23 04:51:16,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:16,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:16,110 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 185 treesize of output 150 [2018-11-23 04:51:16,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:16,116 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 04:51:16,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,152 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 66 treesize of output 57 [2018-11-23 04:51:16,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:16,156 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 04:51:16,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,177 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 41 treesize of output 46 [2018-11-23 04:51:16,179 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 18 treesize of output 17 [2018-11-23 04:51:16,179 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,184 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,194 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 04:51:16,194 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:195, output treesize:97 [2018-11-23 04:51:16,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:16,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:16,257 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 94 treesize of output 69 [2018-11-23 04:51:16,259 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 04:51:16,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,270 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 35 treesize of output 27 [2018-11-23 04:51:16,270 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 04:51:16,279 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 27 treesize of output 16 [2018-11-23 04:51:16,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,286 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 04:51:16,297 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 04:51:16,299 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 04:51:16,299 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,303 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 04:51:16,304 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,305 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,311 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 04:51:16,311 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:108, output treesize:24 [2018-11-23 04:51:16,331 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 24 treesize of output 22 [2018-11-23 04:51:16,333 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 04:51:16,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:16,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:16,340 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 04:51:16,340 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-23 04:51:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:16,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:16,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2018-11-23 04:51:16,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 04:51:16,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 04:51:16,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=282, Unknown=1, NotChecked=0, Total=342 [2018-11-23 04:51:16,365 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 19 states. [2018-11-23 04:51:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:18,150 INFO L93 Difference]: Finished difference Result 234 states and 299 transitions. [2018-11-23 04:51:18,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 04:51:18,150 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2018-11-23 04:51:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:18,151 INFO L225 Difference]: With dead ends: 234 [2018-11-23 04:51:18,151 INFO L226 Difference]: Without dead ends: 232 [2018-11-23 04:51:18,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=332, Invalid=2017, Unknown=3, NotChecked=0, Total=2352 [2018-11-23 04:51:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-23 04:51:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 113. [2018-11-23 04:51:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 04:51:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions. [2018-11-23 04:51:18,164 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 29 [2018-11-23 04:51:18,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:18,165 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions. [2018-11-23 04:51:18,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 04:51:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2018-11-23 04:51:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 04:51:18,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:18,166 INFO L402 BasicCegarLoop]: trace histogram [3, 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 04:51:18,166 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:18,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash 549282785, now seen corresponding path program 1 times [2018-11-23 04:51:18,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:18,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:18,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:18,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:51:18,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 04:51:18,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:51:18,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:51:18,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:51:18,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:51:18,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:51:18,192 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand 3 states. [2018-11-23 04:51:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:18,218 INFO L93 Difference]: Finished difference Result 181 states and 228 transitions. [2018-11-23 04:51:18,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:51:18,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 04:51:18,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:18,220 INFO L225 Difference]: With dead ends: 181 [2018-11-23 04:51:18,220 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 04:51:18,221 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 04:51:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 04:51:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-11-23 04:51:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 04:51:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2018-11-23 04:51:18,234 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 29 [2018-11-23 04:51:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:18,234 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2018-11-23 04:51:18,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:51:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2018-11-23 04:51:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 04:51:18,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:18,235 INFO L402 BasicCegarLoop]: trace histogram [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 04:51:18,235 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:18,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash 971984611, now seen corresponding path program 1 times [2018-11-23 04:51:18,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:18,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:18,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:18,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:18,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:18,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:18,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 04:51:18,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:18,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:18,602 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 04:51:18,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 04:51:18,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:18,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:18,632 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 04:51:18,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,664 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 04:51:18,666 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 04:51:18,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,681 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 04:51:18,683 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 04:51:18,683 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,687 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,690 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 04:51:18,700 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 04:51:18,701 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 04:51:18,702 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,707 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 04:51:18,709 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 04:51:18,709 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,712 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,715 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 04:51:18,722 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 04:51:18,722 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-23 04:51:18,743 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 04:51:18,745 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 04:51:18,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,770 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 62 treesize of output 61 [2018-11-23 04:51:18,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:18,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 22 treesize of output 18 [2018-11-23 04:51:18,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,795 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 04:51:18,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:18,798 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 04:51:18,799 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,804 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,813 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:71 [2018-11-23 04:51:18,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:18,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:18,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:18,845 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 04:51:18,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,881 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 53 treesize of output 40 [2018-11-23 04:51:18,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:18,886 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 40 treesize of output 32 [2018-11-23 04:51:18,887 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,922 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 166 treesize of output 139 [2018-11-23 04:51:18,926 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 26 treesize of output 23 [2018-11-23 04:51:18,926 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,949 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 126 treesize of output 130 [2018-11-23 04:51:18,951 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 04:51:18,951 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,963 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,974 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:18,995 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 33 treesize of output 50 [2018-11-23 04:51:18,996 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 04:51:18,997 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,001 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,017 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 106 treesize of output 84 [2018-11-23 04:51:19,020 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 04:51:19,020 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,032 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 66 treesize of output 83 [2018-11-23 04:51:19,034 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 04:51:19,034 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,041 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,047 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,056 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 04:51:19,056 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:234, output treesize:74 [2018-11-23 04:51:19,083 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 55 treesize of output 60 [2018-11-23 04:51:19,084 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 04:51:19,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,117 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 231 treesize of output 176 [2018-11-23 04:51:19,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:19,122 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 04:51:19,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,156 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 175 treesize of output 149 [2018-11-23 04:51:19,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:19,160 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 04:51:19,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,172 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,183 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 04:51:19,183 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:254, output treesize:128 [2018-11-23 04:51:19,244 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 91 [2018-11-23 04:51:19,246 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 04:51:19,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,256 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 51 treesize of output 27 [2018-11-23 04:51:19,257 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 04:51:19,266 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 28 treesize of output 22 [2018-11-23 04:51:19,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:19,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:19,286 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 23 treesize of output 23 [2018-11-23 04:51:19,288 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 1 [2018-11-23 04:51:19,288 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:19,293 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,294 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:19,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:19,301 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:129, output treesize:20 [2018-11-23 04:51:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:19,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:19,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-11-23 04:51:19,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 04:51:19,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 04:51:19,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=287, Unknown=1, NotChecked=0, Total=342 [2018-11-23 04:51:19,340 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand 19 states. [2018-11-23 04:51:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:20,782 INFO L93 Difference]: Finished difference Result 227 states and 277 transitions. [2018-11-23 04:51:20,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 04:51:20,783 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 29 [2018-11-23 04:51:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:20,784 INFO L225 Difference]: With dead ends: 227 [2018-11-23 04:51:20,784 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 04:51:20,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=1105, Unknown=1, NotChecked=0, Total=1332 [2018-11-23 04:51:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 04:51:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 124. [2018-11-23 04:51:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 04:51:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2018-11-23 04:51:20,802 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 29 [2018-11-23 04:51:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:20,802 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2018-11-23 04:51:20,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 04:51:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2018-11-23 04:51:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 04:51:20,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:20,803 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] [2018-11-23 04:51:20,803 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:20,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash -326134196, now seen corresponding path program 1 times [2018-11-23 04:51:20,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:20,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:20,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:20,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:20,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:21,107 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 04:51:21,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:21,108 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 04:51:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:21,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:21,141 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 04:51:21,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 04:51:21,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 04:51:21,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,155 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,160 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 04:51:21,160 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-23 04:51:21,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:21,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:21,169 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 04:51:21,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,198 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 04:51:21,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:21,211 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 41 treesize of output 31 [2018-11-23 04:51:21,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:21,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 04:51:21,214 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,224 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 32 treesize of output 33 [2018-11-23 04:51:21,226 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 1 [2018-11-23 04:51:21,226 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,230 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,239 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 04:51:21,239 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2018-11-23 04:51:21,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 04:51:21,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 04:51:21,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,280 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 04:51:21,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-11-23 04:51:21,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:21,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:21,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:21,334 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 16 treesize of output 13 [2018-11-23 04:51:21,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,353 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 39 treesize of output 48 [2018-11-23 04:51:21,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 04:51:21,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:21,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:51:21,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,378 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 04:51:21,378 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2018-11-23 04:51:21,406 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 43 treesize of output 50 [2018-11-23 04:51:21,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:21,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:51:21,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,438 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 43 treesize of output 50 [2018-11-23 04:51:21,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:21,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:51:21,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:21,482 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:73, output treesize:43 [2018-11-23 04:51:21,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-11-23 04:51:21,548 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 04:51:21,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:21,557 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:21,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:21,566 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 04:51:21,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2018-11-23 04:51:21,575 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 04:51:21,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:21,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-11-23 04:51:21,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 04:51:21,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 04:51:21,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:51:21,601 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand 18 states. [2018-11-23 04:51:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:22,441 INFO L93 Difference]: Finished difference Result 219 states and 265 transitions. [2018-11-23 04:51:22,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 04:51:22,442 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2018-11-23 04:51:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:22,442 INFO L225 Difference]: With dead ends: 219 [2018-11-23 04:51:22,443 INFO L226 Difference]: Without dead ends: 204 [2018-11-23 04:51:22,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 04:51:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-23 04:51:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 150. [2018-11-23 04:51:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 04:51:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2018-11-23 04:51:22,457 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 31 [2018-11-23 04:51:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:22,457 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2018-11-23 04:51:22,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 04:51:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2018-11-23 04:51:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 04:51:22,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:22,458 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] [2018-11-23 04:51:22,459 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:22,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1520716834, now seen corresponding path program 1 times [2018-11-23 04:51:22,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:22,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:22,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:22,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:22,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:22,702 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 04:51:22,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:22,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 04:51:22,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:22,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:22,751 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 04:51:22,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 04:51:22,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 04:51:22,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,764 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,770 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 04:51:22,770 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-23 04:51:22,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:22,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:22,803 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 04:51:22,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,821 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 25 treesize of output 20 [2018-11-23 04:51:22,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:22,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:51:22,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,844 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 25 treesize of output 26 [2018-11-23 04:51:22,846 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 1 [2018-11-23 04:51:22,847 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,851 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,858 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 04:51:22,858 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:27 [2018-11-23 04:51:22,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 04:51:22,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 04:51:22,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,903 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 04:51:22,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-11-23 04:51:22,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:22,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:22,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:22,957 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 16 treesize of output 13 [2018-11-23 04:51:22,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,977 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 39 treesize of output 48 [2018-11-23 04:51:22,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 04:51:22,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:22,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:51:22,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:22,997 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 04:51:22,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2018-11-23 04:51:23,018 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 04:51:23,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:23,037 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 59 treesize of output 61 [2018-11-23 04:51:23,040 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:23,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 04:51:23,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:23,057 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 50 treesize of output 57 [2018-11-23 04:51:23,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:23,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:51:23,060 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:23,066 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:23,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:23,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:23,079 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:73, output treesize:43 [2018-11-23 04:51:23,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-11-23 04:51:23,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 7 treesize of output 1 [2018-11-23 04:51:23,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:23,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:23,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:23,138 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 04:51:23,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:23,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:23,143 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 04:51:23,143 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2018-11-23 04:51:23,154 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 04:51:23,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:23,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 04:51:23,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 04:51:23,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 04:51:23,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-11-23 04:51:23,170 INFO L87 Difference]: Start difference. First operand 150 states and 186 transitions. Second operand 20 states. [2018-11-23 04:51:23,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:23,895 INFO L93 Difference]: Finished difference Result 204 states and 249 transitions. [2018-11-23 04:51:23,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 04:51:23,895 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2018-11-23 04:51:23,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:23,896 INFO L225 Difference]: With dead ends: 204 [2018-11-23 04:51:23,897 INFO L226 Difference]: Without dead ends: 202 [2018-11-23 04:51:23,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=960, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 04:51:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-23 04:51:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 150. [2018-11-23 04:51:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 04:51:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 185 transitions. [2018-11-23 04:51:23,917 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 185 transitions. Word has length 32 [2018-11-23 04:51:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:23,917 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 185 transitions. [2018-11-23 04:51:23,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 04:51:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 185 transitions. [2018-11-23 04:51:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 04:51:23,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:23,918 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 04:51:23,918 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:23,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:23,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1420410440, now seen corresponding path program 2 times [2018-11-23 04:51:23,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:23,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:23,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:23,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:23,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:24,208 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 04:51:24,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:24,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 04:51:24,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 04:51:24,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 04:51:24,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:51:24,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:24,240 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 04:51:24,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 04:51:24,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,252 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 04:51:24,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,269 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 04:51:24,271 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 04:51:24,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,280 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 04:51:24,282 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 04:51:24,282 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,287 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,290 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 04:51:24,301 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 04:51:24,304 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 04:51:24,304 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,311 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 04:51:24,313 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 04:51:24,313 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,317 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,323 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 04:51:24,333 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 04:51:24,333 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:53 [2018-11-23 04:51:24,360 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 38 treesize of output 44 [2018-11-23 04:51:24,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,364 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 37 [2018-11-23 04:51:24,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,388 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 45 treesize of output 44 [2018-11-23 04:51:24,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,391 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 04:51:24,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2018-11-23 04:51:24,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,441 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 04:51:24,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,475 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:51:24,475 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 62 treesize of output 49 [2018-11-23 04:51:24,478 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 23 treesize of output 15 [2018-11-23 04:51:24,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,493 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 30 treesize of output 47 [2018-11-23 04:51:24,494 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 04:51:24,494 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,505 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 04:51:24,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,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, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2018-11-23 04:51:24,524 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 27 treesize of output 24 [2018-11-23 04:51:24,524 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,540 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 42 treesize of output 62 [2018-11-23 04:51:24,541 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 04:51:24,542 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,549 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,556 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 04:51:24,569 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 04:51:24,569 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:149, output treesize:62 [2018-11-23 04:51:24,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,607 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 175 treesize of output 140 [2018-11-23 04:51:24,610 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 15 [2018-11-23 04:51:24,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,640 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 73 treesize of output 88 [2018-11-23 04:51:24,643 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 15 [2018-11-23 04:51:24,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,659 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 27 treesize of output 16 [2018-11-23 04:51:24,660 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 16 treesize of output 15 [2018-11-23 04:51:24,661 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,662 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,670 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:185, output treesize:95 [2018-11-23 04:51:24,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:24,748 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 89 [2018-11-23 04:51:24,754 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2018-11-23 04:51:24,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 04:51:24,770 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 62 treesize of output 52 [2018-11-23 04:51:24,770 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 68 [2018-11-23 04:51:24,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 04:51:24,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 04:51:24,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-11-23 04:51:24,819 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 04:51:24,819 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,825 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 04:51:24,825 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,829 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-11-23 04:51:24,833 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 04:51:24,833 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,839 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 04:51:24,840 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,848 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,859 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:122, output treesize:11 [2018-11-23 04:51:24,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 04:51:24,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, 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 04:51:24,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:24,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 04:51:24,883 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 04:51:24,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:24,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2018-11-23 04:51:24,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 04:51:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 04:51:24,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-11-23 04:51:24,899 INFO L87 Difference]: Start difference. First operand 150 states and 185 transitions. Second operand 19 states. [2018-11-23 04:51:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:26,536 INFO L93 Difference]: Finished difference Result 259 states and 325 transitions. [2018-11-23 04:51:26,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 04:51:26,537 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-11-23 04:51:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:26,538 INFO L225 Difference]: With dead ends: 259 [2018-11-23 04:51:26,538 INFO L226 Difference]: Without dead ends: 257 [2018-11-23 04:51:26,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=288, Invalid=2064, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 04:51:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-23 04:51:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 173. [2018-11-23 04:51:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-23 04:51:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 221 transitions. [2018-11-23 04:51:26,552 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 221 transitions. Word has length 32 [2018-11-23 04:51:26,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:26,553 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 221 transitions. [2018-11-23 04:51:26,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 04:51:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 221 transitions. [2018-11-23 04:51:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 04:51:26,554 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:26,554 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:26,554 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:26,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:26,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1357745354, now seen corresponding path program 1 times [2018-11-23 04:51:26,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:26,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:26,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:26,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:51:26,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 04:51:26,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:51:26,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:51:26,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:51:26,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:51:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:51:26,598 INFO L87 Difference]: Start difference. First operand 173 states and 221 transitions. Second operand 5 states. [2018-11-23 04:51:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:26,654 INFO L93 Difference]: Finished difference Result 256 states and 322 transitions. [2018-11-23 04:51:26,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:51:26,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 04:51:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:26,655 INFO L225 Difference]: With dead ends: 256 [2018-11-23 04:51:26,655 INFO L226 Difference]: Without dead ends: 189 [2018-11-23 04:51:26,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:51:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-23 04:51:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2018-11-23 04:51:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 04:51:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 216 transitions. [2018-11-23 04:51:26,675 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 216 transitions. Word has length 33 [2018-11-23 04:51:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:26,675 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 216 transitions. [2018-11-23 04:51:26,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:51:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 216 transitions. [2018-11-23 04:51:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 04:51:26,676 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:26,676 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 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 04:51:26,676 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:26,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash -541863624, now seen corresponding path program 2 times [2018-11-23 04:51:26,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:26,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:26,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:27,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:27,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 04:51:27,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 04:51:27,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 04:51:27,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:51:27,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:27,045 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 04:51:27,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 04:51:27,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,078 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 04:51:27,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,096 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 04:51:27,099 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 04:51:27,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,108 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 04:51:27,110 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 04:51:27,110 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,115 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,118 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 04:51:27,131 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 04:51:27,133 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 04:51:27,134 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,140 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 04:51:27,142 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 04:51:27,142 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,146 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,149 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 04:51:27,159 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 04:51:27,159 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:53 [2018-11-23 04:51:27,186 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 45 treesize of output 44 [2018-11-23 04:51:27,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,190 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 04:51:27,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,219 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 38 treesize of output 44 [2018-11-23 04:51:27,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,223 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 37 [2018-11-23 04:51:27,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,243 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 04:51:27,245 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 04:51:27,246 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,248 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,260 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:104, output treesize:66 [2018-11-23 04:51:27,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,294 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 04:51:27,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,349 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 172 treesize of output 158 [2018-11-23 04:51:27,354 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 27 treesize of output 24 [2018-11-23 04:51:27,354 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 152 [2018-11-23 04:51:27,394 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 04:51:27,394 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,415 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,430 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 04:51:27,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,465 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 62 treesize of output 44 [2018-11-23 04:51:27,469 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 18 treesize of output 11 [2018-11-23 04:51:27,469 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,486 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 30 treesize of output 55 [2018-11-23 04:51:27,489 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 16 treesize of output 15 [2018-11-23 04:51:27,489 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,497 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,503 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 04:51:27,525 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:27,528 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:27,551 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 59 treesize of output 33 [2018-11-23 04:51:27,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-11-23 04:51:27,563 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,573 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 38 treesize of output 51 [2018-11-23 04:51:27,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 04:51:27,576 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,581 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,585 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,601 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 04:51:27,602 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:205, output treesize:86 [2018-11-23 04:51:27,633 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 25 treesize of output 38 [2018-11-23 04:51:27,635 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 18 treesize of output 17 [2018-11-23 04:51:27,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,674 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 98 treesize of output 108 [2018-11-23 04:51:27,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,678 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 04:51:27,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2018-11-23 04:51:27,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,722 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 04:51:27,722 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,728 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,743 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:103 [2018-11-23 04:51:27,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 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 04:51:27,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,878 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-11-23 04:51:27,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:27,885 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 36 treesize of output 24 [2018-11-23 04:51:27,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,953 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 77 [2018-11-23 04:51:27,955 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 1 [2018-11-23 04:51:27,955 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:27,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:28,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:28,016 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 225 treesize of output 169 [2018-11-23 04:51:28,021 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 04:51:28,021 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:28,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:28,053 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 177 treesize of output 164 [2018-11-23 04:51:28,056 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 04:51:28,056 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,072 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,086 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 04:51:28,108 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 52 [2018-11-23 04:51:28,110 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 15 [2018-11-23 04:51:28,111 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,122 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-11-23 04:51:28,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 04:51:28,124 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,129 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,133 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:28,148 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:301, output treesize:132 [2018-11-23 04:51:28,217 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 111 [2018-11-23 04:51:28,219 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 04:51:28,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:28,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:28,264 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 286 treesize of output 194 [2018-11-23 04:51:28,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:28,268 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 04:51:28,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,310 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 82 treesize of output 69 [2018-11-23 04:51:28,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:28,313 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 04:51:28,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,318 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:28,334 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:315, output treesize:189 [2018-11-23 04:51:28,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 188 [2018-11-23 04:51:28,437 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:51:28,438 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 17 treesize of output 9 [2018-11-23 04:51:28,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:28,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:28,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:28,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:28,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:411, output treesize:138 [2018-11-23 04:51:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:28,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:28,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-23 04:51:28,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 04:51:28,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 04:51:28,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-11-23 04:51:28,556 INFO L87 Difference]: Start difference. First operand 168 states and 216 transitions. Second operand 23 states. [2018-11-23 04:51:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:30,501 INFO L93 Difference]: Finished difference Result 371 states and 464 transitions. [2018-11-23 04:51:30,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 04:51:30,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-11-23 04:51:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:30,503 INFO L225 Difference]: With dead ends: 371 [2018-11-23 04:51:30,503 INFO L226 Difference]: Without dead ends: 316 [2018-11-23 04:51:30,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=481, Invalid=2599, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 04:51:30,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-11-23 04:51:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 191. [2018-11-23 04:51:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-23 04:51:30,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 246 transitions. [2018-11-23 04:51:30,522 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 246 transitions. Word has length 33 [2018-11-23 04:51:30,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:30,523 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 246 transitions. [2018-11-23 04:51:30,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 04:51:30,523 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 246 transitions. [2018-11-23 04:51:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 04:51:30,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:30,523 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, 1] [2018-11-23 04:51:30,524 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:30,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:30,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1119864478, now seen corresponding path program 1 times [2018-11-23 04:51:30,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:30,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:30,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:30,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:51:30,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 04:51:30,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:51:30,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:51:30,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:51:30,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:51:30,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:51:30,557 INFO L87 Difference]: Start difference. First operand 191 states and 246 transitions. Second operand 5 states. [2018-11-23 04:51:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:30,611 INFO L93 Difference]: Finished difference Result 214 states and 271 transitions. [2018-11-23 04:51:30,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:51:30,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-23 04:51:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:30,612 INFO L225 Difference]: With dead ends: 214 [2018-11-23 04:51:30,612 INFO L226 Difference]: Without dead ends: 198 [2018-11-23 04:51:30,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:51:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-23 04:51:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-11-23 04:51:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-23 04:51:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 252 transitions. [2018-11-23 04:51:30,630 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 252 transitions. Word has length 34 [2018-11-23 04:51:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:30,631 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 252 transitions. [2018-11-23 04:51:30,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:51:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 252 transitions. [2018-11-23 04:51:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 04:51:30,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:30,631 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, 1] [2018-11-23 04:51:30,632 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:30,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:30,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1929211104, now seen corresponding path program 1 times [2018-11-23 04:51:30,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:30,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:30,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 04:51:30,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:51:30,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:51:30,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:51:30,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:51:30,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:51:30,670 INFO L87 Difference]: Start difference. First operand 196 states and 252 transitions. Second operand 5 states. [2018-11-23 04:51:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:30,747 INFO L93 Difference]: Finished difference Result 246 states and 306 transitions. [2018-11-23 04:51:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:51:30,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-23 04:51:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:30,749 INFO L225 Difference]: With dead ends: 246 [2018-11-23 04:51:30,749 INFO L226 Difference]: Without dead ends: 208 [2018-11-23 04:51:30,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:51:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-23 04:51:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2018-11-23 04:51:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-11-23 04:51:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 246 transitions. [2018-11-23 04:51:30,767 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 246 transitions. Word has length 34 [2018-11-23 04:51:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:30,767 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 246 transitions. [2018-11-23 04:51:30,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:51:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 246 transitions. [2018-11-23 04:51:30,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 04:51:30,767 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:30,767 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:30,767 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:30,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:30,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1475461957, now seen corresponding path program 1 times [2018-11-23 04:51:30,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:30,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:30,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:30,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:30,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:30,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:30,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/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 04:51:30,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:30,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:30,897 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 04:51:30,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:30,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:30,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 04:51:30,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:30,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:30,906 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 04:51:30,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:30,913 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 04:51:30,915 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 04:51:30,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:30,920 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 04:51:30,921 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 04:51:30,921 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:30,924 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:30,926 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 04:51:30,931 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 04:51:30,931 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2018-11-23 04:51:30,945 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 60 treesize of output 50 [2018-11-23 04:51:30,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:30,948 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 04:51:30,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:30,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:30,955 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 04:51:30,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-11-23 04:51:31,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:31,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:31,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:31,128 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 04:51:31,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:31,148 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 04:51:31,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:31,167 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 82 treesize of output 85 [2018-11-23 04:51:31,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 10 treesize of output 9 [2018-11-23 04:51:31,169 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:31,182 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 81 treesize of output 62 [2018-11-23 04:51:31,184 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 16 treesize of output 3 [2018-11-23 04:51:31,185 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:31,193 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 31 treesize of output 23 [2018-11-23 04:51:31,193 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:31,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:31,200 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:31,206 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:31,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:31,220 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 28 [2018-11-23 04:51:31,222 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 16 treesize of output 1 [2018-11-23 04:51:31,222 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:31,224 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:31,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-11-23 04:51:31,233 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 04:51:31,233 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:31,237 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:31,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:31,241 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 11 variables, input treesize:137, output treesize:7 [2018-11-23 04:51:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:31,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:31,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-11-23 04:51:31,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 04:51:31,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 04:51:31,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:51:31,269 INFO L87 Difference]: Start difference. First operand 192 states and 246 transitions. Second operand 18 states. [2018-11-23 04:51:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:32,061 INFO L93 Difference]: Finished difference Result 343 states and 413 transitions. [2018-11-23 04:51:32,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 04:51:32,061 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-11-23 04:51:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:32,062 INFO L225 Difference]: With dead ends: 343 [2018-11-23 04:51:32,062 INFO L226 Difference]: Without dead ends: 304 [2018-11-23 04:51:32,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=301, Invalid=1105, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 04:51:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-23 04:51:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 204. [2018-11-23 04:51:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 04:51:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 258 transitions. [2018-11-23 04:51:32,082 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 258 transitions. Word has length 34 [2018-11-23 04:51:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:32,083 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 258 transitions. [2018-11-23 04:51:32,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 04:51:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 258 transitions. [2018-11-23 04:51:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 04:51:32,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:32,083 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:32,084 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:32,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:32,084 INFO L82 PathProgramCache]: Analyzing trace with hash -666115331, now seen corresponding path program 1 times [2018-11-23 04:51:32,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:32,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:32,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:32,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:32,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:32,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:32,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:51:32,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:32,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:32,234 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 04:51:32,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 04:51:32,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:32,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:32,265 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 04:51:32,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,274 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 04:51:32,275 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 04:51:32,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,283 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 04:51:32,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 8 treesize of output 7 [2018-11-23 04:51:32,285 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,288 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,298 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 04:51:32,299 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 04:51:32,300 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,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 24 [2018-11-23 04:51:32,306 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 04:51:32,306 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,309 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,312 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 04:51:32,316 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 04:51:32,317 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:65, output treesize:41 [2018-11-23 04:51:32,333 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 142 treesize of output 132 [2018-11-23 04:51:32,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:32,337 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 42 treesize of output 30 [2018-11-23 04:51:32,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,356 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 95 treesize of output 90 [2018-11-23 04:51:32,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:32,359 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 42 treesize of output 30 [2018-11-23 04:51:32,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,374 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 25 treesize of output 18 [2018-11-23 04:51:32,376 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 18 treesize of output 17 [2018-11-23 04:51:32,376 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:32,391 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:142, output treesize:56 [2018-11-23 04:51:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:32,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:32,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 04:51:32,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 04:51:32,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 04:51:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:51:32,444 INFO L87 Difference]: Start difference. First operand 204 states and 258 transitions. Second operand 13 states. [2018-11-23 04:51:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:32,882 INFO L93 Difference]: Finished difference Result 241 states and 298 transitions. [2018-11-23 04:51:32,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 04:51:32,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 04:51:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:32,884 INFO L225 Difference]: With dead ends: 241 [2018-11-23 04:51:32,884 INFO L226 Difference]: Without dead ends: 202 [2018-11-23 04:51:32,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-23 04:51:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-23 04:51:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2018-11-23 04:51:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-23 04:51:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 249 transitions. [2018-11-23 04:51:32,922 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 249 transitions. Word has length 34 [2018-11-23 04:51:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:32,922 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 249 transitions. [2018-11-23 04:51:32,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 04:51:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 249 transitions. [2018-11-23 04:51:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 04:51:32,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:32,923 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:32,923 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:32,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:32,923 INFO L82 PathProgramCache]: Analyzing trace with hash 466010067, now seen corresponding path program 3 times [2018-11-23 04:51:32,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:32,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:32,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:32,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:32,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:33,284 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2018-11-23 04:51:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:33,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:33,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:51:33,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:51:33,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 04:51:33,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:51:33,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:33,589 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 04:51:33,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 04:51:33,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:33,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:33,598 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 04:51:33,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,615 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 04:51:33,616 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 04:51:33,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,624 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 04:51:33,626 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 04:51:33,626 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,633 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 04:51:33,644 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 04:51:33,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 04:51:33,646 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,657 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 04:51:33,658 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 04:51:33,659 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,662 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,665 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 04:51:33,682 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 04:51:33,683 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:53 [2018-11-23 04:51:33,711 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 45 treesize of output 44 [2018-11-23 04:51:33,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:33,715 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 04:51:33,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,739 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 38 treesize of output 44 [2018-11-23 04:51:33,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:33,743 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 37 [2018-11-23 04:51:33,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,760 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 04:51:33,761 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 04:51:33,761 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,763 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,772 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:104, output treesize:66 [2018-11-23 04:51:33,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:33,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:33,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:33,804 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 04:51:33,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,852 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 62 treesize of output 44 [2018-11-23 04:51:33,857 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 18 treesize of output 11 [2018-11-23 04:51:33,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,876 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 30 treesize of output 47 [2018-11-23 04:51:33,879 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 04:51:33,879 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,888 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,894 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 04:51:33,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:33,925 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 129 treesize of output 115 [2018-11-23 04:51:33,928 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 27 treesize of output 24 [2018-11-23 04:51:33,929 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:33,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:33,950 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 89 treesize of output 109 [2018-11-23 04:51:33,952 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 04:51:33,952 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,964 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:33,974 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 04:51:33,995 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 39 treesize of output 26 [2018-11-23 04:51:33,998 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 04:51:33,998 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,000 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,018 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 27 treesize of output 40 [2018-11-23 04:51:34,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 04:51:34,020 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,023 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,035 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 04:51:34,035 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:205, output treesize:78 [2018-11-23 04:51:34,067 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 41 [2018-11-23 04:51:34,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,072 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 04:51:34,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,100 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 25 treesize of output 38 [2018-11-23 04:51:34,102 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 18 treesize of output 17 [2018-11-23 04:51:34,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,131 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 98 treesize of output 108 [2018-11-23 04:51:34,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,135 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 04:51:34,135 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,146 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,158 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:129, output treesize:103 [2018-11-23 04:51:34,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 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 04:51:34,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,298 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:51:34,298 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 52 [2018-11-23 04:51:34,301 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 15 [2018-11-23 04:51:34,302 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,323 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-11-23 04:51:34,325 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 04:51:34,326 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,345 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 04:51:34,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,403 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 205 treesize of output 153 [2018-11-23 04:51:34,407 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 04:51:34,407 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,442 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 157 treesize of output 148 [2018-11-23 04:51:34,444 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 04:51:34,444 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,463 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,479 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 04:51:34,508 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-11-23 04:51:34,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,512 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 36 treesize of output 24 [2018-11-23 04:51:34,512 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,518 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,543 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 89 [2018-11-23 04:51:34,545 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 04:51:34,545 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,551 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:34,566 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:301, output treesize:135 [2018-11-23 04:51:34,646 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 111 [2018-11-23 04:51:34,648 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 04:51:34,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,697 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 301 treesize of output 205 [2018-11-23 04:51:34,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,701 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 04:51:34,701 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,754 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 120 [2018-11-23 04:51:34,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:34,758 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 04:51:34,758 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,765 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:34,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:34,783 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:330, output treesize:204 [2018-11-23 04:51:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:34,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:34,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2018-11-23 04:51:34,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 04:51:34,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 04:51:34,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-11-23 04:51:34,933 INFO L87 Difference]: Start difference. First operand 196 states and 249 transitions. Second operand 23 states. [2018-11-23 04:51:36,356 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 127 [2018-11-23 04:51:36,920 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 127 [2018-11-23 04:51:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:38,159 INFO L93 Difference]: Finished difference Result 378 states and 474 transitions. [2018-11-23 04:51:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 04:51:38,160 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-11-23 04:51:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:38,160 INFO L225 Difference]: With dead ends: 378 [2018-11-23 04:51:38,160 INFO L226 Difference]: Without dead ends: 312 [2018-11-23 04:51:38,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=495, Invalid=2927, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 04:51:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-23 04:51:38,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 209. [2018-11-23 04:51:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-23 04:51:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 265 transitions. [2018-11-23 04:51:38,192 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 265 transitions. Word has length 36 [2018-11-23 04:51:38,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:38,192 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 265 transitions. [2018-11-23 04:51:38,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 04:51:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 265 transitions. [2018-11-23 04:51:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 04:51:38,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:38,193 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-11-23 04:51:38,193 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:38,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:38,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1879765011, now seen corresponding path program 1 times [2018-11-23 04:51:38,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:38,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:38,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:38,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:51:38,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:38,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:38,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:51:38,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:38,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:38,662 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 04:51:38,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 04:51:38,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:38,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:38,682 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 04:51:38,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,698 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 04:51:38,699 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 04:51:38,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,707 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 04:51:38,709 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 04:51:38,709 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,713 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,716 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 04:51:38,726 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 04:51:38,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 8 treesize of output 7 [2018-11-23 04:51:38,727 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,733 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 04:51:38,735 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 04:51:38,735 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,738 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,741 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 04:51:38,748 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 04:51:38,748 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-23 04:51:38,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 04:51:38,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:38,776 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 04:51:38,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,796 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 04:51:38,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:38,799 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 04:51:38,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:58 [2018-11-23 04:51:38,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:38,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:38,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:38,834 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 04:51:38,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,867 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 158 treesize of output 131 [2018-11-23 04:51:38,870 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 26 treesize of output 23 [2018-11-23 04:51:38,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,893 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 118 treesize of output 122 [2018-11-23 04:51:38,894 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 04:51:38,894 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,905 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,914 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 04:51:38,932 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:51:38,933 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 89 treesize of output 76 [2018-11-23 04:51:38,934 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 35 treesize of output 30 [2018-11-23 04:51:38,935 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,949 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 04:51:38,950 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 04:51:38,951 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,957 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:38,961 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 04:51:38,973 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 04:51:38,973 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:176, output treesize:106 [2018-11-23 04:51:39,011 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 04:51:39,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,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 22 treesize of output 26 [2018-11-23 04:51:39,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,046 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 13 treesize of output 22 [2018-11-23 04:51:39,048 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 04:51:39,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,073 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 116 treesize of output 131 [2018-11-23 04:51:39,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,076 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 04:51:39,077 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,105 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:157, output treesize:139 [2018-11-23 04:51:39,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 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 04:51:39,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,212 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 400 treesize of output 309 [2018-11-23 04:51:39,219 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 59 treesize of output 90 [2018-11-23 04:51:39,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,293 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 304 treesize of output 291 [2018-11-23 04:51:39,297 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 04:51:39,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,364 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 04:51:39,405 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:39,407 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:39,441 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 51 [2018-11-23 04:51:39,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,446 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 36 treesize of output 63 [2018-11-23 04:51:39,446 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,458 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 105 [2018-11-23 04:51:39,460 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 40 treesize of output 39 [2018-11-23 04:51:39,461 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,466 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,470 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 04:51:39,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,499 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 248 treesize of output 217 [2018-11-23 04:51:39,501 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 42 treesize of output 66 [2018-11-23 04:51:39,502 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 228 [2018-11-23 04:51:39,527 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 04:51:39,527 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,542 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,552 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,568 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 04:51:39,568 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:434, output treesize:157 [2018-11-23 04:51:39,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,616 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 541 treesize of output 381 [2018-11-23 04:51:39,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,620 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 78 treesize of output 42 [2018-11-23 04:51:39,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,673 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 430 treesize of output 380 [2018-11-23 04:51:39,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,677 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 78 treesize of output 42 [2018-11-23 04:51:39,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,712 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 108 [2018-11-23 04:51:39,714 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 38 treesize of output 37 [2018-11-23 04:51:39,714 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,718 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,732 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 04:51:39,733 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:541, output treesize:303 [2018-11-23 04:51:39,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:39,866 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 333 treesize of output 225 [2018-11-23 04:51:39,868 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 04:51:39,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,886 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 73 treesize of output 40 [2018-11-23 04:51:39,887 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,901 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 91 treesize of output 31 [2018-11-23 04:51:39,901 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:39,914 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 62 treesize of output 50 [2018-11-23 04:51:39,915 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:39,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:39,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 58 treesize of output 52 [2018-11-23 04:51:39,943 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 24 treesize of output 11 [2018-11-23 04:51:39,944 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,951 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 04:51:39,951 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 04:51:39,955 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,958 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,966 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 04:51:39,966 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:333, output treesize:26 [2018-11-23 04:51:39,991 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 24 treesize of output 22 [2018-11-23 04:51:39,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:39,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,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 04:51:39,996 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:39,999 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 04:51:39,999 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-23 04:51:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:40,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:40,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2018-11-23 04:51:40,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 04:51:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 04:51:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=571, Unknown=1, NotChecked=0, Total=650 [2018-11-23 04:51:40,035 INFO L87 Difference]: Start difference. First operand 209 states and 265 transitions. Second operand 26 states. [2018-11-23 04:51:41,898 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 105 [2018-11-23 04:51:42,261 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2018-11-23 04:51:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:44,567 INFO L93 Difference]: Finished difference Result 407 states and 514 transitions. [2018-11-23 04:51:44,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-23 04:51:44,567 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2018-11-23 04:51:44,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:44,568 INFO L225 Difference]: With dead ends: 407 [2018-11-23 04:51:44,568 INFO L226 Difference]: Without dead ends: 405 [2018-11-23 04:51:44,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2397 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=833, Invalid=6476, Unknown=1, NotChecked=0, Total=7310 [2018-11-23 04:51:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-11-23 04:51:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 220. [2018-11-23 04:51:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-23 04:51:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 278 transitions. [2018-11-23 04:51:44,602 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 278 transitions. Word has length 36 [2018-11-23 04:51:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:44,602 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 278 transitions. [2018-11-23 04:51:44,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 04:51:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 278 transitions. [2018-11-23 04:51:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 04:51:44,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:44,603 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-11-23 04:51:44,603 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:44,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash -59686829, now seen corresponding path program 2 times [2018-11-23 04:51:44,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:44,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:44,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:44,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:44,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:45,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:45,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:51:45,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 04:51:45,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 04:51:45,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:51:45,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:45,166 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 04:51:45,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 04:51:45,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,184 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 04:51:45,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,201 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 04:51:45,202 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 04:51:45,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,211 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 04:51:45,213 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 04:51:45,213 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,220 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 04:51:45,231 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 04:51:45,233 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 04:51:45,233 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,239 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 04:51:45,240 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 04:51:45,240 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,243 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,246 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 04:51:45,254 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 04:51:45,254 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:53 [2018-11-23 04:51:45,280 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 38 treesize of output 44 [2018-11-23 04:51:45,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,284 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 37 [2018-11-23 04:51:45,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,307 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 45 treesize of output 44 [2018-11-23 04:51:45,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,311 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 04:51:45,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2018-11-23 04:51:45,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,333 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 04:51:45,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,369 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:51:45,369 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 62 treesize of output 49 [2018-11-23 04:51:45,371 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 23 treesize of output 15 [2018-11-23 04:51:45,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,386 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 30 treesize of output 47 [2018-11-23 04:51:45,388 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 04:51:45,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,399 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 04:51:45,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2018-11-23 04:51:45,425 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 27 treesize of output 24 [2018-11-23 04:51:45,425 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,439 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 51 treesize of output 71 [2018-11-23 04:51:45,441 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 04:51:45,441 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,449 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,454 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 04:51:45,466 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 04:51:45,466 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:155, output treesize:81 [2018-11-23 04:51:45,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,504 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 45 treesize of output 68 [2018-11-23 04:51:45,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,507 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 04:51:45,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,544 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 81 treesize of output 95 [2018-11-23 04:51:45,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,547 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 04:51:45,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,574 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 13 treesize of output 18 [2018-11-23 04:51:45,576 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 18 treesize of output 17 [2018-11-23 04:51:45,576 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,577 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,591 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:132, output treesize:106 [2018-11-23 04:51:45,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 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 04:51:45,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 212 [2018-11-23 04:51:45,708 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 44 treesize of output 52 [2018-11-23 04:51:45,709 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 205 [2018-11-23 04:51:45,764 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 04:51:45,765 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,809 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 04:51:45,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,847 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 93 treesize of output 87 [2018-11-23 04:51:45,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 22 treesize of output 15 [2018-11-23 04:51:45,851 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:45,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 114 [2018-11-23 04:51:45,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 04:51:45,877 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,888 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,894 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 04:51:45,912 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:45,915 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:45,934 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 79 treesize of output 37 [2018-11-23 04:51:45,936 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 31 [2018-11-23 04:51:45,937 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,945 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 46 treesize of output 67 [2018-11-23 04:51:45,947 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 04:51:45,947 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,951 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,955 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:45,968 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 04:51:45,968 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:299, output treesize:102 [2018-11-23 04:51:45,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 62 [2018-11-23 04:51:46,001 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 04:51:46,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:46,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:46,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:46,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:46,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:46,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:46,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:46,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:46,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 208 [2018-11-23 04:51:46,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:46,044 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 04:51:46,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:46,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:46,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:46,087 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 93 treesize of output 108 [2018-11-23 04:51:46,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:46,090 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 04:51:46,091 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:46,098 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:46,109 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 04:51:46,109 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:282, output treesize:156 [2018-11-23 04:51:46,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:46,209 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:51:46,211 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 190 [2018-11-23 04:51:46,213 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:51:46,213 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 17 treesize of output 9 [2018-11-23 04:51:46,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:46,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:46,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:46,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:46,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:46,263 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:373, output treesize:130 [2018-11-23 04:51:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:46,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:46,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2018-11-23 04:51:46,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 04:51:46,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 04:51:46,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=430, Unknown=1, NotChecked=0, Total=506 [2018-11-23 04:51:46,310 INFO L87 Difference]: Start difference. First operand 220 states and 278 transitions. Second operand 23 states. [2018-11-23 04:51:47,576 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 107 [2018-11-23 04:51:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:47,995 INFO L93 Difference]: Finished difference Result 326 states and 401 transitions. [2018-11-23 04:51:47,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 04:51:47,995 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-11-23 04:51:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:47,995 INFO L225 Difference]: With dead ends: 326 [2018-11-23 04:51:47,995 INFO L226 Difference]: Without dead ends: 284 [2018-11-23 04:51:47,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=271, Invalid=1534, Unknown=1, NotChecked=0, Total=1806 [2018-11-23 04:51:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-23 04:51:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 229. [2018-11-23 04:51:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-23 04:51:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 289 transitions. [2018-11-23 04:51:48,025 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 289 transitions. Word has length 36 [2018-11-23 04:51:48,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:48,025 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 289 transitions. [2018-11-23 04:51:48,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 04:51:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 289 transitions. [2018-11-23 04:51:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 04:51:48,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:48,025 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:48,026 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:48,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:48,026 INFO L82 PathProgramCache]: Analyzing trace with hash 202275801, now seen corresponding path program 1 times [2018-11-23 04:51:48,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:48,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:48,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:48,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:51:48,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:48,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:48,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:51:48,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:48,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:48,283 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 04:51:48,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 04:51:48,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:48,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:48,297 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 04:51:48,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,310 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 04:51:48,312 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 04:51:48,312 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,321 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 04:51:48,323 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 04:51:48,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,328 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,332 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 04:51:48,353 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 04:51:48,353 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:44, output treesize:29 [2018-11-23 04:51:48,389 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 60 treesize of output 50 [2018-11-23 04:51:48,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:48,393 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 04:51:48,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,402 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 04:51:48,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-11-23 04:51:48,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:48,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:48,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:48,530 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 04:51:48,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,549 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 91 treesize of output 91 [2018-11-23 04:51:48,551 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 16 treesize of output 1 [2018-11-23 04:51:48,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,560 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,573 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 31 treesize of output 36 [2018-11-23 04:51:48,574 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 16 treesize of output 1 [2018-11-23 04:51:48,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,585 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 51 [2018-11-23 04:51:48,587 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 31 treesize of output 23 [2018-11-23 04:51:48,587 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:48,595 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 16 treesize of output 3 [2018-11-23 04:51:48,595 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,600 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:48,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-11-23 04:51:48,606 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 04:51:48,607 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,607 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:48,612 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:137, output treesize:7 [2018-11-23 04:51:48,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:48,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:48,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-11-23 04:51:48,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 04:51:48,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 04:51:48,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:51:48,639 INFO L87 Difference]: Start difference. First operand 229 states and 289 transitions. Second operand 18 states. [2018-11-23 04:51:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:49,331 INFO L93 Difference]: Finished difference Result 363 states and 435 transitions. [2018-11-23 04:51:49,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 04:51:49,333 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-11-23 04:51:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:49,334 INFO L225 Difference]: With dead ends: 363 [2018-11-23 04:51:49,334 INFO L226 Difference]: Without dead ends: 324 [2018-11-23 04:51:49,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2018-11-23 04:51:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-11-23 04:51:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 234. [2018-11-23 04:51:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-23 04:51:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 294 transitions. [2018-11-23 04:51:49,364 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 294 transitions. Word has length 37 [2018-11-23 04:51:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:49,365 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 294 transitions. [2018-11-23 04:51:49,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 04:51:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2018-11-23 04:51:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 04:51:49,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:49,365 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:49,366 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:49,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1011622427, now seen corresponding path program 1 times [2018-11-23 04:51:49,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:49,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:49,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:49,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:49,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:49,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:49,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:51:49,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:49,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:49,607 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 04:51:49,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 04:51:49,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 04:51:49,629 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,635 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 04:51:49,635 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-23 04:51:49,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,644 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 04:51:49,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,679 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 25 treesize of output 20 [2018-11-23 04:51:49,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:51:49,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,713 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 04:51:49,715 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 04:51:49,716 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,726 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 04:51:49,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 8 treesize of output 7 [2018-11-23 04:51:49,728 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,732 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,754 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 04:51:49,755 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 04:51:49,755 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,763 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 04:51:49,764 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 04:51:49,764 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,768 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,771 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 04:51:49,786 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 25 treesize of output 30 [2018-11-23 04:51:49,788 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 16 treesize of output 15 [2018-11-23 04:51:49,788 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,791 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,801 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:116, output treesize:62 [2018-11-23 04:51:49,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,841 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 29 treesize of output 39 [2018-11-23 04:51:49,843 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 24 [2018-11-23 04:51:49,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,868 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 46 treesize of output 41 [2018-11-23 04:51:49,870 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 04:51:49,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,889 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 70 treesize of output 68 [2018-11-23 04:51:49,891 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 04:51:49,892 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,897 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,905 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:67 [2018-11-23 04:51:49,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,946 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 50 treesize of output 42 [2018-11-23 04:51:49,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-11-23 04:51:49,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,962 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 22 treesize of output 20 [2018-11-23 04:51:49,963 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 11 treesize of output 7 [2018-11-23 04:51:49,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:49,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:33 [2018-11-23 04:51:49,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:49,990 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 16 treesize of output 13 [2018-11-23 04:51:49,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:50,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:50,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:50,006 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 37 treesize of output 54 [2018-11-23 04:51:50,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 04:51:50,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:50,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:51:50,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:50,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:50,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:50,026 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 04:51:50,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 [2018-11-23 04:51:50,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:50,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:50,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:50,050 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 67 [2018-11-23 04:51:50,058 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 35 [2018-11-23 04:51:50,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 04:51:50,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:50,074 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 04:51:50,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-11-23 04:51:50,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:50,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:50,115 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 31 treesize of output 39 [2018-11-23 04:51:50,119 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 04:51:50,120 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 04:51:50,127 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 04:51:50,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:50,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:51:50,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:50,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:50,136 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 04:51:50,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:39, output treesize:3 [2018-11-23 04:51:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:51:50,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:51:50,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-11-23 04:51:50,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 04:51:50,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 04:51:50,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-23 04:51:50,163 INFO L87 Difference]: Start difference. First operand 234 states and 294 transitions. Second operand 20 states. [2018-11-23 04:51:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:51:51,493 INFO L93 Difference]: Finished difference Result 497 states and 593 transitions. [2018-11-23 04:51:51,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 04:51:51,493 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2018-11-23 04:51:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:51:51,495 INFO L225 Difference]: With dead ends: 497 [2018-11-23 04:51:51,495 INFO L226 Difference]: Without dead ends: 493 [2018-11-23 04:51:51,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=404, Invalid=1576, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 04:51:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-11-23 04:51:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 263. [2018-11-23 04:51:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-23 04:51:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 334 transitions. [2018-11-23 04:51:51,547 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 334 transitions. Word has length 37 [2018-11-23 04:51:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:51:51,547 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 334 transitions. [2018-11-23 04:51:51,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 04:51:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 334 transitions. [2018-11-23 04:51:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 04:51:51,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:51:51,548 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:51:51,548 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:51:51,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:51:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash -70039219, now seen corresponding path program 3 times [2018-11-23 04:51:51,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:51:51,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:51:51,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:51,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:51:51,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:51:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:51:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 04:51:51,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:51:51,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:51:51,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:51:52,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 04:51:52,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:51:52,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:51:52,185 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 04:51:52,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 04:51:52,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,204 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 04:51:52,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,221 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 04:51:52,222 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 04:51:52,223 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,231 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 04:51:52,233 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 04:51:52,233 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,237 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,240 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 04:51:52,252 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 04:51:52,253 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 04:51:52,253 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 04:51:52,261 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 04:51:52,261 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,264 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,275 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 04:51:52,275 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:53 [2018-11-23 04:51:52,300 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 38 treesize of output 44 [2018-11-23 04:51:52,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,304 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 37 [2018-11-23 04:51:52,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,328 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 45 treesize of output 44 [2018-11-23 04:51:52,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,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 04:51:52,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,349 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 04:51:52,350 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 04:51:52,350 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,352 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,362 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:104, output treesize:66 [2018-11-23 04:51:52,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,391 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 04:51:52,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,445 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 62 treesize of output 44 [2018-11-23 04:51:52,450 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 18 treesize of output 11 [2018-11-23 04:51:52,450 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,470 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 30 treesize of output 47 [2018-11-23 04:51:52,472 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 04:51:52,472 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,487 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 04:51:52,518 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 04:51:52,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 26 treesize of output 11 [2018-11-23 04:51:52,521 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,523 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,550 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 102 treesize of output 88 [2018-11-23 04:51:52,553 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 27 treesize of output 24 [2018-11-23 04:51:52,553 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,571 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 62 treesize of output 82 [2018-11-23 04:51:52,573 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 04:51:52,573 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,583 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,590 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 04:51:52,609 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 27 treesize of output 40 [2018-11-23 04:51:52,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 04:51:52,611 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,614 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,626 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 04:51:52,627 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:205, output treesize:78 [2018-11-23 04:51:52,655 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 41 [2018-11-23 04:51:52,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,658 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 04:51:52,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,686 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 25 treesize of output 38 [2018-11-23 04:51:52,688 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 18 treesize of output 17 [2018-11-23 04:51:52,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,717 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 98 treesize of output 108 [2018-11-23 04:51:52,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,720 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 04:51:52,720 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,731 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,743 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:129, output treesize:103 [2018-11-23 04:51:52,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 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 04:51:52,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,835 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 52 [2018-11-23 04:51:52,839 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 15 [2018-11-23 04:51:52,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,862 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-11-23 04:51:52,864 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 04:51:52,864 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,874 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,881 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 04:51:52,919 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-11-23 04:51:52,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,923 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 36 treesize of output 24 [2018-11-23 04:51:52,924 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,930 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,963 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 166 treesize of output 126 [2018-11-23 04:51:52,967 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 04:51:52,967 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:52,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:52,995 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 118 treesize of output 121 [2018-11-23 04:51:52,997 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 04:51:52,997 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,014 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,026 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 04:51:53,049 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 89 [2018-11-23 04:51:53,051 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 04:51:53,052 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,057 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:53,072 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:301, output treesize:120 [2018-11-23 04:51:53,111 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 87 [2018-11-23 04:51:53,113 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 04:51:53,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,149 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 34 treesize of output 45 [2018-11-23 04:51:53,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:53,153 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 53 [2018-11-23 04:51:53,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:53,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:53,189 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 158 treesize of output 147 [2018-11-23 04:51:53,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:53,192 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 04:51:53,193 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,208 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,223 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 04:51:53,223 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:171, output treesize:153 [2018-11-23 04:51:53,284 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 132 [2018-11-23 04:51:53,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:53,293 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 44 treesize of output 28 [2018-11-23 04:51:53,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,382 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:51:53,382 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 102 treesize of output 65 [2018-11-23 04:51:53,385 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 31 treesize of output 23 [2018-11-23 04:51:53,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,425 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 6 case distinctions, treesize of input 38 treesize of output 105 [2018-11-23 04:51:53,431 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 56 treesize of output 57 [2018-11-23 04:51:53,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,481 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 35 treesize of output 50 [2018-11-23 04:51:53,481 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,514 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:53,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:53,561 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 177 [2018-11-23 04:51:53,565 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 04:51:53,565 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:53,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:53,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:51:53,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 210 treesize of output 196 [2018-11-23 04:51:53,638 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-23 04:51:53,707 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:51:53,707 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:54,986 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:55,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 141 [2018-11-23 04:51:55,666 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:57,014 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 124 [2018-11-23 04:51:57,015 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:51:58,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 209 [2018-11-23 04:51:58,364 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 04:51:58,937 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 207 treesize of output 222 [2018-11-23 04:51:58,937 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 04:51:59,688 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 144 [2018-11-23 04:51:59,690 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 04:52:01,753 INFO L267 ElimStorePlain]: Start of recursive call 11: 11 dim-0 vars, 15 dim-1 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2018-11-23 04:52:02,100 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 12 xjuncts. [2018-11-23 04:52:02,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:02,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 280 [2018-11-23 04:52:02,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 12 treesize of output 19 [2018-11-23 04:52:02,484 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,507 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 176 [2018-11-23 04:52:02,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:02,519 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 39 [2018-11-23 04:52:02,519 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,540 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:02,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:02,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 215 [2018-11-23 04:52:02,553 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 19 [2018-11-23 04:52:02,554 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,576 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 181 [2018-11-23 04:52:02,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:02,589 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 39 [2018-11-23 04:52:02,589 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,611 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 131 [2018-11-23 04:52:02,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:02,623 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 39 [2018-11-23 04:52:02,623 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,642 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 181 [2018-11-23 04:52:02,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 59 [2018-11-23 04:52:02,660 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-23 04:52:02,683 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:52:02,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 205 [2018-11-23 04:52:02,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:02,697 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 39 [2018-11-23 04:52:02,697 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,720 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:02,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 237 treesize of output 327 [2018-11-23 04:52:02,757 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 04:52:02,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 259 treesize of output 298 [2018-11-23 04:52:02,778 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-11-23 04:52:03,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 249 [2018-11-23 04:52:03,489 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:03,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 250 [2018-11-23 04:52:03,857 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-11-23 04:52:03,993 INFO L267 ElimStorePlain]: Start of recursive call 33: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 04:52:04,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, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 192 [2018-11-23 04:52:04,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:04,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 32 treesize of output 51 [2018-11-23 04:52:04,006 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:04,022 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:04,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 150 [2018-11-23 04:52:04,033 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 23 [2018-11-23 04:52:04,033 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:04,048 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:04,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 146 [2018-11-23 04:52:04,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:04,061 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 28 treesize of output 47 [2018-11-23 04:52:04,061 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:04,079 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:04,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:04,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 228 [2018-11-23 04:52:04,097 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 19 [2018-11-23 04:52:04,097 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:04,122 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:04,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 37 dim-0 vars, and 14 xjuncts. [2018-11-23 04:52:04,586 INFO L202 ElimStorePlain]: Needed 44 recursive calls to eliminate 7 variables, input treesize:405, output treesize:2372 [2018-11-23 04:52:04,976 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 470 DAG size of output: 201 [2018-11-23 04:52:05,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 254 treesize of output 396 [2018-11-23 04:52:05,045 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:52:05,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:05,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 251 treesize of output 250 [2018-11-23 04:52:05,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:05,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:08,567 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 171 treesize of output 153 [2018-11-23 04:52:08,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 04:52:08,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:08,596 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:11,335 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 357 [2018-11-23 04:52:11,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:11,339 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 50 treesize of output 52 [2018-11-23 04:52:11,339 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:11,366 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:13,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:13,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:13,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 250 treesize of output 216 [2018-11-23 04:52:13,700 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 04:52:13,713 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:14,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:14,350 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 169 [2018-11-23 04:52:14,350 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 04:52:14,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:14,598 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 245 treesize of output 255 [2018-11-23 04:52:14,598 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:15,185 INFO L267 ElimStorePlain]: Start of recursive call 9: 8 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-23 04:52:17,955 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 304 [2018-11-23 04:52:17,957 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 16 treesize of output 15 [2018-11-23 04:52:17,957 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:17,979 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:20,162 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:20,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:20,167 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 287 treesize of output 184 [2018-11-23 04:52:20,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:20,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:20,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:20,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 214 [2018-11-23 04:52:20,174 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:20,196 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:22,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 223 [2018-11-23 04:52:22,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:22,027 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 28 [2018-11-23 04:52:22,027 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:22,049 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:23,571 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:52:23,571 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 184 [2018-11-23 04:52:23,573 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 15 [2018-11-23 04:52:23,573 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:23,591 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:24,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:24,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:24,755 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 155 [2018-11-23 04:52:24,758 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 15 [2018-11-23 04:52:24,758 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:24,779 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:25,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:25,759 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 228 treesize of output 247 [2018-11-23 04:52:25,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:25,763 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 63 [2018-11-23 04:52:25,764 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:25,788 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:25,794 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 153 treesize of output 160 [2018-11-23 04:52:25,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:25,797 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 47 [2018-11-23 04:52:25,798 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:25,819 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:25,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:25,827 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 204 treesize of output 219 [2018-11-23 04:52:25,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:25,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 34 treesize of output 55 [2018-11-23 04:52:25,831 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:25,856 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:25,879 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 6 case distinctions, treesize of input 235 treesize of output 256 [2018-11-23 04:52:25,883 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:52:25,883 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:26,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:26,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 183 [2018-11-23 04:52:26,040 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-11-23 04:52:26,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:26,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 240 [2018-11-23 04:52:26,246 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:26,303 INFO L267 ElimStorePlain]: Start of recursive call 29: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:52:27,140 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 374 treesize of output 305 [2018-11-23 04:52:27,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:27,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:27,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:27,147 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 77 treesize of output 141 [2018-11-23 04:52:27,147 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:27,176 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:27,879 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 201 [2018-11-23 04:52:27,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:27,883 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 32 [2018-11-23 04:52:27,883 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:27,909 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:28,500 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 310 [2018-11-23 04:52:28,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 04:52:28,502 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:28,524 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:29,020 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:52:29,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 174 [2018-11-23 04:52:29,025 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 18 treesize of output 11 [2018-11-23 04:52:29,025 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:29,046 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:29,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:29,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:29,470 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 293 treesize of output 201 [2018-11-23 04:52:29,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:29,474 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 58 treesize of output 56 [2018-11-23 04:52:29,474 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:29,496 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:29,859 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 160 treesize of output 150 [2018-11-23 04:52:29,861 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 04:52:29,861 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:29,877 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:30,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 153 [2018-11-23 04:52:30,228 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 04:52:30,228 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:30,247 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:30,552 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 147 [2018-11-23 04:52:30,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 04:52:30,554 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:30,571 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:30,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 18 dim-2 vars, End of recursive call: 22 dim-0 vars, and 10 xjuncts. [2018-11-23 04:52:30,860 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 33 variables, input treesize:1588, output treesize:1907 [2018-11-23 04:52:31,139 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 159 [2018-11-23 04:52:31,660 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 166 [2018-11-23 04:52:31,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:31,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:31,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 124 [2018-11-23 04:52:31,771 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2018-11-23 04:52:31,772 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 04:52:31,797 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 04:52:31,797 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:31,814 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 52 treesize of output 40 [2018-11-23 04:52:31,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:31,829 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 04:52:31,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 76 [2018-11-23 04:52:31,890 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 04:52:31,890 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:31,904 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 04:52:31,904 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:31,917 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 04:52:31,917 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:31,927 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:31,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:31,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:31,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:31,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:31,993 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 239 treesize of output 172 [2018-11-23 04:52:32,001 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 161 [2018-11-23 04:52:32,002 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 04:52:32,171 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 147 treesize of output 139 [2018-11-23 04:52:32,171 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:32,330 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 141 treesize of output 146 [2018-11-23 04:52:32,330 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:32,474 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 114 [2018-11-23 04:52:32,474 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:32,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 124 [2018-11-23 04:52:32,622 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 04:52:32,806 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 146 treesize of output 133 [2018-11-23 04:52:32,806 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:32,985 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 110 treesize of output 97 [2018-11-23 04:52:32,985 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:32,986 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 120 treesize of output 105 [2018-11-23 04:52:32,987 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:33,157 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 133 treesize of output 113 [2018-11-23 04:52:33,158 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:33,326 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 149 treesize of output 147 [2018-11-23 04:52:33,326 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:33,327 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 143 treesize of output 141 [2018-11-23 04:52:33,328 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:33,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2018-11-23 04:52:33,495 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:33,498 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 138 treesize of output 126 [2018-11-23 04:52:33,498 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:33,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 117 [2018-11-23 04:52:33,674 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-23 04:52:33,676 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 120 treesize of output 105 [2018-11-23 04:52:33,676 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:33,838 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 114 treesize of output 101 [2018-11-23 04:52:33,838 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:33,977 INFO L267 ElimStorePlain]: Start of recursive call 10: 12 dim-1 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2018-11-23 04:52:34,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 103 [2018-11-23 04:52:34,165 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 99 treesize of output 84 [2018-11-23 04:52:34,166 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,208 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 84 treesize of output 77 [2018-11-23 04:52:34,208 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,248 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 95 treesize of output 88 [2018-11-23 04:52:34,248 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,292 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 88 treesize of output 68 [2018-11-23 04:52:34,293 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,329 INFO L267 ElimStorePlain]: Start of recursive call 27: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 103 [2018-11-23 04:52:34,338 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 95 treesize of output 83 [2018-11-23 04:52:34,339 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,389 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 83 treesize of output 76 [2018-11-23 04:52:34,389 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,461 INFO L267 ElimStorePlain]: Start of recursive call 32: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 97 [2018-11-23 04:52:34,469 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 93 treesize of output 84 [2018-11-23 04:52:34,470 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2018-11-23 04:52:34,514 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,557 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 79 treesize of output 72 [2018-11-23 04:52:34,557 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 75 [2018-11-23 04:52:34,600 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,638 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 75 treesize of output 68 [2018-11-23 04:52:34,638 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,663 INFO L267 ElimStorePlain]: Start of recursive call 35: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 103 [2018-11-23 04:52:34,672 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 99 treesize of output 92 [2018-11-23 04:52:34,672 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,723 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 95 treesize of output 88 [2018-11-23 04:52:34,724 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,774 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 88 treesize of output 76 [2018-11-23 04:52:34,774 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,831 INFO L267 ElimStorePlain]: Start of recursive call 41: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 95 [2018-11-23 04:52:34,839 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 91 treesize of output 84 [2018-11-23 04:52:34,839 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,885 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 87 treesize of output 75 [2018-11-23 04:52:34,885 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,926 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 75 treesize of output 68 [2018-11-23 04:52:34,927 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,976 INFO L267 ElimStorePlain]: Start of recursive call 45: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:34,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 103 [2018-11-23 04:52:34,984 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 99 treesize of output 92 [2018-11-23 04:52:34,985 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,036 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 92 treesize of output 85 [2018-11-23 04:52:35,037 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,087 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 95 treesize of output 88 [2018-11-23 04:52:35,087 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,136 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 85 treesize of output 80 [2018-11-23 04:52:35,137 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,184 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 88 treesize of output 76 [2018-11-23 04:52:35,185 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,213 INFO L267 ElimStorePlain]: Start of recursive call 49: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:35,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:35,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:35,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:35,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:35,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 127 [2018-11-23 04:52:35,367 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 47 treesize of output 47 [2018-11-23 04:52:35,368 INFO L267 ElimStorePlain]: Start of recursive call 56: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 04:52:35,396 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 04:52:35,396 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,420 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 65 treesize of output 50 [2018-11-23 04:52:35,421 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 62 [2018-11-23 04:52:35,426 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-11-23 04:52:35,461 INFO L267 ElimStorePlain]: Start of recursive call 55: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 04:52:35,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 84 treesize of output 78 [2018-11-23 04:52:35,634 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 04:52:35,634 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,649 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 04:52:35,649 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,664 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 04:52:35,664 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,692 INFO L267 ElimStorePlain]: Start of recursive call 60: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 84 treesize of output 74 [2018-11-23 04:52:35,698 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 04:52:35,698 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,726 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 04:52:35,726 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,741 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 04:52:35,742 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,761 INFO L267 ElimStorePlain]: Start of recursive call 64: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:35,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 6 dim-2 vars, End of recursive call: 37 dim-0 vars, and 9 xjuncts. [2018-11-23 04:52:35,935 INFO L202 ElimStorePlain]: Needed 67 recursive calls to eliminate 17 variables, input treesize:514, output treesize:468 [2018-11-23 04:52:36,070 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 33 treesize of output 37 [2018-11-23 04:52:36,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:52:36,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:36,077 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 04:52:36,077 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:36,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:52:36,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:36,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:36,085 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 04:52:36,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:49, output treesize:3 [2018-11-23 04:52:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:52:36,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:52:36,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 26 [2018-11-23 04:52:36,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 04:52:36,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 04:52:36,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-11-23 04:52:36,134 INFO L87 Difference]: Start difference. First operand 263 states and 334 transitions. Second operand 26 states. [2018-11-23 04:52:36,897 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 146 [2018-11-23 04:52:39,188 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 100 [2018-11-23 04:52:40,179 WARN L180 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 250 [2018-11-23 04:52:41,298 WARN L180 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 262 [2018-11-23 04:52:44,869 WARN L180 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 269 [2018-11-23 04:52:45,512 WARN L180 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 245 [2018-11-23 04:52:45,666 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2018-11-23 04:52:47,807 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 180 [2018-11-23 04:52:50,166 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 182 [2018-11-23 04:52:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:52:50,497 INFO L93 Difference]: Finished difference Result 399 states and 507 transitions. [2018-11-23 04:52:50,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 04:52:50,497 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-11-23 04:52:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:52:50,498 INFO L225 Difference]: With dead ends: 399 [2018-11-23 04:52:50,498 INFO L226 Difference]: Without dead ends: 397 [2018-11-23 04:52:50,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=404, Invalid=3017, Unknown=1, NotChecked=0, Total=3422 [2018-11-23 04:52:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-11-23 04:52:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 279. [2018-11-23 04:52:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-23 04:52:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 356 transitions. [2018-11-23 04:52:50,539 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 356 transitions. Word has length 37 [2018-11-23 04:52:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:52:50,539 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 356 transitions. [2018-11-23 04:52:50,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 04:52:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 356 transitions. [2018-11-23 04:52:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 04:52:50,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:52:50,539 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:52:50,539 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:52:50,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:52:50,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1295032815, now seen corresponding path program 1 times [2018-11-23 04:52:50,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:52:50,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:52:50,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:52:50,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:52:50,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:52:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:52:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:52:50,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:52:50,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:52:50,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:52:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:52:50,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:52:50,817 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 04:52:50,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 04:52:50,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 04:52:50,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,826 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,831 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 04:52:50,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-23 04:52:50,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:50,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:50,837 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 04:52:50,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,855 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 04:52:50,857 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 04:52:50,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,865 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 04:52:50,867 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 04:52:50,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,871 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,874 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 04:52:50,886 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:50,888 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:50,901 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 41 treesize of output 31 [2018-11-23 04:52:50,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:50,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 04:52:50,904 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,911 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 32 treesize of output 37 [2018-11-23 04:52:50,913 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 16 treesize of output 15 [2018-11-23 04:52:50,913 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,917 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,919 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 04:52:50,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,927 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:86, output treesize:41 [2018-11-23 04:52:50,944 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 81 treesize of output 71 [2018-11-23 04:52:50,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:50,947 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 04:52:50,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,964 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 31 treesize of output 32 [2018-11-23 04:52:50,965 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 04:52:50,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:50,976 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 04:52:50,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:98, output treesize:59 [2018-11-23 04:52:51,016 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 49 treesize of output 35 [2018-11-23 04:52:51,025 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 04:52:51,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:51,031 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 30 treesize of output 19 [2018-11-23 04:52:51,031 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:51,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:51,040 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 04:52:51,040 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:66, output treesize:36 [2018-11-23 04:52:51,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:51,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:51,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:51,060 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 16 treesize of output 13 [2018-11-23 04:52:51,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:51,075 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 39 treesize of output 48 [2018-11-23 04:52:51,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 04:52:51,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:51,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:52:51,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:51,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:51,087 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:51,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:51,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:61, output treesize:43 [2018-11-23 04:52:51,117 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 43 treesize of output 50 [2018-11-23 04:52:51,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 15 [2018-11-23 04:52:51,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 04:52:51,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:52:51,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-23 04:52:51,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:58, output treesize:70 [2018-11-23 04:52:51,186 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 24 treesize of output 22 [2018-11-23 04:52:51,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:52:51,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:51,191 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 04:52:51,191 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:51,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:51,194 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 04:52:51,194 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-23 04:52:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:52:51,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:52:51,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-23 04:52:51,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 04:52:51,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 04:52:51,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=305, Unknown=1, NotChecked=0, Total=380 [2018-11-23 04:52:51,224 INFO L87 Difference]: Start difference. First operand 279 states and 356 transitions. Second operand 20 states. [2018-11-23 04:52:52,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:52:52,153 INFO L93 Difference]: Finished difference Result 463 states and 558 transitions. [2018-11-23 04:52:52,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 04:52:52,153 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-11-23 04:52:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:52:52,154 INFO L225 Difference]: With dead ends: 463 [2018-11-23 04:52:52,154 INFO L226 Difference]: Without dead ends: 455 [2018-11-23 04:52:52,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=302, Invalid=1103, Unknown=1, NotChecked=0, Total=1406 [2018-11-23 04:52:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-11-23 04:52:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 270. [2018-11-23 04:52:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-23 04:52:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 346 transitions. [2018-11-23 04:52:52,198 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 346 transitions. Word has length 38 [2018-11-23 04:52:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:52:52,199 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 346 transitions. [2018-11-23 04:52:52,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 04:52:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 346 transitions. [2018-11-23 04:52:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 04:52:52,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:52:52,200 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 04:52:52,200 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:52:52,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:52:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash 468780934, now seen corresponding path program 2 times [2018-11-23 04:52:52,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:52:52,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:52:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:52:52,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:52:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:52:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:52:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:52:52,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:52:52,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:52:52,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 04:52:52,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 04:52:52,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:52:52,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:52:52,399 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 04:52:52,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 04:52:52,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,424 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 04:52:52,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,445 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 04:52:52,447 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 04:52:52,447 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,458 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 04:52:52,460 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 04:52:52,460 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,471 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 04:52:52,483 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 04:52:52,489 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 04:52:52,489 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,497 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 04:52:52,499 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 04:52:52,499 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,505 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,507 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 04:52:52,516 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 04:52:52,516 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:53 [2018-11-23 04:52:52,535 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 45 treesize of output 44 [2018-11-23 04:52:52,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,538 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 04:52:52,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,559 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 38 treesize of output 44 [2018-11-23 04:52:52,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,562 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 37 [2018-11-23 04:52:52,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,575 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2018-11-23 04:52:52,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,582 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 04:52:52,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,607 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 62 treesize of output 44 [2018-11-23 04:52:52,610 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 18 treesize of output 11 [2018-11-23 04:52:52,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,625 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 30 treesize of output 47 [2018-11-23 04:52:52,626 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 04:52:52,627 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,634 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,639 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 04:52:52,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,656 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 82 treesize of output 74 [2018-11-23 04:52:52,658 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 33 treesize of output 28 [2018-11-23 04:52:52,658 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,672 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 42 treesize of output 62 [2018-11-23 04:52:52,674 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 04:52:52,674 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,680 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,685 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 04:52:52,693 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 04:52:52,693 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:150, output treesize:52 [2018-11-23 04:52:52,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 126 [2018-11-23 04:52:52,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,719 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 04:52:52,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,743 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 66 treesize of output 57 [2018-11-23 04:52:52,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,746 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 04:52:52,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,758 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 04:52:52,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:167, output treesize:81 [2018-11-23 04:52:52,795 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 30 treesize of output 28 [2018-11-23 04:52:52,797 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 04:52:52,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,801 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 04:52:52,801 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,808 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 04:52:52,808 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:92, output treesize:66 [2018-11-23 04:52:52,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:52,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-11-23 04:52:52,829 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 04:52:52,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,834 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 21 treesize of output 15 [2018-11-23 04:52:52,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,835 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 6 treesize of output 4 [2018-11-23 04:52:52,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:52,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:1 [2018-11-23 04:52:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:52:52,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:52:52,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2018-11-23 04:52:52,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 04:52:52,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 04:52:52,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-11-23 04:52:52,864 INFO L87 Difference]: Start difference. First operand 270 states and 346 transitions. Second operand 18 states. [2018-11-23 04:52:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:52:54,309 INFO L93 Difference]: Finished difference Result 586 states and 711 transitions. [2018-11-23 04:52:54,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 04:52:54,310 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-11-23 04:52:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:52:54,311 INFO L225 Difference]: With dead ends: 586 [2018-11-23 04:52:54,311 INFO L226 Difference]: Without dead ends: 539 [2018-11-23 04:52:54,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=573, Invalid=1977, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 04:52:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-11-23 04:52:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 278. [2018-11-23 04:52:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-23 04:52:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 354 transitions. [2018-11-23 04:52:54,357 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 354 transitions. Word has length 38 [2018-11-23 04:52:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:52:54,357 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 354 transitions. [2018-11-23 04:52:54,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 04:52:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 354 transitions. [2018-11-23 04:52:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 04:52:54,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:52:54,358 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:52:54,358 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:52:54,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:52:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2107298042, now seen corresponding path program 1 times [2018-11-23 04:52:54,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:52:54,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:52:54,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:52:54,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:52:54,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:52:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:52:54,858 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 04:52:54,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:52:54,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:52:54,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:52:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:52:54,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:52:54,890 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 04:52:54,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:54,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 04:52:54,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 04:52:54,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:54,901 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:54,906 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 04:52:54,907 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-23 04:52:54,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:54,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:54,913 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 04:52:54,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:54,929 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 04:52:54,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:54,948 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 41 treesize of output 31 [2018-11-23 04:52:54,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:54,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 04:52:54,952 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:54,962 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 32 treesize of output 33 [2018-11-23 04:52:54,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, 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 1 [2018-11-23 04:52:54,964 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:54,969 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:54,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:54,984 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 04:52:54,986 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 04:52:54,986 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:54,993 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 04:52:54,995 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 04:52:54,995 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:54,999 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,003 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 04:52:55,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,012 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:86, output treesize:41 [2018-11-23 04:52:55,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-11-23 04:52:55,041 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 04:52:55,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,064 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 47 treesize of output 46 [2018-11-23 04:52:55,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,067 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 04:52:55,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:54 [2018-11-23 04:52:55,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,115 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 04:52:55,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,147 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 04:52:55,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:55,187 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 70 treesize of output 52 [2018-11-23 04:52:55,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-23 04:52:55,193 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,214 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 04:52:55,217 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 1 [2018-11-23 04:52:55,217 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,227 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,234 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,266 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 104 treesize of output 81 [2018-11-23 04:52:55,269 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 04:52:55,270 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,284 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 72 treesize of output 76 [2018-11-23 04:52:55,286 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 04:52:55,286 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,295 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,303 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 04:52:55,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:55,318 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:155, output treesize:83 [2018-11-23 04:52:55,389 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 52 treesize of output 77 [2018-11-23 04:52:55,391 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 18 treesize of output 17 [2018-11-23 04:52:55,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,425 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 147 treesize of output 112 [2018-11-23 04:52:55,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,429 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 04:52:55,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,456 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 04:52:55,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:176, output treesize:121 [2018-11-23 04:52:55,535 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 111 treesize of output 72 [2018-11-23 04:52:55,537 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 38 treesize of output 25 [2018-11-23 04:52:55,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,548 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 04:52:55,548 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,558 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 31 treesize of output 23 [2018-11-23 04:52:55,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:55,567 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 04:52:55,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:55,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:128, output treesize:58 [2018-11-23 04:52:55,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-23 04:52:55,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 69 [2018-11-23 04:52:55,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 04:52:55,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:52:55,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,679 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:55,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:64 [2018-11-23 04:52:55,733 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 04:52:55,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:52:55,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 82 [2018-11-23 04:52:55,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:52:55,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 04:52:55,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 78 [2018-11-23 04:52:55,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 15 [2018-11-23 04:52:55,807 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 04:52:55,820 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:52:55,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:52:55,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-11-23 04:52:55,858 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:94, output treesize:108 [2018-11-23 04:52:55,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-11-23 04:52:55,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:52:55,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:52:55,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,962 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 04:52:55,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:52:55,969 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 04:52:55,969 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2018-11-23 04:52:55,990 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 04:52:56,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:52:56,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-11-23 04:52:56,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 04:52:56,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 04:52:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-11-23 04:52:56,005 INFO L87 Difference]: Start difference. First operand 278 states and 354 transitions. Second operand 25 states. [2018-11-23 04:53:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:03,575 INFO L93 Difference]: Finished difference Result 560 states and 664 transitions. [2018-11-23 04:53:03,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 04:53:03,575 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 38 [2018-11-23 04:53:03,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:53:03,576 INFO L225 Difference]: With dead ends: 560 [2018-11-23 04:53:03,576 INFO L226 Difference]: Without dead ends: 558 [2018-11-23 04:53:03,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=774, Invalid=4194, Unknown=2, NotChecked=0, Total=4970 [2018-11-23 04:53:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-11-23 04:53:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 284. [2018-11-23 04:53:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-23 04:53:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 361 transitions. [2018-11-23 04:53:03,635 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 361 transitions. Word has length 38 [2018-11-23 04:53:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:53:03,635 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 361 transitions. [2018-11-23 04:53:03,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 04:53:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 361 transitions. [2018-11-23 04:53:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 04:53:03,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:53:03,636 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 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] [2018-11-23 04:53:03,636 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:53:03,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:03,637 INFO L82 PathProgramCache]: Analyzing trace with hash 425041747, now seen corresponding path program 1 times [2018-11-23 04:53:03,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:03,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:03,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:03,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:53:03,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:53:03,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:53:03,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:03,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:53:03,921 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 04:53:03,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:03,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:03,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 04:53:03,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:03,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:03,942 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 04:53:03,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:03,957 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 04:53:03,959 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 04:53:03,959 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:03,969 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 04:53:03,971 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 04:53:03,971 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:03,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:03,979 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 04:53:03,990 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 04:53:03,991 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 04:53:03,991 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:03,998 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 04:53:03,999 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 04:53:04,000 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,003 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,006 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 04:53:04,013 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 04:53:04,014 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-23 04:53:04,035 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 04:53:04,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:04,039 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 04:53:04,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,058 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 04:53:04,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:04,061 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 04:53:04,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,074 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:58 [2018-11-23 04:53:04,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:04,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:04,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:04,092 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 04:53:04,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,117 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:04,118 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 127 [2018-11-23 04:53:04,120 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 35 treesize of output 30 [2018-11-23 04:53:04,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,138 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 100 treesize of output 117 [2018-11-23 04:53:04,140 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 04:53:04,140 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,150 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,157 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 04:53:04,171 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 117 treesize of output 90 [2018-11-23 04:53:04,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 04:53:04,174 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,186 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 77 treesize of output 81 [2018-11-23 04:53:04,188 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 04:53:04,188 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,202 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 04:53:04,211 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 04:53:04,211 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:170, output treesize:99 [2018-11-23 04:53:04,237 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 223 treesize of output 205 [2018-11-23 04:53:04,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:04,240 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 48 [2018-11-23 04:53:04,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,275 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 173 treesize of output 134 [2018-11-23 04:53:04,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:04,279 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 48 [2018-11-23 04:53:04,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:04,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:231, output treesize:129 [2018-11-23 04:53:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:53:04,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:53:04,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2018-11-23 04:53:04,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 04:53:04,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 04:53:04,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-23 04:53:04,407 INFO L87 Difference]: Start difference. First operand 284 states and 361 transitions. Second operand 20 states. [2018-11-23 04:53:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:05,775 INFO L93 Difference]: Finished difference Result 408 states and 507 transitions. [2018-11-23 04:53:05,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 04:53:05,775 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-11-23 04:53:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:53:05,776 INFO L225 Difference]: With dead ends: 408 [2018-11-23 04:53:05,776 INFO L226 Difference]: Without dead ends: 357 [2018-11-23 04:53:05,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=298, Invalid=1957, Unknown=1, NotChecked=0, Total=2256 [2018-11-23 04:53:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-23 04:53:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 297. [2018-11-23 04:53:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-23 04:53:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 380 transitions. [2018-11-23 04:53:05,839 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 380 transitions. Word has length 38 [2018-11-23 04:53:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:53:05,839 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 380 transitions. [2018-11-23 04:53:05,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 04:53:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 380 transitions. [2018-11-23 04:53:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 04:53:05,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:53:05,839 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:53:05,840 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:53:05,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:05,840 INFO L82 PathProgramCache]: Analyzing trace with hash -902221212, now seen corresponding path program 1 times [2018-11-23 04:53:05,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:05,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:05,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:05,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:05,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:06,268 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 04:53:06,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:53:06,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:53:06,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:06,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:53:06,301 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 04:53:06,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 04:53:06,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 04:53:06,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,310 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,315 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 04:53:06,315 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-23 04:53:06,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:06,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:06,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 04:53:06,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,345 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 04:53:06,348 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 04:53:06,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,358 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 04:53:06,361 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 04:53:06,361 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,369 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 04:53:06,384 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:06,386 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:06,399 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 41 treesize of output 31 [2018-11-23 04:53:06,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:06,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 04:53:06,402 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,411 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 32 treesize of output 37 [2018-11-23 04:53:06,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 16 treesize of output 15 [2018-11-23 04:53:06,413 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,417 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,420 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 04:53:06,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,428 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:86, output treesize:41 [2018-11-23 04:53:06,455 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 34 treesize of output 33 [2018-11-23 04:53:06,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:06,459 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 04:53:06,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-11-23 04:53:06,480 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 04:53:06,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:54 [2018-11-23 04:53:06,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:06,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:06,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:06,527 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 04:53:06,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,568 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 04:53:06,572 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:06,609 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 70 treesize of output 52 [2018-11-23 04:53:06,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:06,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-23 04:53:06,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,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 49 treesize of output 66 [2018-11-23 04:53:06,634 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 1 [2018-11-23 04:53:06,634 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,642 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,647 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,672 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 104 treesize of output 81 [2018-11-23 04:53:06,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 04:53:06,675 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,692 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 72 treesize of output 76 [2018-11-23 04:53:06,693 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 04:53:06,694 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,703 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,713 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 04:53:06,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:06,730 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:155, output treesize:83 [2018-11-23 04:53:06,813 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 159 treesize of output 120 [2018-11-23 04:53:06,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:06,817 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 04:53:06,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,857 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 52 treesize of output 77 [2018-11-23 04:53:06,860 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 18 treesize of output 17 [2018-11-23 04:53:06,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,885 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 04:53:06,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:176, output treesize:121 [2018-11-23 04:53:06,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 72 [2018-11-23 04:53:06,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2018-11-23 04:53:06,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:06,990 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 31 treesize of output 23 [2018-11-23 04:53:06,991 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 04:53:07,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 04:53:07,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:07,010 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 04:53:07,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:07,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:128, output treesize:58 [2018-11-23 04:53:07,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:07,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:07,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:07,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:07,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-23 04:53:07,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:07,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 69 [2018-11-23 04:53:07,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 04:53:07,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:07,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:53:07,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:07,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:07,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:07,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:07,125 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:64 [2018-11-23 04:53:07,161 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 04:53:07,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:07,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 82 [2018-11-23 04:53:07,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:07,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 04:53:07,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:07,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 78 [2018-11-23 04:53:07,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 15 [2018-11-23 04:53:07,223 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 04:53:07,234 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:53:07,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:53:07,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-11-23 04:53:07,272 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:94, output treesize:108 [2018-11-23 04:53:07,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-11-23 04:53:07,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:07,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:07,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:07,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:07,366 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 04:53:07,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:07,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:07,370 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 04:53:07,370 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2018-11-23 04:53:07,393 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 04:53:07,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:53:07,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-11-23 04:53:07,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 04:53:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 04:53:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-11-23 04:53:07,408 INFO L87 Difference]: Start difference. First operand 297 states and 380 transitions. Second operand 26 states. [2018-11-23 04:53:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:16,932 INFO L93 Difference]: Finished difference Result 556 states and 660 transitions. [2018-11-23 04:53:16,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 04:53:16,933 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39 [2018-11-23 04:53:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:53:16,934 INFO L225 Difference]: With dead ends: 556 [2018-11-23 04:53:16,934 INFO L226 Difference]: Without dead ends: 548 [2018-11-23 04:53:16,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=751, Invalid=4076, Unknown=3, NotChecked=0, Total=4830 [2018-11-23 04:53:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-11-23 04:53:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 297. [2018-11-23 04:53:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-23 04:53:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 379 transitions. [2018-11-23 04:53:17,007 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 379 transitions. Word has length 39 [2018-11-23 04:53:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:53:17,007 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 379 transitions. [2018-11-23 04:53:17,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 04:53:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 379 transitions. [2018-11-23 04:53:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 04:53:17,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:53:17,008 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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 04:53:17,008 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:53:17,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash -256940264, now seen corresponding path program 3 times [2018-11-23 04:53:17,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:53:17,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:53:17,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:53:17,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:53:17,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 04:53:17,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:53:17,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:53:17,510 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 04:53:17,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 04:53:17,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,535 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 04:53:17,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,558 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 04:53:17,560 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 04:53:17,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,573 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 04:53:17,575 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 04:53:17,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,583 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 04:53:17,595 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 04:53:17,596 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 04:53:17,597 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,603 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 04:53:17,610 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 04:53:17,610 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,614 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,616 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 04:53:17,625 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 04:53:17,625 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:53 [2018-11-23 04:53:17,652 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 45 treesize of output 44 [2018-11-23 04:53:17,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,655 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 04:53:17,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-11-23 04:53:17,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,680 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 37 [2018-11-23 04:53:17,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,694 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2018-11-23 04:53:17,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,700 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 04:53:17,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,737 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 134 treesize of output 120 [2018-11-23 04:53:17,741 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 27 treesize of output 24 [2018-11-23 04:53:17,741 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,763 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 94 treesize of output 114 [2018-11-23 04:53:17,765 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 04:53:17,765 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,777 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,785 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 04:53:17,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,804 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:17,805 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 62 treesize of output 49 [2018-11-23 04:53:17,807 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 23 treesize of output 15 [2018-11-23 04:53:17,807 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,818 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 30 treesize of output 55 [2018-11-23 04:53:17,820 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 16 treesize of output 15 [2018-11-23 04:53:17,820 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,826 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,830 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 04:53:17,842 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 04:53:17,842 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:155, output treesize:89 [2018-11-23 04:53:17,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,886 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 81 treesize of output 95 [2018-11-23 04:53:17,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,889 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 04:53:17,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 95 [2018-11-23 04:53:17,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,927 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 04:53:17,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:89 [2018-11-23 04:53:17,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 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 04:53:17,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:17,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:17,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 174 [2018-11-23 04:53:18,004 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 44 treesize of output 52 [2018-11-23 04:53:18,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 167 [2018-11-23 04:53:18,042 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 04:53:18,042 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,059 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,075 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 04:53:18,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,095 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:18,098 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 93 treesize of output 92 [2018-11-23 04:53:18,100 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 27 treesize of output 19 [2018-11-23 04:53:18,100 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 114 [2018-11-23 04:53:18,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 04:53:18,120 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,129 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,134 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 04:53:18,145 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 04:53:18,145 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:233, output treesize:105 [2018-11-23 04:53:18,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 20 [2018-11-23 04:53:18,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-23 04:53:18,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 198 [2018-11-23 04:53:18,251 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 42 treesize of output 19 [2018-11-23 04:53:18,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 171 [2018-11-23 04:53:18,308 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 42 treesize of output 19 [2018-11-23 04:53:18,308 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,320 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,334 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:275, output treesize:157 [2018-11-23 04:53:18,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,551 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:18,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:18,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 188 [2018-11-23 04:53:18,566 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:18,579 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 110 [2018-11-23 04:53:18,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-11-23 04:53:18,611 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 89 treesize of output 79 [2018-11-23 04:53:18,611 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 04:53:18,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 42 [2018-11-23 04:53:18,624 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:18,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:18,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-11-23 04:53:18,657 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 04:53:18,657 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,666 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 20 treesize of output 11 [2018-11-23 04:53:18,666 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,670 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 04:53:18,670 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,671 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,679 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:213, output treesize:11 [2018-11-23 04:53:18,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 04:53:18,694 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 04:53:18,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:18,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 04:53:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:53:18,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:53:18,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 26 [2018-11-23 04:53:18,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 04:53:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 04:53:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-11-23 04:53:18,746 INFO L87 Difference]: Start difference. First operand 297 states and 379 transitions. Second operand 26 states. [2018-11-23 04:53:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:22,574 INFO L93 Difference]: Finished difference Result 488 states and 617 transitions. [2018-11-23 04:53:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-23 04:53:22,575 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39 [2018-11-23 04:53:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:53:22,576 INFO L225 Difference]: With dead ends: 488 [2018-11-23 04:53:22,576 INFO L226 Difference]: Without dead ends: 486 [2018-11-23 04:53:22,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1764 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=655, Invalid=5197, Unknown=0, NotChecked=0, Total=5852 [2018-11-23 04:53:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-11-23 04:53:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 313. [2018-11-23 04:53:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-23 04:53:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 404 transitions. [2018-11-23 04:53:22,639 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 404 transitions. Word has length 39 [2018-11-23 04:53:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:53:22,639 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 404 transitions. [2018-11-23 04:53:22,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 04:53:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 404 transitions. [2018-11-23 04:53:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 04:53:22,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:53:22,640 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] [2018-11-23 04:53:22,640 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:53:22,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:22,640 INFO L82 PathProgramCache]: Analyzing trace with hash -420727044, now seen corresponding path program 1 times [2018-11-23 04:53:22,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:22,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:22,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:53:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 04:53:22,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:53:22,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:53:22,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:22,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:53:22,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-11-23 04:53:22,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 04:53:22,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:22,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 04:53:22,853 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:22,858 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:22,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:22,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:22,864 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2018-11-23 04:53:22,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 35 [2018-11-23 04:53:22,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 04:53:22,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:22,944 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 27 treesize of output 22 [2018-11-23 04:53:22,948 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 18 treesize of output 7 [2018-11-23 04:53:22,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:22,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:22,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 04:53:22,976 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 04:53:22,976 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:22,979 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:22,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,001 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:23,004 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:23,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 35 [2018-11-23 04:53:23,034 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 28 treesize of output 27 [2018-11-23 04:53:23,035 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,053 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 27 treesize of output 22 [2018-11-23 04:53:23,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 04:53:23,056 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,060 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 04:53:23,072 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 04:53:23,072 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,074 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,078 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-23 04:53:23,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-11-23 04:53:23,090 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2018-11-23 04:53:23,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 15 [2018-11-23 04:53:23,109 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,124 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 35 treesize of output 23 [2018-11-23 04:53:23,124 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,133 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:53:23,139 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:53:23,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 04:53:23,148 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:111, output treesize:48 [2018-11-23 04:53:23,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 04:53:23,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 04:53:23,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 04:53:23,192 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 04:53:23,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:23,197 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 04:53:23,197 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:18 [2018-11-23 04:53:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 04:53:23,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:53:23,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 15 [2018-11-23 04:53:23,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 04:53:23,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 04:53:23,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-23 04:53:23,246 INFO L87 Difference]: Start difference. First operand 313 states and 404 transitions. Second operand 15 states. [2018-11-23 04:53:23,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:23,652 INFO L93 Difference]: Finished difference Result 410 states and 507 transitions. [2018-11-23 04:53:23,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 04:53:23,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-11-23 04:53:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:53:23,653 INFO L225 Difference]: With dead ends: 410 [2018-11-23 04:53:23,653 INFO L226 Difference]: Without dead ends: 382 [2018-11-23 04:53:23,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-11-23 04:53:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-23 04:53:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 333. [2018-11-23 04:53:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-23 04:53:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 425 transitions. [2018-11-23 04:53:23,716 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 425 transitions. Word has length 40 [2018-11-23 04:53:23,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:53:23,716 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 425 transitions. [2018-11-23 04:53:23,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 04:53:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 425 transitions. [2018-11-23 04:53:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 04:53:23,717 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:53:23,717 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:53:23,717 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:53:23,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2111276170, now seen corresponding path program 1 times [2018-11-23 04:53:23,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:23,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:23,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:23,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:23,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 04:53:23,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:53:23,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:53:23,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:53:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:53:23,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:53:23,745 INFO L87 Difference]: Start difference. First operand 333 states and 425 transitions. Second operand 5 states. [2018-11-23 04:53:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:23,861 INFO L93 Difference]: Finished difference Result 334 states and 426 transitions. [2018-11-23 04:53:23,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:53:23,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-23 04:53:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:53:23,862 INFO L225 Difference]: With dead ends: 334 [2018-11-23 04:53:23,862 INFO L226 Difference]: Without dead ends: 332 [2018-11-23 04:53:23,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:53:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-11-23 04:53:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 323. [2018-11-23 04:53:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-23 04:53:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 415 transitions. [2018-11-23 04:53:23,924 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 415 transitions. Word has length 40 [2018-11-23 04:53:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:53:23,924 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 415 transitions. [2018-11-23 04:53:23,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:53:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 415 transitions. [2018-11-23 04:53:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 04:53:23,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:53:23,925 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 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] [2018-11-23 04:53:23,925 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:53:23,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1332198306, now seen corresponding path program 4 times [2018-11-23 04:53:23,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:23,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:23,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:23,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:53:23,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:53:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:53:24,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:53:24,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:53:24,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 04:53:24,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 04:53:24,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:53:24,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:53:24,654 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 04:53:24,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 04:53:24,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:24,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:24,665 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 04:53:24,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,684 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 04:53:24,686 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 04:53:24,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,693 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 04:53:24,695 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 04:53:24,695 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,699 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,703 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 04:53:24,715 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 04:53:24,716 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 04:53:24,717 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,723 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 04:53:24,725 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 04:53:24,725 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,729 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,731 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 04:53:24,741 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 04:53:24,741 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2018-11-23 04:53:24,767 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 34 treesize of output 37 [2018-11-23 04:53:24,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:24,771 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 37 [2018-11-23 04:53:24,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,790 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 45 treesize of output 44 [2018-11-23 04:53:24,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:24,793 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 04:53:24,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:53 [2018-11-23 04:53:24,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:24,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:24,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:24,828 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 04:53:24,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,864 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:24,864 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 62 treesize of output 49 [2018-11-23 04:53:24,866 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 23 treesize of output 15 [2018-11-23 04:53:24,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,881 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 30 treesize of output 47 [2018-11-23 04:53:24,883 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 04:53:24,883 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,890 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,895 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 04:53:24,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:24,918 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 91 treesize of output 77 [2018-11-23 04:53:24,921 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 27 treesize of output 24 [2018-11-23 04:53:24,921 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:24,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:24,935 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 51 treesize of output 71 [2018-11-23 04:53:24,937 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 04:53:24,937 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,945 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,951 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 04:53:24,963 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 04:53:24,963 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:155, output treesize:81 [2018-11-23 04:53:24,995 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 13 treesize of output 18 [2018-11-23 04:53:24,997 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 18 treesize of output 17 [2018-11-23 04:53:24,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:24,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,029 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 83 treesize of output 97 [2018-11-23 04:53:25,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,033 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 04:53:25,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,068 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 45 treesize of output 68 [2018-11-23 04:53:25,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,072 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 04:53:25,072 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,079 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,093 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:132, output treesize:106 [2018-11-23 04:53:25,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 99 [2018-11-23 04:53:25,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,197 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 04:53:25,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:25,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 250 [2018-11-23 04:53:25,275 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 44 treesize of output 52 [2018-11-23 04:53:25,275 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 243 [2018-11-23 04:53:25,336 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 04:53:25,336 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,366 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,387 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,422 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 79 treesize of output 37 [2018-11-23 04:53:25,426 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 31 [2018-11-23 04:53:25,426 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,437 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 46 treesize of output 67 [2018-11-23 04:53:25,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 04:53:25,439 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,444 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,449 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 04:53:25,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,480 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 93 treesize of output 87 [2018-11-23 04:53:25,483 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 15 [2018-11-23 04:53:25,484 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 114 [2018-11-23 04:53:25,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 20 treesize of output 19 [2018-11-23 04:53:25,506 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,516 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,521 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,541 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 04:53:25,541 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:305, output treesize:134 [2018-11-23 04:53:25,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 166 [2018-11-23 04:53:25,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,635 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 04:53:25,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,687 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 29 treesize of output 50 [2018-11-23 04:53:25,689 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 04:53:25,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 87 [2018-11-23 04:53:25,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,730 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 53 [2018-11-23 04:53:25,730 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,738 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,756 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:185, output treesize:155 [2018-11-23 04:53:25,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,813 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 137 [2018-11-23 04:53:25,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:25,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:25,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 383 treesize of output 270 [2018-11-23 04:53:25,988 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 26 treesize of output 19 [2018-11-23 04:53:25,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 265 [2018-11-23 04:53:26,097 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 04:53:26,098 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,176 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 04:53:26,223 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:26,227 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:26,278 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 82 [2018-11-23 04:53:26,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,283 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 28 treesize of output 47 [2018-11-23 04:53:26,283 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 136 [2018-11-23 04:53:26,305 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 28 treesize of output 27 [2018-11-23 04:53:26,305 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,314 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,320 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 04:53:26,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,354 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:26,356 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 104 [2018-11-23 04:53:26,358 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 31 treesize of output 23 [2018-11-23 04:53:26,358 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 134 [2018-11-23 04:53:26,379 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 39 [2018-11-23 04:53:26,380 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,390 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,396 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:26,419 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:424, output treesize:245 [2018-11-23 04:53:26,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 462 treesize of output 289 [2018-11-23 04:53:26,492 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 50 treesize of output 23 [2018-11-23 04:53:26,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,561 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 162 [2018-11-23 04:53:26,563 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 42 treesize of output 56 [2018-11-23 04:53:26,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,608 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 223 [2018-11-23 04:53:26,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:26,612 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 66 treesize of output 60 [2018-11-23 04:53:26,612 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,624 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:26,644 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 04:53:26,644 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:472, output treesize:298 [2018-11-23 04:53:26,900 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-11-23 04:53:27,108 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 04:53:27,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:27,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 203 [2018-11-23 04:53:27,177 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 92 [2018-11-23 04:53:27,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-11-23 04:53:27,308 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 81 treesize of output 73 [2018-11-23 04:53:27,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:27,311 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 83 treesize of output 75 [2018-11-23 04:53:27,312 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:27,314 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 79 treesize of output 71 [2018-11-23 04:53:27,314 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:27,316 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 83 treesize of output 75 [2018-11-23 04:53:27,317 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:27,319 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 71 treesize of output 63 [2018-11-23 04:53:27,319 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:27,321 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 67 treesize of output 59 [2018-11-23 04:53:27,322 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:27,324 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 73 treesize of output 65 [2018-11-23 04:53:27,324 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:27,458 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 04:53:27,459 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:27,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 103 [2018-11-23 04:53:27,585 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 04:53:27,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 99 [2018-11-23 04:53:27,592 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-23 04:53:27,595 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 95 [2018-11-23 04:53:27,595 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:27,597 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 94 treesize of output 81 [2018-11-23 04:53:27,597 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:27,599 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 98 treesize of output 87 [2018-11-23 04:53:27,599 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:27,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 93 [2018-11-23 04:53:27,606 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-23 04:53:27,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 103 [2018-11-23 04:53:27,613 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-23 04:53:27,830 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:27,835 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 119 [2018-11-23 04:53:27,836 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 04:53:27,839 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:27,844 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 119 [2018-11-23 04:53:27,845 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 04:53:27,847 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:27,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 103 [2018-11-23 04:53:27,848 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:27,850 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:27,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 103 [2018-11-23 04:53:27,851 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:27,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:27,859 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 123 [2018-11-23 04:53:27,860 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 04:53:27,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:27,863 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:27,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 118 treesize of output 115 [2018-11-23 04:53:27,865 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:53:27,869 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:53:27,873 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 123 [2018-11-23 04:53:27,874 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 04:53:28,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-1 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-11-23 04:53:28,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2018-11-23 04:53:28,812 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 14 treesize of output 37 [2018-11-23 04:53:28,813 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:28,832 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 1 [2018-11-23 04:53:28,832 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:28,849 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 1 [2018-11-23 04:53:28,850 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:28,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:28,866 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:28,879 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:28,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2018-11-23 04:53:28,898 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 14 treesize of output 37 [2018-11-23 04:53:28,900 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:28,924 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 1 [2018-11-23 04:53:28,924 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:28,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:28,945 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:28,964 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 1 [2018-11-23 04:53:28,964 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:28,977 INFO L267 ElimStorePlain]: Start of recursive call 32: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:28,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:28,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2018-11-23 04:53:28,990 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2018-11-23 04:53:28,991 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,011 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 1 [2018-11-23 04:53:29,011 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,029 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 04:53:29,029 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:29,045 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,059 INFO L267 ElimStorePlain]: Start of recursive call 37: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2018-11-23 04:53:29,078 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 14 treesize of output 37 [2018-11-23 04:53:29,079 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:29,099 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,117 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 1 [2018-11-23 04:53:29,117 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,133 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 1 [2018-11-23 04:53:29,133 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,146 INFO L267 ElimStorePlain]: Start of recursive call 42: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2018-11-23 04:53:29,159 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2018-11-23 04:53:29,159 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:29,180 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,198 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 1 [2018-11-23 04:53:29,198 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,214 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 04:53:29,214 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,227 INFO L267 ElimStorePlain]: Start of recursive call 47: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 116 [2018-11-23 04:53:29,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:29,237 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,261 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 1 [2018-11-23 04:53:29,261 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,278 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 04:53:29,278 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,295 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 1 [2018-11-23 04:53:29,295 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,308 INFO L267 ElimStorePlain]: Start of recursive call 52: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 120 [2018-11-23 04:53:29,324 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2018-11-23 04:53:29,324 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,347 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 1 [2018-11-23 04:53:29,347 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,365 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 04:53:29,365 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:29,381 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,395 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2018-11-23 04:53:29,409 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2018-11-23 04:53:29,409 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,433 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 04:53:29,433 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:29,451 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,467 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 1 [2018-11-23 04:53:29,468 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,481 INFO L267 ElimStorePlain]: Start of recursive call 62: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 120 [2018-11-23 04:53:29,501 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 14 treesize of output 37 [2018-11-23 04:53:29,502 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,523 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 1 [2018-11-23 04:53:29,524 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,542 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 1 [2018-11-23 04:53:29,542 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:29,558 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,572 INFO L267 ElimStorePlain]: Start of recursive call 67: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2018-11-23 04:53:29,585 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2018-11-23 04:53:29,586 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,606 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 04:53:29,606 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:29,624 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,640 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 1 [2018-11-23 04:53:29,640 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,653 INFO L267 ElimStorePlain]: Start of recursive call 72: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 04:53:29,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2018-11-23 04:53:29,673 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 14 treesize of output 37 [2018-11-23 04:53:29,674 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,693 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 1 [2018-11-23 04:53:29,693 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,716 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 1 [2018-11-23 04:53:29,717 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 04:53:29,738 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,756 INFO L267 ElimStorePlain]: Start of recursive call 77: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:53:29,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 44 dim-0 vars, and 11 xjuncts. [2018-11-23 04:53:29,992 INFO L202 ElimStorePlain]: Needed 81 recursive calls to eliminate 8 variables, input treesize:707, output treesize:760 [2018-11-23 04:53:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:53:30,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:53:30,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2018-11-23 04:53:30,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 04:53:30,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 04:53:30,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=754, Unknown=4, NotChecked=0, Total=870 [2018-11-23 04:53:30,160 INFO L87 Difference]: Start difference. First operand 323 states and 415 transitions. Second operand 30 states. [2018-11-23 04:53:31,441 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2018-11-23 04:53:31,644 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2018-11-23 04:53:32,379 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 126 [2018-11-23 04:53:32,971 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 126 [2018-11-23 04:53:33,585 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 133 [2018-11-23 04:53:34,073 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 139 [2018-11-23 04:53:34,466 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 141 [2018-11-23 04:53:34,700 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2018-11-23 04:53:35,084 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 134 [2018-11-23 04:53:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:53:35,804 INFO L93 Difference]: Finished difference Result 522 states and 657 transitions. [2018-11-23 04:53:35,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 04:53:35,804 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2018-11-23 04:53:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:53:35,805 INFO L225 Difference]: With dead ends: 522 [2018-11-23 04:53:35,805 INFO L226 Difference]: Without dead ends: 470 [2018-11-23 04:53:35,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1640 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=679, Invalid=4573, Unknown=4, NotChecked=0, Total=5256 [2018-11-23 04:53:35,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-11-23 04:53:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 341. [2018-11-23 04:53:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-23 04:53:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 439 transitions. [2018-11-23 04:53:35,870 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 439 transitions. Word has length 40 [2018-11-23 04:53:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:53:35,870 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 439 transitions. [2018-11-23 04:53:35,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 04:53:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 439 transitions. [2018-11-23 04:53:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 04:53:35,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:53:35,871 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-23 04:53:35,871 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:53:35,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:53:35,871 INFO L82 PathProgramCache]: Analyzing trace with hash -158127826, now seen corresponding path program 1 times [2018-11-23 04:53:35,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:53:35,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:53:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:35,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:53:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:53:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:53:35,906 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=11, |#NULL.offset|=9, |old(#NULL.base)|=11, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=9] [?] RET #235#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret27 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1 || 0 == ~marked~0);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~nondet4|=1] [?] assume 0 != #t~nondet4;havoc #t~nondet4;~marked~0 := 1; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume 0 != ~marked~0;call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1 || 0 == ~marked~0);havoc #t~nondet1; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] ~marked~0 := 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short8 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=17, |main_#t~mem5.offset|=0, |main_#t~short8|=true] [?] assume #t~short8;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem7 := read~int(#t~mem6.base, 4 + #t~mem6.offset, 4);#t~short8 := 0 == #t~mem7; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=17, |main_#t~mem5.offset|=0, |main_#t~mem6.base|=17, |main_#t~mem6.offset|=0, |main_#t~mem7|=1, |main_#t~short8|=false] [?] assume !#t~short8;havoc #t~mem7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short8; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short12 := #t~mem10.base != 0 || #t~mem10.offset != 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem10.base|=17, |main_#t~mem10.offset|=0, |main_#t~short12|=true] [?] assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem10.base|=17, |main_#t~mem10.offset|=0, |main_#t~nondet11|=0, |main_#t~short12|=false] [?] assume !#t~short12;havoc #t~nondet11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~short12; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(8);~tmp~0.base, ~tmp~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~int(1, ~tmp~0.base, 4 + ~tmp~0.offset, 4);call write~$Pointer$(0, 0, ~tmp~0.base, ~tmp~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem16.base|=17, |main_#t~mem16.offset|=0] [?] assume !(#t~mem16.base == 0 && #t~mem16.offset == 0);havoc #t~mem16.base, #t~mem16.offset;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(#t~mem17.base, #t~mem17.offset, ~tmp~0.base, ~tmp~0.offset, 4);havoc #t~mem17.base, #t~mem17.offset;call write~$Pointer$(~tmp~0.base, ~tmp~0.offset, ~x~0.base, ~x~0.offset, 4); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] ~marked~0 := 0;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~short19|=true] [?] assume #t~short19;call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4);#t~short19 := 1 != #t~mem18; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem18|=0, |main_#t~short19|=true] [?] assume !!#t~short19;havoc #t~mem18;havoc #t~short19;call #t~mem20 := read~int(~x~0.base, 4 + ~x~0.offset, 4);~marked~0 := #t~mem20;havoc #t~mem20; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem21 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem21|=0] [?] assume !!(0 == #t~mem21);havoc #t~mem21; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !!(0 == ~marked~0); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem22.base, #t~mem22.offset;havoc #t~mem22.base, #t~mem22.offset; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~short19|=true] [?] assume #t~short19;call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4);#t~short19 := 1 != #t~mem18; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem18|=1, |main_#t~short19|=false] [?] assume !#t~short19;havoc #t~mem18;havoc #t~short19; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem23 := read~int(~x~0.base, 4 + ~x~0.offset, 4);~marked~0 := #t~mem23;havoc #t~mem23; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem24 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem24|=1] [?] assume !(1 != #t~mem24);havoc #t~mem24; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=9, old(#NULL.base)=11, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L990] ~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L993-L1009] assume !!(0 != #t~nondet1 || 0 == ~marked~0); [L993] havoc #t~nondet1; [L996] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L996] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); [L997] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L997] ~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset; [L997] havoc #t~mem3.base, #t~mem3.offset; [L998] call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet4=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=17, ~x~0.offset=0] [L1000-L1003] assume 0 != #t~nondet4; [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L1005-L1008] assume 0 != ~marked~0; [L1006] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L993-L1009] assume !(0 != #t~nondet1 || 0 == ~marked~0); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L1011] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=19, ~x~0.offset=0] [L1013] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=19, ~x~0.offset=0] [L1014] ~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1016] #t~short8 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5.base=17, #t~mem5.offset=0, #t~short8=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016] assume #t~short8; [L1016] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1016] call #t~mem7 := read~int(#t~mem6.base, 4 + #t~mem6.offset, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5.base=17, #t~mem5.offset=0, #t~mem6.base=17, #t~mem6.offset=0, #t~mem7=1, #t~short8=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016-L1019] assume !#t~short8; [L1016] havoc #t~mem7; [L1016] havoc #t~mem5.base, #t~mem5.offset; [L1016] havoc #t~mem6.base, #t~mem6.offset; [L1016] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] #t~short12 := #t~mem10.base != 0 || #t~mem10.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem10.base=17, #t~mem10.offset=0, #t~short12=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021] assume #t~short12; [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem10.base=17, #t~mem10.offset=0, #t~nondet11=0, #t~short12=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021-L1025] assume !#t~short12; [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10.base, #t~mem10.offset; [L1021] havoc #t~short12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1027] call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(8); [L1027] ~tmp~0.base, ~tmp~0.offset := #t~malloc15.base, #t~malloc15.offset; [L1028] call write~int(1, ~tmp~0.base, 4 + ~tmp~0.offset, 4); [L1029] call write~$Pointer$(0, 0, ~tmp~0.base, ~tmp~0.offset, 4); [L1030] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem16.base=17, #t~mem16.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1030-L1036] assume !(#t~mem16.base == 0 && #t~mem16.offset == 0); [L1030] havoc #t~mem16.base, #t~mem16.offset; [L1034] call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1034] call write~$Pointer$(#t~mem17.base, #t~mem17.offset, ~tmp~0.base, ~tmp~0.offset, 4); [L1034] havoc #t~mem17.base, #t~mem17.offset; [L1035] call write~$Pointer$(~tmp~0.base, ~tmp~0.offset, ~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041] assume #t~short19; [L1041] call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem18=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041-L1047] assume !!#t~short19; [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] call #t~mem20 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1044] call #t~mem21 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem21=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1044] assume !!(0 == #t~mem21); [L1044] havoc #t~mem21; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1045] assume !!(0 == ~marked~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1046] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1046] ~x~0.base, ~x~0.offset := #t~mem22.base, #t~mem22.offset; [L1046] havoc #t~mem22.base, #t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041] assume #t~short19; [L1041] call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem18=1, #t~short19=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041-L1047] assume !#t~short19; [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1048-L1054] assume !!(~x~0.base != 0 || ~x~0.offset != 0); [L1050] call #t~mem23 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] call #t~mem24 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem24=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] assume !(1 != #t~mem24); [L1051] havoc #t~mem24; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=9, old(#NULL.base)=11, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L990] ~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L993-L1009] assume !!(0 != #t~nondet1 || 0 == ~marked~0); [L993] havoc #t~nondet1; [L996] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L996] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); [L997] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L997] ~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset; [L997] havoc #t~mem3.base, #t~mem3.offset; [L998] call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet4=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=17, ~x~0.offset=0] [L1000-L1003] assume 0 != #t~nondet4; [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L1005-L1008] assume 0 != ~marked~0; [L1006] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L993-L1009] assume !(0 != #t~nondet1 || 0 == ~marked~0); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L1011] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=19, ~x~0.offset=0] [L1013] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=19, ~x~0.offset=0] [L1014] ~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1016] #t~short8 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5.base=17, #t~mem5.offset=0, #t~short8=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016] assume #t~short8; [L1016] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1016] call #t~mem7 := read~int(#t~mem6.base, 4 + #t~mem6.offset, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5.base=17, #t~mem5.offset=0, #t~mem6.base=17, #t~mem6.offset=0, #t~mem7=1, #t~short8=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016-L1019] assume !#t~short8; [L1016] havoc #t~mem7; [L1016] havoc #t~mem5.base, #t~mem5.offset; [L1016] havoc #t~mem6.base, #t~mem6.offset; [L1016] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] #t~short12 := #t~mem10.base != 0 || #t~mem10.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem10.base=17, #t~mem10.offset=0, #t~short12=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021] assume #t~short12; [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem10.base=17, #t~mem10.offset=0, #t~nondet11=0, #t~short12=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021-L1025] assume !#t~short12; [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10.base, #t~mem10.offset; [L1021] havoc #t~short12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1027] call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(8); [L1027] ~tmp~0.base, ~tmp~0.offset := #t~malloc15.base, #t~malloc15.offset; [L1028] call write~int(1, ~tmp~0.base, 4 + ~tmp~0.offset, 4); [L1029] call write~$Pointer$(0, 0, ~tmp~0.base, ~tmp~0.offset, 4); [L1030] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem16.base=17, #t~mem16.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1030-L1036] assume !(#t~mem16.base == 0 && #t~mem16.offset == 0); [L1030] havoc #t~mem16.base, #t~mem16.offset; [L1034] call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1034] call write~$Pointer$(#t~mem17.base, #t~mem17.offset, ~tmp~0.base, ~tmp~0.offset, 4); [L1034] havoc #t~mem17.base, #t~mem17.offset; [L1035] call write~$Pointer$(~tmp~0.base, ~tmp~0.offset, ~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041] assume #t~short19; [L1041] call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem18=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041-L1047] assume !!#t~short19; [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] call #t~mem20 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1044] call #t~mem21 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem21=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1044] assume !!(0 == #t~mem21); [L1044] havoc #t~mem21; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1045] assume !!(0 == ~marked~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1046] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1046] ~x~0.base, ~x~0.offset := #t~mem22.base, #t~mem22.offset; [L1046] havoc #t~mem22.base, #t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041] assume #t~short19; [L1041] call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem18=1, #t~short19=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041-L1047] assume !#t~short19; [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1048-L1054] assume !!(~x~0.base != 0 || ~x~0.offset != 0); [L1050] call #t~mem23 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] call #t~mem24 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem24=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] assume !(1 != #t~mem24); [L1051] havoc #t~mem24; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=9, old(#NULL!base)=11, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet4=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=17, ~x~0!offset=0] [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~short8=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~mem6!base=17, #t~mem6!offset=0, #t~mem7=1, #t~short8=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem7; [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~short12=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~nondet11=0, #t~short12=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem16!base=17, #t~mem16!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem21=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=1, #t~short19=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem24=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=9, old(#NULL!base)=11, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet4=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=17, ~x~0!offset=0] [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~short8=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~mem6!base=17, #t~mem6!offset=0, #t~mem7=1, #t~short8=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem7; [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~short12=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~nondet11=0, #t~short12=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem16!base=17, #t~mem16!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem21=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=1, #t~short19=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem24=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=9, old(#NULL!base)=11, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet4=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=17, ~x~0!offset=0] [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~short8=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~mem6!base=17, #t~mem6!offset=0, #t~mem7=1, #t~short8=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem7; [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~short12=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~nondet11=0, #t~short12=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem16!base=17, #t~mem16!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem21=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=1, #t~short19=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem24=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=9, old(#NULL!base)=11, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet4=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=17, ~x~0!offset=0] [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~short8=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~mem6!base=17, #t~mem6!offset=0, #t~mem7=1, #t~short8=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem7; [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~short12=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~nondet11=0, #t~short12=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem16!base=17, #t~mem16!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem21=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=1, #t~short19=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem24=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L989] SLL* x = head; [L990] int marked = 0; VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}] [L993] COND TRUE __VERIFIER_nondet_int() || !marked [L996] x->next = malloc(sizeof(SLL)) [L997] EXPR x->next [L997] x = x->next [L998] x->next = ((void*)0) [L1000] COND TRUE __VERIFIER_nondet_int() [L1002] marked = 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={17:0}] [L1005] COND TRUE \read(marked) [L1006] x->data = 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={17:0}] [L993] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1011] x = head VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={19:0}] [L1013] COND FALSE !(!(((void*)0) != x)) VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={19:0}] [L1014] marked = 0 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}] [L1016] EXPR x->next [L1016] x->next != ((void*)0) && x->next->data == 0 [L1016] EXPR x->next [L1016] EXPR x->next->data [L1016] x->next != ((void*)0) && x->next->data == 0 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}, x->next={17:0}, x->next={17:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1016] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1021] EXPR x->next [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}, x->next={17:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=0] [L1021] COND FALSE !(x->next != ((void*)0) && __VERIFIER_nondet_int()) [L1027] SLL* tmp = malloc(sizeof(SLL)); [L1028] tmp->data = 1 [L1029] tmp->next = ((void*)0) [L1030] EXPR x->next VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}, x->next={17:0}] [L1030] COND FALSE !(x->next == ((void*)0)) [L1034] EXPR x->next [L1034] tmp->next = x->next [L1035] x->next = tmp VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}] [L1038] marked = 0 [L1039] x = head VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}] [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}, x != ((void*)0) && x->data != 1=1, x->data=0] [L1041] COND TRUE x != ((void*)0) && x->data != 1 [L1043] EXPR x->data [L1043] marked = x->data [L1044] EXPR x->data VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}, x->data=0] [L1044] COND FALSE !(!(x->data == 0)) [L1045] COND FALSE !(!(marked == 0)) VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}] [L1046] EXPR x->next [L1046] x = x->next [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={22:0}, x != ((void*)0) && x->data != 1=0, x->data=1] [L1041] COND FALSE !(x != ((void*)0) && x->data != 1) [L1048] COND TRUE x != ((void*)0) [L1050] EXPR x->data [L1050] marked = x->data [L1051] EXPR x->data VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=1, tmp={22:0}, x={22:0}, x->data=1] [L1051] COND TRUE !(x->data != 1) [L1051] __VERIFIER_error() VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=1, tmp={22:0}, x={22:0}] ----- [2018-11-23 04:53:36,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:53:36 BoogieIcfgContainer [2018-11-23 04:53:36,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:53:36,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:53:36,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:53:36,451 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:53:36,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:51:12" (3/4) ... [2018-11-23 04:53:36,453 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|=11, |#NULL.offset|=9, |old(#NULL.base)|=11, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=11, |old(#NULL.offset)|=9] [?] RET #235#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret27 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~int(0, ~head~0.base, 4 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset;~marked~0 := 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~nondet1|=1] [?] assume !!(0 != #t~nondet1 || 0 == ~marked~0);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~nondet4|=1] [?] assume 0 != #t~nondet4;havoc #t~nondet4;~marked~0 := 1; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume 0 != ~marked~0;call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~nondet1|=0] [?] assume !(0 != #t~nondet1 || 0 == ~marked~0);havoc #t~nondet1; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=17, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] ~marked~0 := 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short8 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=17, |main_#t~mem5.offset|=0, |main_#t~short8|=true] [?] assume #t~short8;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call #t~mem7 := read~int(#t~mem6.base, 4 + #t~mem6.offset, 4);#t~short8 := 0 == #t~mem7; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem5.base|=17, |main_#t~mem5.offset|=0, |main_#t~mem6.base|=17, |main_#t~mem6.offset|=0, |main_#t~mem7|=1, |main_#t~short8|=false] [?] assume !#t~short8;havoc #t~mem7;havoc #t~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset;havoc #t~short8; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);#t~short12 := #t~mem10.base != 0 || #t~mem10.offset != 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem10.base|=17, |main_#t~mem10.offset|=0, |main_#t~short12|=true] [?] assume #t~short12;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;#t~short12 := 0 != #t~nondet11; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem10.base|=17, |main_#t~mem10.offset|=0, |main_#t~nondet11|=0, |main_#t~short12|=false] [?] assume !#t~short12;havoc #t~nondet11;havoc #t~mem10.base, #t~mem10.offset;havoc #t~short12; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(8);~tmp~0.base, ~tmp~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~int(1, ~tmp~0.base, 4 + ~tmp~0.offset, 4);call write~$Pointer$(0, 0, ~tmp~0.base, ~tmp~0.offset, 4);call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem16.base|=17, |main_#t~mem16.offset|=0] [?] assume !(#t~mem16.base == 0 && #t~mem16.offset == 0);havoc #t~mem16.base, #t~mem16.offset;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(#t~mem17.base, #t~mem17.offset, ~tmp~0.base, ~tmp~0.offset, 4);havoc #t~mem17.base, #t~mem17.offset;call write~$Pointer$(~tmp~0.base, ~tmp~0.offset, ~x~0.base, ~x~0.offset, 4); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] ~marked~0 := 0;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~short19|=true] [?] assume #t~short19;call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4);#t~short19 := 1 != #t~mem18; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem18|=0, |main_#t~short19|=true] [?] assume !!#t~short19;havoc #t~mem18;havoc #t~short19;call #t~mem20 := read~int(~x~0.base, 4 + ~x~0.offset, 4);~marked~0 := #t~mem20;havoc #t~mem20; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem21 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem21|=0] [?] assume !!(0 == #t~mem21);havoc #t~mem21; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !!(0 == ~marked~0); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] goto; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=19, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem22.base, #t~mem22.offset;havoc #t~mem22.base, #t~mem22.offset; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~short19|=true] [?] assume #t~short19;call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4);#t~short19 := 1 != #t~mem18; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem18|=1, |main_#t~short19|=false] [?] assume !#t~short19;havoc #t~mem18;havoc #t~short19; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=0, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !!(~x~0.base != 0 || ~x~0.offset != 0);call #t~mem23 := read~int(~x~0.base, 4 + ~x~0.offset, 4);~marked~0 := #t~mem23;havoc #t~mem23; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] call #t~mem24 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0, |main_#t~mem24|=1] [?] assume !(1 != #t~mem24);havoc #t~mem24; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] assume !false; VAL [main_~head~0.base=19, main_~head~0.offset=0, main_~marked~0=1, main_~tmp~0.base=22, main_~tmp~0.offset=0, main_~x~0.base=22, main_~x~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc0.base|=19, |main_#t~malloc0.offset|=0, |main_#t~malloc15.base|=22, |main_#t~malloc15.offset|=0, |main_#t~malloc2.base|=17, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=9, old(#NULL.base)=11, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L990] ~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L993-L1009] assume !!(0 != #t~nondet1 || 0 == ~marked~0); [L993] havoc #t~nondet1; [L996] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L996] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); [L997] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L997] ~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset; [L997] havoc #t~mem3.base, #t~mem3.offset; [L998] call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet4=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=17, ~x~0.offset=0] [L1000-L1003] assume 0 != #t~nondet4; [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L1005-L1008] assume 0 != ~marked~0; [L1006] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L993-L1009] assume !(0 != #t~nondet1 || 0 == ~marked~0); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L1011] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=19, ~x~0.offset=0] [L1013] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=19, ~x~0.offset=0] [L1014] ~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1016] #t~short8 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5.base=17, #t~mem5.offset=0, #t~short8=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016] assume #t~short8; [L1016] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1016] call #t~mem7 := read~int(#t~mem6.base, 4 + #t~mem6.offset, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5.base=17, #t~mem5.offset=0, #t~mem6.base=17, #t~mem6.offset=0, #t~mem7=1, #t~short8=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016-L1019] assume !#t~short8; [L1016] havoc #t~mem7; [L1016] havoc #t~mem5.base, #t~mem5.offset; [L1016] havoc #t~mem6.base, #t~mem6.offset; [L1016] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] #t~short12 := #t~mem10.base != 0 || #t~mem10.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem10.base=17, #t~mem10.offset=0, #t~short12=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021] assume #t~short12; [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem10.base=17, #t~mem10.offset=0, #t~nondet11=0, #t~short12=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021-L1025] assume !#t~short12; [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10.base, #t~mem10.offset; [L1021] havoc #t~short12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1027] call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(8); [L1027] ~tmp~0.base, ~tmp~0.offset := #t~malloc15.base, #t~malloc15.offset; [L1028] call write~int(1, ~tmp~0.base, 4 + ~tmp~0.offset, 4); [L1029] call write~$Pointer$(0, 0, ~tmp~0.base, ~tmp~0.offset, 4); [L1030] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem16.base=17, #t~mem16.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1030-L1036] assume !(#t~mem16.base == 0 && #t~mem16.offset == 0); [L1030] havoc #t~mem16.base, #t~mem16.offset; [L1034] call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1034] call write~$Pointer$(#t~mem17.base, #t~mem17.offset, ~tmp~0.base, ~tmp~0.offset, 4); [L1034] havoc #t~mem17.base, #t~mem17.offset; [L1035] call write~$Pointer$(~tmp~0.base, ~tmp~0.offset, ~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041] assume #t~short19; [L1041] call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem18=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041-L1047] assume !!#t~short19; [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] call #t~mem20 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1044] call #t~mem21 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem21=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1044] assume !!(0 == #t~mem21); [L1044] havoc #t~mem21; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1045] assume !!(0 == ~marked~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1046] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1046] ~x~0.base, ~x~0.offset := #t~mem22.base, #t~mem22.offset; [L1046] havoc #t~mem22.base, #t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041] assume #t~short19; [L1041] call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem18=1, #t~short19=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041-L1047] assume !#t~short19; [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1048-L1054] assume !!(~x~0.base != 0 || ~x~0.offset != 0); [L1050] call #t~mem23 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] call #t~mem24 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem24=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] assume !(1 != #t~mem24); [L1051] havoc #t~mem24; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=11, #NULL.offset=9, old(#NULL.base)=11, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=11, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; [L990] ~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~nondet1=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L993-L1009] assume !!(0 != #t~nondet1 || 0 == ~marked~0); [L993] havoc #t~nondet1; [L996] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8); [L996] call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); [L997] call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L997] ~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset; [L997] havoc #t~mem3.base, #t~mem3.offset; [L998] call write~$Pointer$(0, 0, ~x~0.base, ~x~0.offset, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet4=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=17, ~x~0.offset=0] [L1000-L1003] assume 0 != #t~nondet4; [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L1005-L1008] assume 0 != ~marked~0; [L1006] call write~int(1, ~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~nondet1=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L993-L1009] assume !(0 != #t~nondet1 || 0 == ~marked~0); [L993] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=17, ~x~0.offset=0] [L1011] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=19, ~x~0.offset=0] [L1013] assume !!(0 != ~x~0.base || 0 != ~x~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~x~0.base=19, ~x~0.offset=0] [L1014] ~marked~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1016] #t~short8 := #t~mem5.base != 0 || #t~mem5.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5.base=17, #t~mem5.offset=0, #t~short8=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016] assume #t~short8; [L1016] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1016] call #t~mem7 := read~int(#t~mem6.base, 4 + #t~mem6.offset, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem5.base=17, #t~mem5.offset=0, #t~mem6.base=17, #t~mem6.offset=0, #t~mem7=1, #t~short8=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1016-L1019] assume !#t~short8; [L1016] havoc #t~mem7; [L1016] havoc #t~mem5.base, #t~mem5.offset; [L1016] havoc #t~mem6.base, #t~mem6.offset; [L1016] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1021] #t~short12 := #t~mem10.base != 0 || #t~mem10.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem10.base=17, #t~mem10.offset=0, #t~short12=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021] assume #t~short12; [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem10.base=17, #t~mem10.offset=0, #t~nondet11=0, #t~short12=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1021-L1025] assume !#t~short12; [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10.base, #t~mem10.offset; [L1021] havoc #t~short12; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~x~0.base=19, ~x~0.offset=0] [L1027] call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(8); [L1027] ~tmp~0.base, ~tmp~0.offset := #t~malloc15.base, #t~malloc15.offset; [L1028] call write~int(1, ~tmp~0.base, 4 + ~tmp~0.offset, 4); [L1029] call write~$Pointer$(0, 0, ~tmp~0.base, ~tmp~0.offset, 4); [L1030] call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem16.base=17, #t~mem16.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1030-L1036] assume !(#t~mem16.base == 0 && #t~mem16.offset == 0); [L1030] havoc #t~mem16.base, #t~mem16.offset; [L1034] call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1034] call write~$Pointer$(#t~mem17.base, #t~mem17.offset, ~tmp~0.base, ~tmp~0.offset, 4); [L1034] havoc #t~mem17.base, #t~mem17.offset; [L1035] call write~$Pointer$(~tmp~0.base, ~tmp~0.offset, ~x~0.base, ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041] assume #t~short19; [L1041] call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem18=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1041-L1047] assume !!#t~short19; [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] call #t~mem20 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1044] call #t~mem21 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem21=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1044] assume !!(0 == #t~mem21); [L1044] havoc #t~mem21; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1045] assume !!(0 == ~marked~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=19, ~x~0.offset=0] [L1046] call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); [L1046] ~x~0.base, ~x~0.offset := #t~mem22.base, #t~mem22.offset; [L1046] havoc #t~mem22.base, #t~mem22.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041] #t~short19 := ~x~0.base != 0 || ~x~0.offset != 0; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~short19=true, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041] assume #t~short19; [L1041] call #t~mem18 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem18=1, #t~short19=false, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1041-L1047] assume !#t~short19; [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=0, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1048-L1054] assume !!(~x~0.base != 0 || ~x~0.offset != 0); [L1050] call #t~mem23 := read~int(~x~0.base, 4 + ~x~0.offset, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] call #t~mem24 := read~int(~x~0.base, 4 + ~x~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, #t~mem24=1, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] assume !(1 != #t~mem24); [L1051] havoc #t~mem24; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [L1051] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc0.base=19, #t~malloc0.offset=0, #t~malloc15.base=22, #t~malloc15.offset=0, #t~malloc2.base=17, #t~malloc2.offset=0, ~head~0.base=19, ~head~0.offset=0, ~marked~0=1, ~tmp~0.base=22, ~tmp~0.offset=0, ~x~0.base=22, ~x~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=9, old(#NULL!base)=11, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet4=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=17, ~x~0!offset=0] [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~short8=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~mem6!base=17, #t~mem6!offset=0, #t~mem7=1, #t~short8=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem7; [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~short12=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~nondet11=0, #t~short12=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem16!base=17, #t~mem16!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem21=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=1, #t~short19=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem24=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=9, old(#NULL!base)=11, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet4=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=17, ~x~0!offset=0] [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~short8=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~mem6!base=17, #t~mem6!offset=0, #t~mem7=1, #t~short8=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem7; [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~short12=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~nondet11=0, #t~short12=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem16!base=17, #t~mem16!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem21=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=1, #t~short19=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem24=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=9, old(#NULL!base)=11, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet4=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=17, ~x~0!offset=0] [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~short8=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~mem6!base=17, #t~mem6!offset=0, #t~mem7=1, #t~short8=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem7; [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~short12=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~nondet11=0, #t~short12=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem16!base=17, #t~mem16!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem21=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=1, #t~short19=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem24=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=11, #NULL!offset=9, old(#NULL!base)=11, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=11, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret27 := 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); [L989] ~x~0 := ~head~0; [L990] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~nondet1=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L993-L1009] COND FALSE !(!(0 != #t~nondet1 || 0 == ~marked~0)) [L993] havoc #t~nondet1; [L996] FCALL call #t~malloc2 := #Ultimate.alloc(8); [L996] FCALL call write~$Pointer$(#t~malloc2, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] FCALL call #t~mem3 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L997] ~x~0 := #t~mem3; [L997] havoc #t~mem3; [L998] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~x~0!base, offset: ~x~0!offset }, 4); [L1000] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet4=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=17, ~x~0!offset=0] [L1000-L1003] COND TRUE 0 != #t~nondet4 [L1000] havoc #t~nondet4; [L1002] ~marked~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1005-L1008] COND TRUE 0 != ~marked~0 [L1006] FCALL call write~int(1, { base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~nondet1=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L993-L1009] COND TRUE !(0 != #t~nondet1 || 0 == ~marked~0) [L993] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=17, ~x~0!offset=0] [L1011] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1013] COND FALSE !(!({ base: 0, offset: 0 } != ~x~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~x~0!base=19, ~x~0!offset=0] [L1014] ~marked~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] FCALL call #t~mem5 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] #t~short8 := #t~mem5 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~short8=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016] COND TRUE #t~short8 [L1016] FCALL call #t~mem6 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1016] FCALL call #t~mem7 := read~int({ base: #t~mem6!base, offset: 4 + #t~mem6!offset }, 4); [L1016] #t~short8 := 0 == #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem5!base=17, #t~mem5!offset=0, #t~mem6!base=17, #t~mem6!offset=0, #t~mem7=1, #t~short8=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1016-L1019] COND TRUE !#t~short8 [L1016] havoc #t~mem7; [L1016] havoc #t~mem5; [L1016] havoc #t~mem6; [L1016] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] FCALL call #t~mem10 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1021] #t~short12 := #t~mem10 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~short12=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021] COND TRUE #t~short12 [L1021] assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; [L1021] #t~short12 := 0 != #t~nondet11; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem10!base=17, #t~mem10!offset=0, #t~nondet11=0, #t~short12=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1021-L1025] COND TRUE !#t~short12 [L1021] havoc #t~nondet11; [L1021] havoc #t~mem10; [L1021] havoc #t~short12; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~x~0!base=19, ~x~0!offset=0] [L1027] FCALL call #t~malloc15 := #Ultimate.alloc(8); [L1027] ~tmp~0 := #t~malloc15; [L1028] FCALL call write~int(1, { base: ~tmp~0!base, offset: 4 + ~tmp~0!offset }, 4); [L1029] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1030] FCALL call #t~mem16 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem16!base=17, #t~mem16!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1030] COND FALSE !(#t~mem16 == { base: 0, offset: 0 }) [L1030] havoc #t~mem16; [L1034] FCALL call #t~mem17 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1034] FCALL call write~$Pointer$(#t~mem17, { base: ~tmp~0!base, offset: ~tmp~0!offset }, 4); [L1034] havoc #t~mem17; [L1035] FCALL call write~$Pointer$(~tmp~0, { base: ~x~0!base, offset: ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1038] ~marked~0 := 0; [L1039] ~x~0 := ~head~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1041-L1047] COND FALSE !(!#t~short19) [L1041] havoc #t~mem18; [L1041] havoc #t~short19; [L1043] FCALL call #t~mem20 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1043] ~marked~0 := #t~mem20; [L1043] havoc #t~mem20; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] FCALL call #t~mem21 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem21=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1044] COND FALSE !(!(0 == #t~mem21)) [L1044] havoc #t~mem21; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1045] COND FALSE !(!(0 == ~marked~0)) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=19, ~x~0!offset=0] [L1046] FCALL call #t~mem22 := read~$Pointer$({ base: ~x~0!base, offset: ~x~0!offset }, 4); [L1046] ~x~0 := #t~mem22; [L1046] havoc #t~mem22; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] #t~short19 := ~x~0 != { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~short19=true, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041] COND TRUE #t~short19 [L1041] FCALL call #t~mem18 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1041] #t~short19 := 1 != #t~mem18; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem18=1, #t~short19=false, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1041-L1047] COND TRUE !#t~short19 [L1041] havoc #t~mem18; [L1041] havoc #t~short19; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=0, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1048-L1054] COND FALSE !(!(~x~0 != { base: 0, offset: 0 })) [L1050] FCALL call #t~mem23 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); [L1050] ~marked~0 := #t~mem23; [L1050] havoc #t~mem23; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] FCALL call #t~mem24 := read~int({ base: ~x~0!base, offset: 4 + ~x~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, #t~mem24=1, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] COND TRUE !(1 != #t~mem24) [L1051] havoc #t~mem24; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L1051] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc0!base=19, #t~malloc0!offset=0, #t~malloc15!base=22, #t~malloc15!offset=0, #t~malloc2!base=17, #t~malloc2!offset=0, ~head~0!base=19, ~head~0!offset=0, ~marked~0=1, ~tmp~0!base=22, ~tmp~0!offset=0, ~x~0!base=22, ~x~0!offset=0] [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L989] SLL* x = head; [L990] int marked = 0; VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}] [L993] COND TRUE __VERIFIER_nondet_int() || !marked [L996] x->next = malloc(sizeof(SLL)) [L997] EXPR x->next [L997] x = x->next [L998] x->next = ((void*)0) [L1000] COND TRUE __VERIFIER_nondet_int() [L1002] marked = 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={17:0}] [L1005] COND TRUE \read(marked) [L1006] x->data = 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={17:0}] [L993] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1011] x = head VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={19:0}] [L1013] COND FALSE !(!(((void*)0) != x)) VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={19:0}] [L1014] marked = 0 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}] [L1016] EXPR x->next [L1016] x->next != ((void*)0) && x->next->data == 0 [L1016] EXPR x->next [L1016] EXPR x->next->data [L1016] x->next != ((void*)0) && x->next->data == 0 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}, x->next={17:0}, x->next={17:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1016] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1021] EXPR x->next [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}, x->next={17:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=0] [L1021] COND FALSE !(x->next != ((void*)0) && __VERIFIER_nondet_int()) [L1027] SLL* tmp = malloc(sizeof(SLL)); [L1028] tmp->data = 1 [L1029] tmp->next = ((void*)0) [L1030] EXPR x->next VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}, x->next={17:0}] [L1030] COND FALSE !(x->next == ((void*)0)) [L1034] EXPR x->next [L1034] tmp->next = x->next [L1035] x->next = tmp VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}] [L1038] marked = 0 [L1039] x = head VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}] [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}, x != ((void*)0) && x->data != 1=1, x->data=0] [L1041] COND TRUE x != ((void*)0) && x->data != 1 [L1043] EXPR x->data [L1043] marked = x->data [L1044] EXPR x->data VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}, x->data=0] [L1044] COND FALSE !(!(x->data == 0)) [L1045] COND FALSE !(!(marked == 0)) VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}] [L1046] EXPR x->next [L1046] x = x->next [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={22:0}, x != ((void*)0) && x->data != 1=0, x->data=1] [L1041] COND FALSE !(x != ((void*)0) && x->data != 1) [L1048] COND TRUE x != ((void*)0) [L1050] EXPR x->data [L1050] marked = x->data [L1051] EXPR x->data VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=1, tmp={22:0}, x={22:0}, x->data=1] [L1051] COND TRUE !(x->data != 1) [L1051] __VERIFIER_error() VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=1, tmp={22:0}, x={22:0}] ----- [2018-11-23 04:53:37,817 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_80bf5e35-898d-4ea8-aa69-75ee3b2121a7/bin-2019/uautomizer/witness.graphml [2018-11-23 04:53:37,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:53:37,818 INFO L168 Benchmark]: Toolchain (without parser) took 146100.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.7 MB). Free memory was 956.6 MB in the beginning and 978.2 MB in the end (delta: -21.7 MB). Peak memory consumption was 327.0 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:37,818 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:53:37,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:37,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:37,819 INFO L168 Benchmark]: Boogie Preprocessor took 24.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:37,819 INFO L168 Benchmark]: RCFGBuilder took 325.07 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: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:37,819 INFO L168 Benchmark]: TraceAbstraction took 144015.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 988.4 MB in the end (delta: 105.6 MB). Peak memory consumption was 312.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:37,820 INFO L168 Benchmark]: Witness Printer took 1367.17 ms. Allocated memory is still 1.4 GB. Free memory was 988.4 MB in the beginning and 978.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:53:37,821 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 325.07 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: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 144015.00 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.6 MB). Free memory was 1.1 GB in the beginning and 988.4 MB in the end (delta: 105.6 MB). Peak memory consumption was 312.1 MB. Max. memory is 11.5 GB. * Witness Printer took 1367.17 ms. Allocated memory is still 1.4 GB. Free memory was 988.4 MB in the beginning and 978.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1051]: 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 [L989] SLL* x = head; [L990] int marked = 0; VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}] [L993] COND TRUE __VERIFIER_nondet_int() || !marked [L996] x->next = malloc(sizeof(SLL)) [L997] EXPR x->next [L997] x = x->next [L998] x->next = ((void*)0) [L1000] COND TRUE __VERIFIER_nondet_int() [L1002] marked = 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={17:0}] [L1005] COND TRUE \read(marked) [L1006] x->data = 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={17:0}] [L993] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1011] x = head VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={19:0}] [L1013] COND FALSE !(!(((void*)0) != x)) VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=1, x={19:0}] [L1014] marked = 0 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}] [L1016] EXPR x->next [L1016] x->next != ((void*)0) && x->next->data == 0 [L1016] EXPR x->next [L1016] EXPR x->next->data [L1016] x->next != ((void*)0) && x->next->data == 0 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}, x->next={17:0}, x->next={17:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1016] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1021] EXPR x->next [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1021] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, marked=0, x={19:0}, x->next={17:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=0] [L1021] COND FALSE !(x->next != ((void*)0) && __VERIFIER_nondet_int()) [L1027] SLL* tmp = malloc(sizeof(SLL)); [L1028] tmp->data = 1 [L1029] tmp->next = ((void*)0) [L1030] EXPR x->next VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}, x->next={17:0}] [L1030] COND FALSE !(x->next == ((void*)0)) [L1034] EXPR x->next [L1034] tmp->next = x->next [L1035] x->next = tmp VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}] [L1038] marked = 0 [L1039] x = head VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}] [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}, x != ((void*)0) && x->data != 1=1, x->data=0] [L1041] COND TRUE x != ((void*)0) && x->data != 1 [L1043] EXPR x->data [L1043] marked = x->data [L1044] EXPR x->data VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}, x->data=0] [L1044] COND FALSE !(!(x->data == 0)) [L1045] COND FALSE !(!(marked == 0)) VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={19:0}] [L1046] EXPR x->next [L1046] x = x->next [L1041] x != ((void*)0) && x->data != 1 [L1041] EXPR x->data [L1041] x != ((void*)0) && x->data != 1 VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=0, tmp={22:0}, x={22:0}, x != ((void*)0) && x->data != 1=0, x->data=1] [L1041] COND FALSE !(x != ((void*)0) && x->data != 1) [L1048] COND TRUE x != ((void*)0) [L1050] EXPR x->data [L1050] marked = x->data [L1051] EXPR x->data VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=1, tmp={22:0}, x={22:0}, x->data=1] [L1051] COND TRUE !(x->data != 1) [L1051] __VERIFIER_error() VAL [head={19:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, marked=1, tmp={22:0}, x={22:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 61 locations, 6 error locations. UNSAFE Result, 143.9s OverallTime, 33 OverallIterations, 5 TraceHistogramMax, 67.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2159 SDtfs, 8007 SDslu, 19461 SDs, 0 SdLazy, 17901 SolverSat, 2995 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1835 GetRequests, 662 SyntacticMatches, 61 SemanticMatches, 1112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16898 ImplicationChecksByTransitivity, 60.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=32, 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.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 2900 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 72.3s InterpolantComputationTime, 1919 NumberOfCodeBlocks, 1919 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 1822 ConstructedInterpolants, 301 QuantifiedInterpolants, 2766104 SizeOfPredicates, 439 NumberOfNonLiveVariables, 4303 ConjunctsInSsa, 1344 ConjunctsInUnsatCore, 56 InterpolantComputations, 8 PerfectInterpolantSequences, 76/631 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...