./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0449324108a79a45878d323b6482663711b5aa73 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:07:57,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:07:57,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:07:57,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:07:57,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:07:57,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:07:57,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:07:57,472 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:07:57,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:07:57,474 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:07:57,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:07:57,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:07:57,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:07:57,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:07:57,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:07:57,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:07:57,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:07:57,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:07:57,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:07:57,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:07:57,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:07:57,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:07:57,487 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:07:57,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:07:57,487 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:07:57,488 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:07:57,489 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:07:57,490 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:07:57,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:07:57,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:07:57,491 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:07:57,492 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:07:57,492 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:07:57,492 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:07:57,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:07:57,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:07:57,494 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 05:07:57,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:07:57,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:07:57,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:07:57,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:07:57,508 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:07:57,508 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:07:57,508 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:07:57,509 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:07:57,509 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:07:57,509 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:07:57,509 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:07:57,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:07:57,509 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:07:57,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:07:57,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:07:57,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:07:57,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:07:57,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:07:57,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:07:57,510 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:07:57,510 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:07:57,510 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:07:57,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:07:57,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:07:57,511 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:07:57,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:07:57,511 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:07:57,511 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:07:57,512 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:07:57,514 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_834d9c04-b41a-45cf-85b4-71a02bb72cad/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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0449324108a79a45878d323b6482663711b5aa73 [2018-11-23 05:07:57,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:07:57,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:07:57,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:07:57,548 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:07:57,548 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:07:57,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca_true-termination.c.i [2018-11-23 05:07:57,586 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/data/6163b0861/070512ccbde34f219baee421b747b2b5/FLAGbd3cf1679 [2018-11-23 05:07:57,974 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:07:57,974 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/sv-benchmarks/c/termination-memory-alloca/GulwaniJainKoskinen-2009PLDI-Fig1-alloca_true-termination.c.i [2018-11-23 05:07:57,985 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/data/6163b0861/070512ccbde34f219baee421b747b2b5/FLAGbd3cf1679 [2018-11-23 05:07:58,348 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/data/6163b0861/070512ccbde34f219baee421b747b2b5 [2018-11-23 05:07:58,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:07:58,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:07:58,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:07:58,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:07:58,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:07:58,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a4561b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58, skipping insertion in model container [2018-11-23 05:07:58,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:07:58,397 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:07:58,578 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:07:58,586 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:07:58,612 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:07:58,686 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:07:58,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58 WrapperNode [2018-11-23 05:07:58,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:07:58,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:07:58,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:07:58,687 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:07:58,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:07:58,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:07:58,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:07:58,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:07:58,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (1/1) ... [2018-11-23 05:07:58,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:07:58,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:07:58,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:07:58,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:07:58,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:07:58,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:07:58,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:07:58,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:07:58,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:07:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:07:58,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:07:58,936 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:07:58,936 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 05:07:58,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:07:58 BoogieIcfgContainer [2018-11-23 05:07:58,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:07:58,937 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:07:58,937 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:07:58,939 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:07:58,939 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:07:58,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:07:58" (1/3) ... [2018-11-23 05:07:58,940 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2249b89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:07:58, skipping insertion in model container [2018-11-23 05:07:58,940 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:07:58,940 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:07:58" (2/3) ... [2018-11-23 05:07:58,941 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2249b89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:07:58, skipping insertion in model container [2018-11-23 05:07:58,941 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:07:58,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:07:58" (3/3) ... [2018-11-23 05:07:58,942 INFO L375 chiAutomizerObserver]: Analyzing ICFG GulwaniJainKoskinen-2009PLDI-Fig1-alloca_true-termination.c.i [2018-11-23 05:07:58,974 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:07:58,975 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:07:58,975 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:07:58,975 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:07:58,975 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:07:58,975 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:07:58,975 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:07:58,975 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:07:58,975 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:07:58,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 05:07:58,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:07:58,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:07:58,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:07:59,002 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 05:07:59,002 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:07:59,002 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:07:59,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 05:07:59,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:07:59,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:07:59,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:07:59,004 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 05:07:59,004 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:07:59,010 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 7#L552true assume !main_#t~short9; 11#L552-2true assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 13#L556-2true [2018-11-23 05:07:59,011 INFO L796 eck$LassoCheckResult]: Loop: 13#L556-2true call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 14#L555-1true assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 9#L556true assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13#L556-2true [2018-11-23 05:07:59,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:07:59,016 INFO L82 PathProgramCache]: Analyzing trace with hash 925671, now seen corresponding path program 1 times [2018-11-23 05:07:59,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:07:59,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:07:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:07:59,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:07:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:07:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:07:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:07:59,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:07:59,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:07:59,131 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:07:59,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:07:59,131 INFO L82 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 1 times [2018-11-23 05:07:59,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:07:59,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:07:59,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:07:59,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:07:59,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:07:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:07:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:07:59,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:07:59,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:07:59,295 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2018-11-23 05:07:59,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:07:59,313 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-23 05:07:59,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:07:59,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-23 05:07:59,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:07:59,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 8 transitions. [2018-11-23 05:07:59,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 05:07:59,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 05:07:59,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-23 05:07:59,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:07:59,321 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 05:07:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-23 05:07:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 05:07:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 05:07:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-23 05:07:59,345 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 05:07:59,345 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 05:07:59,345 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:07:59,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-23 05:07:59,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:07:59,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:07:59,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:07:59,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 05:07:59,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:07:59,346 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 35#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 37#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 39#L556-2 [2018-11-23 05:07:59,347 INFO L796 eck$LassoCheckResult]: Loop: 39#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 40#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 38#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 39#L556-2 [2018-11-23 05:07:59,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:07:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash 925609, now seen corresponding path program 1 times [2018-11-23 05:07:59,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:07:59,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:07:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:07:59,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:07:59,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:07:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:07:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:07:59,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:07:59,382 INFO L82 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 2 times [2018-11-23 05:07:59,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:07:59,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:07:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:07:59,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:07:59,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:07:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:07:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:07:59,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:07:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029994, now seen corresponding path program 1 times [2018-11-23 05:07:59,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:07:59,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:07:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:07:59,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:07:59,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:07:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:07:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:07:59,803 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 94 [2018-11-23 05:07:59,911 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:07:59,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:07:59,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:07:59,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:07:59,912 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:07:59,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:07:59,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:07:59,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:07:59,913 INFO L131 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 05:07:59,913 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:07:59,913 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:07:59,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:07:59,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:07:59,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:07:59,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:07:59,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:07:59,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,148 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2018-11-23 05:08:00,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:00,608 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:08:00,611 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:08:00,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:08:00,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:00,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:08:00,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:08:00,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:08:00,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:00,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:08:00,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:08:00,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:08:00,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:00,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:08:00,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:08:00,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:08:00,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:00,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:08:00,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:08:00,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:00,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:08:00,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:00,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,629 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:08:00,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,631 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:08:00,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:00,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:00,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:08:00,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:00,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:00,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:08:00,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:00,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:00,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:08:00,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:00,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,681 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:08:00,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,685 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:08:00,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:00,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:00,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:00,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:08:00,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:00,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:00,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:00,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:00,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:00,697 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 05:08:00,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:00,702 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 05:08:00,703 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:08:00,760 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:08:00,809 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-11-23 05:08:00,809 INFO L444 ModelExtractionUtils]: 8 out of 21 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-23 05:08:00,811 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:08:00,813 INFO L440 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2018-11-23 05:08:00,814 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:08:00,814 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~id~0.base) ULTIMATE.start_main_~id~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_1) = 3*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~id~0.base) ULTIMATE.start_main_~id~0.offset)_1 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~id~0.base) ULTIMATE.start_main_~id~0.offset)_1 >= 0] [2018-11-23 05:08:00,907 INFO L297 tatePredicateManager]: 22 out of 25 supporting invariants were superfluous and have been removed [2018-11-23 05:08:00,917 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:08:00,918 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:08:00,918 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:08:00,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:00,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:00,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 05:08:00,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:00,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:00,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:01,005 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 27 treesize of output 20 [2018-11-23 05:08:01,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:01,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:01,025 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 19 treesize of output 31 [2018-11-23 05:08:01,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:01,030 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:01,065 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 17 treesize of output 22 [2018-11-23 05:08:01,065 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 05:08:01,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:01,082 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 05:08:01,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 05:08:01,094 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:43, output treesize:41 [2018-11-23 05:08:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:01,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:01,202 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-23 05:08:01,202 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-23 05:08:01,268 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 13 states and 16 transitions. Complement of second has 9 states. [2018-11-23 05:08:01,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 05:08:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 05:08:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-23 05:08:01,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-23 05:08:01,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:08:01,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 05:08:01,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:08:01,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-23 05:08:01,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:08:01,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-23 05:08:01,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:08:01,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2018-11-23 05:08:01,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 05:08:01,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 05:08:01,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-11-23 05:08:01,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:01,274 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 05:08:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-11-23 05:08:01,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 05:08:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 05:08:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-23 05:08:01,275 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 05:08:01,275 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-23 05:08:01,275 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:08:01,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-23 05:08:01,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:08:01,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:01,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:01,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:08:01,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:08:01,276 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 211#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 212#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 214#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 219#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 222#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 215#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 216#L556-2 [2018-11-23 05:08:01,276 INFO L796 eck$LassoCheckResult]: Loop: 216#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 220#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 223#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 216#L556-2 [2018-11-23 05:08:01,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029996, now seen corresponding path program 1 times [2018-11-23 05:08:01,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:01,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:01,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:01,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:01,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:01,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:08:01,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:08:01,366 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:01,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:01,366 INFO L82 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 3 times [2018-11-23 05:08:01,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:01,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:01,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:01,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:01,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:08:01,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:08:01,446 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-23 05:08:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:01,486 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 05:08:01,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:08:01,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-23 05:08:01,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:08:01,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 17 transitions. [2018-11-23 05:08:01,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 05:08:01,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 05:08:01,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-23 05:08:01,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:01,488 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 05:08:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-23 05:08:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-11-23 05:08:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 05:08:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-23 05:08:01,490 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 05:08:01,490 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 05:08:01,490 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 05:08:01,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-23 05:08:01,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:08:01,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:01,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:01,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 05:08:01,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:08:01,491 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 256#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 257#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 259#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 264#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 266#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 262#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 263#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 267#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 260#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 261#L556-2 [2018-11-23 05:08:01,491 INFO L796 eck$LassoCheckResult]: Loop: 261#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 265#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 268#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 261#L556-2 [2018-11-23 05:08:01,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:01,491 INFO L82 PathProgramCache]: Analyzing trace with hash 658021387, now seen corresponding path program 1 times [2018-11-23 05:08:01,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:01,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:01,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:01,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:01,514 INFO L82 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 4 times [2018-11-23 05:08:01,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:01,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:01,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:01,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:01,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:01,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash 884417224, now seen corresponding path program 2 times [2018-11-23 05:08:01,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:01,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:01,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:02,099 WARN L180 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 139 [2018-11-23 05:08:02,170 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:08:02,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:08:02,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:08:02,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:08:02,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:08:02,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:08:02,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:08:02,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:08:02,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: GulwaniJainKoskinen-2009PLDI-Fig1-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 05:08:02,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:08:02,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:08:02,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:08:02,709 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:08:02,710 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:08:02,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:08:02,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:08:02,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:08:02,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:08:02,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:08:02,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:08:02,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:08:02,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:08:02,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:08:02,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:08:02,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:08:02,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:08:02,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:08:02,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:08:02,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:08:02,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:08:02,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:02,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:08:02,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:02,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,726 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:08:02,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,727 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:08:02,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:02,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:08:02,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:02,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,734 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:08:02,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,735 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:08:02,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:02,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:08:02,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:02,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:08:02,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,744 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:08:02,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:02,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:08:02,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:08:02,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:08:02,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:08:02,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:08:02,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:08:02,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:08:02,759 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 05:08:02,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:08:02,762 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 05:08:02,762 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:08:02,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:08:02,791 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 05:08:02,791 INFO L444 ModelExtractionUtils]: 17 out of 21 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 05:08:02,792 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:08:02,792 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-23 05:08:02,793 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:08:02,793 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~maxId~0.base) ULTIMATE.start_main_~maxId~0.offset)_2 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~tmp~0.base) ULTIMATE.start_main_~tmp~0.offset)_2 + 1 Supporting invariants [] [2018-11-23 05:08:02,849 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 05:08:02,852 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:08:02,852 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:08:02,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:02,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:02,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 05:08:02,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:02,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:02,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:02,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:08:02,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:11, output treesize:12 [2018-11-23 05:08:02,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:02,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:02,914 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 05:08:02,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:02,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:02,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-11-23 05:08:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:02,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:02,940 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 05:08:02,941 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-23 05:08:02,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 19 states and 23 transitions. Complement of second has 9 states. [2018-11-23 05:08:02,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 05:08:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 05:08:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-11-23 05:08:02,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 05:08:02,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:08:02,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-23 05:08:02,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:08:02,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-23 05:08:02,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:08:02,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2018-11-23 05:08:02,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:08:02,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2018-11-23 05:08:02,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 05:08:02,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 05:08:02,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-23 05:08:02,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:02,994 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-23 05:08:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-23 05:08:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 05:08:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 05:08:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-23 05:08:02,999 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-23 05:08:02,999 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-23 05:08:02,999 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 05:08:02,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-23 05:08:03,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 05:08:03,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:03,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:03,002 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1] [2018-11-23 05:08:03,002 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 05:08:03,002 INFO L794 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 458#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 459#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 461#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 466#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 469#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 464#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 465#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 470#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 462#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 463#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 473#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 472#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 467#L556-2 [2018-11-23 05:08:03,002 INFO L796 eck$LassoCheckResult]: Loop: 467#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 468#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 471#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 467#L556-2 [2018-11-23 05:08:03,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:03,002 INFO L82 PathProgramCache]: Analyzing trace with hash 884417226, now seen corresponding path program 3 times [2018-11-23 05:08:03,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:03,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:03,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:03,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:03,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:03,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:08:03,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:08:03,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 05:08:03,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:03,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:03,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:03,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:03,165 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 05:08:03,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,183 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 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 05:08:03,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 26 treesize of output 25 [2018-11-23 05:08:03,189 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:03,211 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 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 05:08:03,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 05:08:03,224 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:03,235 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 2 xjuncts. [2018-11-23 05:08:03,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:38 [2018-11-23 05:08:03,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:03,257 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 36 treesize of output 41 [2018-11-23 05:08:03,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:03,261 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 37 treesize of output 26 [2018-11-23 05:08:03,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2018-11-23 05:08:03,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:03,288 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 32 treesize of output 35 [2018-11-23 05:08:03,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-23 05:08:03,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-23 05:08:03,310 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 29 treesize of output 25 [2018-11-23 05:08:03,312 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 05:08:03,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,318 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 05:08:03,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,324 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 05:08:03,324 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-11-23 05:08:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:03,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:03,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-11-23 05:08:03,350 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:03,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:03,350 INFO L82 PathProgramCache]: Analyzing trace with hash 45842, now seen corresponding path program 5 times [2018-11-23 05:08:03,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:03,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:03,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:03,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:03,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:03,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:08:03,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:08:03,430 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-11-23 05:08:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:03,642 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 05:08:03,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:08:03,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2018-11-23 05:08:03,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 05:08:03,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 39 transitions. [2018-11-23 05:08:03,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-23 05:08:03,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-23 05:08:03,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2018-11-23 05:08:03,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:03,646 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 05:08:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2018-11-23 05:08:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2018-11-23 05:08:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 05:08:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 05:08:03,648 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 05:08:03,648 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 05:08:03,648 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 05:08:03,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-23 05:08:03,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 05:08:03,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:03,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:03,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2018-11-23 05:08:03,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-23 05:08:03,650 INFO L794 eck$LassoCheckResult]: Stem: 582#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 580#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 581#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 583#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 588#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 598#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 599#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 597#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 596#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 595#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 594#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 592#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 586#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 587#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 591#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 584#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 585#L556-2 [2018-11-23 05:08:03,650 INFO L796 eck$LassoCheckResult]: Loop: 585#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 601#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 600#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 589#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 590#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 593#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 585#L556-2 [2018-11-23 05:08:03,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1950824723, now seen corresponding path program 4 times [2018-11-23 05:08:03,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:03,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:03,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:03,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:03,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 05:08:03,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:03,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:08:03,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:08:03,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:08:03,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:03,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:03,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:03,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:03,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, 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 05:08:03,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,904 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 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 05:08:03,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 05:08:03,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:03,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:03,935 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 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-23 05:08:03,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 05:08:03,956 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:03,967 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 2 xjuncts. [2018-11-23 05:08:03,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:38 [2018-11-23 05:08:04,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:04,019 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 36 treesize of output 41 [2018-11-23 05:08:04,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:04,023 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 37 treesize of output 26 [2018-11-23 05:08:04,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2018-11-23 05:08:04,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:04,063 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 32 treesize of output 35 [2018-11-23 05:08:04,065 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 31 treesize of output 24 [2018-11-23 05:08:04,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-23 05:08:04,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:04,085 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 32 treesize of output 39 [2018-11-23 05:08:04,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:04,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 28 treesize of output 7 [2018-11-23 05:08:04,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-23 05:08:04,143 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 29 treesize of output 25 [2018-11-23 05:08:04,146 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 05:08:04,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,153 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 05:08:04,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:04,161 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 05:08:04,162 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-11-23 05:08:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:04,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:04,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-23 05:08:04,195 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:04,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1365695075, now seen corresponding path program 1 times [2018-11-23 05:08:04,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:04,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:04,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:04,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:04,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 05:08:04,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-23 05:08:04,318 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand 16 states. [2018-11-23 05:08:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:04,614 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 05:08:04,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:08:04,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2018-11-23 05:08:04,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 05:08:04,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 35 transitions. [2018-11-23 05:08:04,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 05:08:04,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 05:08:04,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 35 transitions. [2018-11-23 05:08:04,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:04,618 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-23 05:08:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 35 transitions. [2018-11-23 05:08:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2018-11-23 05:08:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 05:08:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 05:08:04,620 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 05:08:04,620 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 05:08:04,620 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 05:08:04,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2018-11-23 05:08:04,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 05:08:04,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:04,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:04,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1] [2018-11-23 05:08:04,622 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2018-11-23 05:08:04,622 INFO L794 eck$LassoCheckResult]: Stem: 720#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 718#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 719#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 721#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 726#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 727#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 724#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 725#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 738#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 737#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 736#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 735#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 734#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 728#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 729#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 739#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 731#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 730#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 722#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 723#L556-2 [2018-11-23 05:08:04,622 INFO L796 eck$LassoCheckResult]: Loop: 723#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 745#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 740#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 732#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 733#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 743#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 742#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 744#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 741#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 723#L556-2 [2018-11-23 05:08:04,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1816884246, now seen corresponding path program 5 times [2018-11-23 05:08:04,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:04,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:04,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:04,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:04,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:08:04,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:04,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:08:04,918 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:08:04,965 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-23 05:08:04,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:04,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2018-11-23 05:08:04,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:04,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 50 treesize of output 52 [2018-11-23 05:08:05,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:05,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,049 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 50 treesize of output 42 [2018-11-23 05:08:05,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:05,052 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,076 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 19 treesize of output 31 [2018-11-23 05:08:05,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:05,081 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,103 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 17 treesize of output 22 [2018-11-23 05:08:05,104 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 05:08:05,117 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:05,132 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:05,136 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 45 treesize of output 37 [2018-11-23 05:08:05,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:05,139 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-23 05:08:05,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 20 treesize of output 19 [2018-11-23 05:08:05,170 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,206 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 17 treesize of output 22 [2018-11-23 05:08:05,206 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-23 05:08:05,218 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:05,232 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:05,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-23 05:08:05,275 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:95, output treesize:85 [2018-11-23 05:08:05,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-11-23 05:08:05,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,344 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-11-23 05:08:05,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,380 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 1 case distinctions, treesize of input 46 treesize of output 43 [2018-11-23 05:08:05,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:05,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,413 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 1 case distinctions, treesize of input 46 treesize of output 43 [2018-11-23 05:08:05,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:05,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,422 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:05,440 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:107, output treesize:85 [2018-11-23 05:08:05,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,479 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 1 case distinctions, treesize of input 59 treesize of output 62 [2018-11-23 05:08:05,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,482 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 30 [2018-11-23 05:08:05,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,516 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 1 case distinctions, treesize of input 59 treesize of output 62 [2018-11-23 05:08:05,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,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 34 treesize of output 30 [2018-11-23 05:08:05,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:05,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:85 [2018-11-23 05:08:05,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,604 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 1 case distinctions, treesize of input 66 treesize of output 65 [2018-11-23 05:08:05,606 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 37 treesize of output 31 [2018-11-23 05:08:05,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,637 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 1 case distinctions, treesize of input 66 treesize of output 65 [2018-11-23 05:08:05,639 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 37 treesize of output 31 [2018-11-23 05:08:05,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:05,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:133, output treesize:99 [2018-11-23 05:08:05,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,780 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 1 case distinctions, treesize of input 70 treesize of output 79 [2018-11-23 05:08:05,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,782 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 38 treesize of output 16 [2018-11-23 05:08:05,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,797 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 05:08:05,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:49 [2018-11-23 05:08:05,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,826 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 1 case distinctions, treesize of input 58 treesize of output 69 [2018-11-23 05:08:05,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,828 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 7 [2018-11-23 05:08:05,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,840 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 05:08:05,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:49 [2018-11-23 05:08:05,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 55 [2018-11-23 05:08:05,882 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-11-23 05:08:05,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,909 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 05:08:05,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,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 18 treesize of output 11 [2018-11-23 05:08:05,926 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,936 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 39 treesize of output 32 [2018-11-23 05:08:05,937 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:05,948 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-11-23 05:08:05,948 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:05,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:05,969 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:63, output treesize:7 [2018-11-23 05:08:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:06,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:06,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-11-23 05:08:06,019 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:06,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:06,019 INFO L82 PathProgramCache]: Analyzing trace with hash -803259212, now seen corresponding path program 2 times [2018-11-23 05:08:06,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:06,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:06,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:06,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:06,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:06,216 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2018-11-23 05:08:06,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 05:08:06,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-11-23 05:08:06,257 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 6 Second operand 22 states. [2018-11-23 05:08:06,710 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2018-11-23 05:08:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:07,243 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-23 05:08:07,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 05:08:07,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 60 transitions. [2018-11-23 05:08:07,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 05:08:07,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 52 states and 56 transitions. [2018-11-23 05:08:07,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 05:08:07,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 05:08:07,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 56 transitions. [2018-11-23 05:08:07,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:07,245 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-23 05:08:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 56 transitions. [2018-11-23 05:08:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2018-11-23 05:08:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 05:08:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 05:08:07,247 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 05:08:07,247 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 05:08:07,247 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 05:08:07,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 37 transitions. [2018-11-23 05:08:07,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 05:08:07,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:07,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:07,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 2, 1, 1, 1, 1] [2018-11-23 05:08:07,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2018-11-23 05:08:07,249 INFO L794 eck$LassoCheckResult]: Stem: 921#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 919#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 920#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 922#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 927#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 928#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 950#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 949#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 930#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 923#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 924#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 931#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 925#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 926#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 929#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 952#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 951#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 947#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 948#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 946#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 945#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 944#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 936#L556-2 [2018-11-23 05:08:07,249 INFO L796 eck$LassoCheckResult]: Loop: 936#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 942#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 932#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 933#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 943#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 941#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 940#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 939#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 938#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 935#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 937#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 934#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 936#L556-2 [2018-11-23 05:08:07,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1620751923, now seen corresponding path program 6 times [2018-11-23 05:08:07,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:07,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:07,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:07,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:07,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:07,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:07,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:08:07,609 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:08:07,645 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-23 05:08:07,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:07,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:07,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 44 treesize of output 46 [2018-11-23 05:08:07,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:07,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 50 treesize of output 52 [2018-11-23 05:08:07,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:07,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,687 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 40 treesize of output 32 [2018-11-23 05:08:07,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 8 treesize of output 7 [2018-11-23 05:08:07,689 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,704 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 19 treesize of output 31 [2018-11-23 05:08:07,712 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 17 treesize of output 22 [2018-11-23 05:08:07,712 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 05:08:07,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 16 treesize of output 15 [2018-11-23 05:08:07,726 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,734 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:07,744 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:07,746 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 45 treesize of output 37 [2018-11-23 05:08:07,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:07,749 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,765 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 19 treesize of output 31 [2018-11-23 05:08:07,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:07,768 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,784 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 17 treesize of output 22 [2018-11-23 05:08:07,785 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-23 05:08:07,794 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:07,803 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:07,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:08:07,827 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:95, output treesize:65 [2018-11-23 05:08:07,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:07,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:07,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:07,890 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:08:07,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,906 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 1 case distinctions, treesize of input 38 treesize of output 43 [2018-11-23 05:08:07,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:07,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,914 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,921 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 05:08:07,922 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:53, output treesize:42 [2018-11-23 05:08:07,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:07,952 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:08:07,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:07,954 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 30 [2018-11-23 05:08:07,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:07,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:08:07,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:07,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 1 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 05:08:07,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 18 [2018-11-23 05:08:07,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:08:08,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:08,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:08:08,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:08,089 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 38 treesize of output 16 [2018-11-23 05:08:08,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:44 [2018-11-23 05:08:08,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:08,184 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 1 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 05:08:08,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:08,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16 [2018-11-23 05:08:08,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,200 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 05:08:08,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:52 [2018-11-23 05:08:08,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:08,235 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:08:08,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:08,238 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 7 [2018-11-23 05:08:08,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,252 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 05:08:08,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:08:08,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2018-11-23 05:08:08,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:08,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:08,293 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-11-23 05:08:08,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,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 46 treesize of output 38 [2018-11-23 05:08:08,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,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 18 treesize of output 11 [2018-11-23 05:08:08,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,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 25 treesize of output 18 [2018-11-23 05:08:08,337 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,345 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 05:08:08,346 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:08,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:08,362 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:66, output treesize:7 [2018-11-23 05:08:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:08,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:08,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-11-23 05:08:08,391 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:08,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1662545091, now seen corresponding path program 3 times [2018-11-23 05:08:08,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:08,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:08,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:08,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:08,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:08,692 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 129 [2018-11-23 05:08:08,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 05:08:08,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2018-11-23 05:08:08,751 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. cyclomatic complexity: 6 Second operand 28 states. [2018-11-23 05:08:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:10,188 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-11-23 05:08:10,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 05:08:10,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 136 transitions. [2018-11-23 05:08:10,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-23 05:08:10,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 120 states and 132 transitions. [2018-11-23 05:08:10,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-23 05:08:10,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-23 05:08:10,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 132 transitions. [2018-11-23 05:08:10,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:10,191 INFO L705 BuchiCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-11-23 05:08:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 132 transitions. [2018-11-23 05:08:10,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2018-11-23 05:08:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 05:08:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-23 05:08:10,195 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 05:08:10,195 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 05:08:10,195 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 05:08:10,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 99 transitions. [2018-11-23 05:08:10,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-23 05:08:10,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:10,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:10,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 5, 2, 1, 1, 1, 1] [2018-11-23 05:08:10,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2018-11-23 05:08:10,197 INFO L794 eck$LassoCheckResult]: Stem: 1233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1231#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 1232#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 1234#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 1239#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1312#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1310#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1307#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1305#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1303#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 1301#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1299#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1297#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1295#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1293#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1291#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1289#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1287#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1285#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1284#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1283#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1277#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1278#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1272#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1264#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 1263#L556-2 [2018-11-23 05:08:10,197 INFO L796 eck$LassoCheckResult]: Loop: 1263#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1262#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1243#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1244#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1270#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1268#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1258#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1259#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1254#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1255#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1250#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1251#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1267#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1266#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1265#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 1263#L556-2 [2018-11-23 05:08:10,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:10,198 INFO L82 PathProgramCache]: Analyzing trace with hash 201760010, now seen corresponding path program 7 times [2018-11-23 05:08:10,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:10,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:10,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:10,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:10,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:08:10,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:10,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:08:10,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:10,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:10,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 05:08:10,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 12 treesize of output 11 [2018-11-23 05:08:10,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 05:08:10,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,620 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:08:10,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,629 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 17 treesize of output 19 [2018-11-23 05:08:10,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:10,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,637 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 05:08:10,637 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:08:10,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,694 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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:08:10,697 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,698 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 43 treesize of output 43 [2018-11-23 05:08:10,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2018-11-23 05:08:10,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:08:10,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 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-23 05:08:10,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:08:10,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,820 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:08:10,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,823 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 7 [2018-11-23 05:08:10,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:08:10,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,867 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:08:10,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,873 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 7 [2018-11-23 05:08:10,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:10,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:08:10,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,990 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 1 case distinctions, treesize of input 63 treesize of output 72 [2018-11-23 05:08:10,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:10,994 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 38 treesize of output 16 [2018-11-23 05:08:10,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:11,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:11,009 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 05:08:11,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-11-23 05:08:11,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:11,089 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 1 case distinctions, treesize of input 70 treesize of output 79 [2018-11-23 05:08:11,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:11,092 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 37 treesize of output 15 [2018-11-23 05:08:11,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:11,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:11,112 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 05:08:11,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2018-11-23 05:08:11,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 05:08:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-11-23 05:08:11,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:11,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-23 05:08:11,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 05:08:11,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 05:08:11,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:11,224 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 05:08:11,225 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:11,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:11,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:11,238 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 05:08:11,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:11,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:11,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:11,255 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:71, output treesize:7 [2018-11-23 05:08:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:11,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:11,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2018-11-23 05:08:11,292 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:11,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:11,293 INFO L82 PathProgramCache]: Analyzing trace with hash -682095020, now seen corresponding path program 4 times [2018-11-23 05:08:11,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:11,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:11,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:11,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:11,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:11,855 WARN L180 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 153 [2018-11-23 05:08:11,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 05:08:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-11-23 05:08:11,916 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. cyclomatic complexity: 13 Second operand 30 states. [2018-11-23 05:08:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:13,176 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 05:08:13,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 05:08:13,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 112 transitions. [2018-11-23 05:08:13,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-23 05:08:13,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 77 states and 84 transitions. [2018-11-23 05:08:13,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-23 05:08:13,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-23 05:08:13,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 84 transitions. [2018-11-23 05:08:13,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:13,178 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-11-23 05:08:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 84 transitions. [2018-11-23 05:08:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 05:08:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 05:08:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-11-23 05:08:13,181 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-23 05:08:13,181 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-23 05:08:13,181 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 05:08:13,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 82 transitions. [2018-11-23 05:08:13,181 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27 [2018-11-23 05:08:13,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:13,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:13,182 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 5, 2, 1, 1, 1, 1] [2018-11-23 05:08:13,182 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2018-11-23 05:08:13,182 INFO L794 eck$LassoCheckResult]: Stem: 1576#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1574#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 1575#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 1577#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 1582#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1598#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1597#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1596#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1595#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1593#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1594#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1590#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1589#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 1588#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1584#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1585#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1619#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1617#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1615#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1613#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1608#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1610#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1607#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1583#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1578#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 1579#L556-2 [2018-11-23 05:08:13,182 INFO L796 eck$LassoCheckResult]: Loop: 1579#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1586#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1620#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1618#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1616#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1614#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1612#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1611#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1609#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1602#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1606#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1601#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 1579#L556-2 [2018-11-23 05:08:13,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:13,183 INFO L82 PathProgramCache]: Analyzing trace with hash 636022350, now seen corresponding path program 8 times [2018-11-23 05:08:13,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:13,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:13,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:13,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:13,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:13,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:08:13,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:08:13,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:08:13,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:13,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:13,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 [2018-11-23 05:08:13,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:13,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2018-11-23 05:08:13,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:13,544 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:13,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-11-23 05:08:13,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,562 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:08:13,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,569 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 26 [2018-11-23 05:08:13,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:13,571 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,575 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,580 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 05:08:13,580 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-11-23 05:08:13,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,599 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 38 treesize of output 45 [2018-11-23 05:08:13,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,602 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 30 [2018-11-23 05:08:13,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:08:13,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,655 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 1 case distinctions, treesize of input 49 treesize of output 58 [2018-11-23 05:08:13,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,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 43 treesize of output 43 [2018-11-23 05:08:13,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-11-23 05:08:13,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,701 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 1 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 05:08:13,703 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 18 [2018-11-23 05:08:13,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:08:13,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,805 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:08:13,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16 [2018-11-23 05:08:13,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,821 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 05:08:13,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:44 [2018-11-23 05:08:13,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,850 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 1 case distinctions, treesize of input 53 treesize of output 64 [2018-11-23 05:08:13,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,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 28 treesize of output 7 [2018-11-23 05:08:13,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,866 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 05:08:13,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-11-23 05:08:13,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,909 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 1 case distinctions, treesize of input 53 treesize of output 64 [2018-11-23 05:08:13,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:13,912 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 7 [2018-11-23 05:08:13,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,927 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 05:08:13,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-11-23 05:08:13,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 05:08:13,965 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 48 treesize of output 42 [2018-11-23 05:08:13,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:13,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 05:08:13,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:14,008 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 11 [2018-11-23 05:08:14,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:14,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:14,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:14,023 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-23 05:08:14,024 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:14,034 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 11 [2018-11-23 05:08:14,035 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:14,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:14,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:14,050 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:58, output treesize:7 [2018-11-23 05:08:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:14,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:14,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-11-23 05:08:14,075 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:14,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1662545091, now seen corresponding path program 5 times [2018-11-23 05:08:14,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:14,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:14,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:14,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:14,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:14,387 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 129 [2018-11-23 05:08:14,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 05:08:14,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2018-11-23 05:08:14,425 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. cyclomatic complexity: 11 Second operand 26 states. [2018-11-23 05:08:39,196 WARN L180 SmtUtils]: Spent 24.05 s on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-11-23 05:08:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:39,319 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 05:08:39,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 05:08:39,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 114 transitions. [2018-11-23 05:08:39,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-23 05:08:39,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 102 states and 110 transitions. [2018-11-23 05:08:39,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-23 05:08:39,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-23 05:08:39,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 110 transitions. [2018-11-23 05:08:39,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:39,322 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-11-23 05:08:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 110 transitions. [2018-11-23 05:08:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 43. [2018-11-23 05:08:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 05:08:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-23 05:08:39,325 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-23 05:08:39,325 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-23 05:08:39,325 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 05:08:39,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 46 transitions. [2018-11-23 05:08:39,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 05:08:39,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:39,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:39,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 6, 2, 1, 1, 1, 1] [2018-11-23 05:08:39,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2018-11-23 05:08:39,327 INFO L794 eck$LassoCheckResult]: Stem: 1910#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1908#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 1909#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 1911#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 1916#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1945#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1944#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1943#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1938#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1941#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1937#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1936#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1912#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 1913#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1917#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1914#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1915#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1918#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1950#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1949#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1948#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1947#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1946#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1940#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1942#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1939#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1919#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1920#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 1925#L556-2 [2018-11-23 05:08:39,327 INFO L796 eck$LassoCheckResult]: Loop: 1925#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1934#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1921#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1922#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1935#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1933#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1932#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1931#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1930#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1929#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1928#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1927#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 1924#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 1926#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 1923#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 1925#L556-2 [2018-11-23 05:08:39,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:39,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1653924631, now seen corresponding path program 9 times [2018-11-23 05:08:39,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:39,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:39,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:39,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:39,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 7 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:39,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:39,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:08:40,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:08:40,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 05:08:40,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:40,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:40,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 05:08:40,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:40,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2018-11-23 05:08:40,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:40,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:40,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-11-23 05:08:40,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,201 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:08:40,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,221 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 26 [2018-11-23 05:08:40,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:40,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,235 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 05:08:40,235 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-11-23 05:08:40,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 45 [2018-11-23 05:08:40,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,271 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 30 [2018-11-23 05:08:40,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:08:40,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 58 [2018-11-23 05:08:40,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-11-23 05:08:40,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-11-23 05:08:40,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,421 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 1 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 05:08:40,423 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 18 [2018-11-23 05:08:40,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:08:40,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,572 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:08:40,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,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, 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 16 [2018-11-23 05:08:40,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:44 [2018-11-23 05:08:40,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,730 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 1 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 05:08:40,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,733 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 38 treesize of output 16 [2018-11-23 05:08:40,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:52 [2018-11-23 05:08:40,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,872 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 1 case distinctions, treesize of input 73 treesize of output 82 [2018-11-23 05:08:40,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,874 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 38 treesize of output 16 [2018-11-23 05:08:40,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:60 [2018-11-23 05:08:40,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,967 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 1 case distinctions, treesize of input 69 treesize of output 80 [2018-11-23 05:08:40,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:40,969 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 7 [2018-11-23 05:08:40,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:40,987 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 05:08:40,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:60 [2018-11-23 05:08:41,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 64 [2018-11-23 05:08:41,035 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-23 05:08:41,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:41,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 05:08:41,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:41,088 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 38 treesize of output 28 [2018-11-23 05:08:41,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:41,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:41,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:41,108 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-11-23 05:08:41,109 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:41,122 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 11 [2018-11-23 05:08:41,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:41,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:41,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:41,141 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:74, output treesize:7 [2018-11-23 05:08:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:41,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:41,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2018-11-23 05:08:41,198 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:41,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash -682095020, now seen corresponding path program 6 times [2018-11-23 05:08:41,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:41,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:41,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:41,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:41,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:41,693 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 153 [2018-11-23 05:08:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 05:08:41,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 05:08:41,751 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. cyclomatic complexity: 6 Second operand 38 states. [2018-11-23 05:08:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:43,715 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-11-23 05:08:43,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 05:08:43,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 156 transitions. [2018-11-23 05:08:43,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-23 05:08:43,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 140 states and 152 transitions. [2018-11-23 05:08:43,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-23 05:08:43,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-23 05:08:43,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 152 transitions. [2018-11-23 05:08:43,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:43,718 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 152 transitions. [2018-11-23 05:08:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 152 transitions. [2018-11-23 05:08:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2018-11-23 05:08:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 05:08:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-11-23 05:08:43,723 INFO L728 BuchiCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-11-23 05:08:43,723 INFO L608 BuchiCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-11-23 05:08:43,723 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 05:08:43,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 125 transitions. [2018-11-23 05:08:43,724 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-23 05:08:43,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:43,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:43,724 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 7, 2, 1, 1, 1, 1] [2018-11-23 05:08:43,724 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 1] [2018-11-23 05:08:43,725 INFO L794 eck$LassoCheckResult]: Stem: 2297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2295#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 2296#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 2298#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 2303#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2395#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2394#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2393#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2392#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2391#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2389#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2388#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2387#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 2386#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2385#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2384#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2383#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2382#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2380#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2378#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2376#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2374#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2372#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2370#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2368#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2366#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2357#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2358#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2350#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2346#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2337#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 2336#L556-2 [2018-11-23 05:08:43,725 INFO L796 eck$LassoCheckResult]: Loop: 2336#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2335#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2307#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2308#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2340#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2338#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2331#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2332#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2327#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2328#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2323#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2324#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2319#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2320#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2315#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2316#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2312#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2313#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 2336#L556-2 [2018-11-23 05:08:43,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash -203905938, now seen corresponding path program 10 times [2018-11-23 05:08:43,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:43,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:43,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 2 proven. 104 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 05:08:44,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:44,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:08:44,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:08:44,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:08:44,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:44,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:44,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,250 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:08:44,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,258 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 26 [2018-11-23 05:08:44,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:44,259 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,267 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 05:08:44,267 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-11-23 05:08:44,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,292 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 38 treesize of output 45 [2018-11-23 05:08:44,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,295 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 30 [2018-11-23 05:08:44,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:08:44,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,376 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 1 case distinctions, treesize of input 49 treesize of output 58 [2018-11-23 05:08:44,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,379 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 43 treesize of output 43 [2018-11-23 05:08:44,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-11-23 05:08:44,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,422 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 1 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 05:08:44,424 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 18 [2018-11-23 05:08:44,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:08:44,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,524 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:08:44,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2018-11-23 05:08:44,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:44 [2018-11-23 05:08:44,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,649 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 1 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 05:08:44,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,652 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 38 treesize of output 16 [2018-11-23 05:08:44,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:52 [2018-11-23 05:08:44,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,776 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 1 case distinctions, treesize of input 73 treesize of output 82 [2018-11-23 05:08:44,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,779 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 38 treesize of output 16 [2018-11-23 05:08:44,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:60 [2018-11-23 05:08:44,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,918 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 1 case distinctions, treesize of input 81 treesize of output 90 [2018-11-23 05:08:44,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:44,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 38 treesize of output 16 [2018-11-23 05:08:44,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:44,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:68 [2018-11-23 05:08:45,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:45,088 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 1 case distinctions, treesize of input 89 treesize of output 98 [2018-11-23 05:08:45,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:45,091 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 38 treesize of output 16 [2018-11-23 05:08:45,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:45,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:45,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:45,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:76 [2018-11-23 05:08:45,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 76 [2018-11-23 05:08:45,207 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 68 treesize of output 61 [2018-11-23 05:08:45,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:45,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:45,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:45,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-11-23 05:08:45,242 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:45,264 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 64 treesize of output 57 [2018-11-23 05:08:45,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:45,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-11-23 05:08:45,281 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:45,292 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 05:08:45,292 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:45,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:45,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:45,308 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:90, output treesize:7 [2018-11-23 05:08:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:45,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:45,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 43 [2018-11-23 05:08:45,353 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:45,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash -802506973, now seen corresponding path program 7 times [2018-11-23 05:08:45,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:45,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:45,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:45,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:45,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:46,118 WARN L180 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 177 [2018-11-23 05:08:46,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 05:08:46,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1667, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 05:08:46,172 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. cyclomatic complexity: 15 Second operand 44 states. [2018-11-23 05:08:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:47,632 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-11-23 05:08:47,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 05:08:47,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 136 transitions. [2018-11-23 05:08:47,634 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-23 05:08:47,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 93 states and 101 transitions. [2018-11-23 05:08:47,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-23 05:08:47,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-23 05:08:47,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 101 transitions. [2018-11-23 05:08:47,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:47,635 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-11-23 05:08:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 101 transitions. [2018-11-23 05:08:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-23 05:08:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 05:08:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-11-23 05:08:47,639 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-11-23 05:08:47,639 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-11-23 05:08:47,639 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 05:08:47,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 101 transitions. [2018-11-23 05:08:47,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-23 05:08:47,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:47,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:47,640 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 7, 2, 1, 1, 1, 1] [2018-11-23 05:08:47,640 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2018-11-23 05:08:47,640 INFO L794 eck$LassoCheckResult]: Stem: 2728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2726#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 2727#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 2729#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 2734#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2739#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2732#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2733#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2740#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2818#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2817#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2737#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2738#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2810#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2746#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2730#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 2731#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2809#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2808#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2807#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2806#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2805#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2804#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2802#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2801#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2800#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2771#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2799#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2798#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2795#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2793#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 2745#L556-2 [2018-11-23 05:08:47,641 INFO L796 eck$LassoCheckResult]: Loop: 2745#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2790#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2763#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2764#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2785#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2759#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2757#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2758#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2777#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2753#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2751#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2752#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 2744#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 2768#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 2743#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 2745#L556-2 [2018-11-23 05:08:47,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:47,641 INFO L82 PathProgramCache]: Analyzing trace with hash 463969450, now seen corresponding path program 11 times [2018-11-23 05:08:47,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:47,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:47,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:47,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:08:47,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 7 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:48,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:48,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:08:48,025 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:08:48,083 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 05:08:48,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:48,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:48,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,147 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 05:08:48,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,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, 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 05:08:48,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:48,158 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,166 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 05:08:48,166 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:31 [2018-11-23 05:08:48,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,190 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 45 [2018-11-23 05:08:48,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,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 34 treesize of output 30 [2018-11-23 05:08:48,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:31 [2018-11-23 05:08:48,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,229 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 45 [2018-11-23 05:08:48,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,231 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 30 [2018-11-23 05:08:48,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:31 [2018-11-23 05:08:48,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,305 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 69 [2018-11-23 05:08:48,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,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 58 treesize of output 58 [2018-11-23 05:08:48,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,328 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 40 [2018-11-23 05:08:48,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:48,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,349 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2018-11-23 05:08:48,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,416 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 1 case distinctions, treesize of input 58 treesize of output 80 [2018-11-23 05:08:48,428 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 52 treesize of output 72 [2018-11-23 05:08:48,429 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:08:48,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:51 [2018-11-23 05:08:48,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,568 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 1 case distinctions, treesize of input 70 treesize of output 98 [2018-11-23 05:08:48,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,579 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 62 [2018-11-23 05:08:48,580 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:08:48,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:80, output treesize:61 [2018-11-23 05:08:48,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,723 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 1 case distinctions, treesize of input 80 treesize of output 108 [2018-11-23 05:08:48,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,735 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 65 [2018-11-23 05:08:48,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:08:48,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:90, output treesize:71 [2018-11-23 05:08:48,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,898 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 1 case distinctions, treesize of input 90 treesize of output 118 [2018-11-23 05:08:48,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:48,910 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 59 treesize of output 65 [2018-11-23 05:08:48,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:08:48,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:48,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:100, output treesize:81 [2018-11-23 05:08:49,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:49,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:49,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:49,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:49,106 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 1 case distinctions, treesize of input 100 treesize of output 128 [2018-11-23 05:08:49,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:49,118 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 65 [2018-11-23 05:08:49,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:08:49,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:49,153 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 05:08:49,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:91 [2018-11-23 05:08:49,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:49,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:49,206 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 1 case distinctions, treesize of input 87 treesize of output 83 [2018-11-23 05:08:49,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2018-11-23 05:08:49,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:49,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:49,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:49,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2018-11-23 05:08:49,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:49,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-23 05:08:49,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:49,267 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-23 05:08:49,267 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:49,277 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 15 [2018-11-23 05:08:49,277 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:49,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:49,296 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 05:08:49,296 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:91, output treesize:7 [2018-11-23 05:08:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:49,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:49,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 40 [2018-11-23 05:08:49,339 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:49,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:49,340 INFO L82 PathProgramCache]: Analyzing trace with hash -682095020, now seen corresponding path program 8 times [2018-11-23 05:08:49,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:49,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:49,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:49,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:49,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:49,788 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 153 [2018-11-23 05:08:49,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 05:08:49,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1454, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 05:08:49,832 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. cyclomatic complexity: 12 Second operand 41 states. [2018-11-23 05:08:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:08:52,324 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-11-23 05:08:52,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 05:08:52,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 151 transitions. [2018-11-23 05:08:52,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2018-11-23 05:08:52,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 132 states and 141 transitions. [2018-11-23 05:08:52,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-11-23 05:08:52,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-23 05:08:52,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 141 transitions. [2018-11-23 05:08:52,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:08:52,328 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-11-23 05:08:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 141 transitions. [2018-11-23 05:08:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 67. [2018-11-23 05:08:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 05:08:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 05:08:52,331 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 05:08:52,331 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 05:08:52,331 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 05:08:52,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 71 transitions. [2018-11-23 05:08:52,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-23 05:08:52,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:08:52,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:08:52,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 9, 2, 1, 1, 1, 1] [2018-11-23 05:08:52,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 1] [2018-11-23 05:08:52,332 INFO L794 eck$LassoCheckResult]: Stem: 3185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3183#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 3184#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 3186#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 3191#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3229#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3228#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3227#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3226#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3225#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3223#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3224#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3248#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3247#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3220#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3222#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3219#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3196#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3187#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 3188#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3241#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3240#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3239#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3238#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3237#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3236#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3235#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3234#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3233#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3232#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3231#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3230#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3218#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3221#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3217#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3216#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3215#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 3201#L556-2 [2018-11-23 05:08:52,332 INFO L796 eck$LassoCheckResult]: Loop: 3201#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3213#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3197#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3198#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3214#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3212#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3211#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3210#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3209#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3208#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3207#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3206#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3205#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3204#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3203#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3200#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3202#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3199#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 3201#L556-2 [2018-11-23 05:08:52,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:52,333 INFO L82 PathProgramCache]: Analyzing trace with hash 811822094, now seen corresponding path program 12 times [2018-11-23 05:08:52,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:52,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:52,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:52,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:52,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:08:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 38 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:53,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:08:53,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:08:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:08:53,158 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 05:08:53,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:08:53,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:08:53,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 [2018-11-23 05:08:53,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:53,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2018-11-23 05:08:53,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:08:53,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:53,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-11-23 05:08:53,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,205 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:08:53,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,212 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 26 [2018-11-23 05:08:53,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:08:53,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,221 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 05:08:53,221 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-11-23 05:08:53,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,246 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 38 treesize of output 45 [2018-11-23 05:08:53,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,248 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 30 [2018-11-23 05:08:53,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:08:53,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,285 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 38 treesize of output 45 [2018-11-23 05:08:53,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,287 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 30 [2018-11-23 05:08:53,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:08:53,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 45 [2018-11-23 05:08:53,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,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 34 treesize of output 30 [2018-11-23 05:08:53,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:08:53,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,402 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 1 case distinctions, treesize of input 49 treesize of output 58 [2018-11-23 05:08:53,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,404 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 43 treesize of output 43 [2018-11-23 05:08:53,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-11-23 05:08:53,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,457 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 1 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 05:08:53,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 26 treesize of output 18 [2018-11-23 05:08:53,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:08:53,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,597 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:08:53,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,600 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 38 treesize of output 16 [2018-11-23 05:08:53,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,612 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 05:08:53,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:44 [2018-11-23 05:08:53,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,652 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 1 case distinctions, treesize of input 53 treesize of output 64 [2018-11-23 05:08:53,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,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 28 treesize of output 7 [2018-11-23 05:08:53,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,669 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 05:08:53,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-11-23 05:08:53,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,707 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 1 case distinctions, treesize of input 53 treesize of output 64 [2018-11-23 05:08:53,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,709 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 7 [2018-11-23 05:08:53,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,721 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 05:08:53,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-11-23 05:08:53,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,762 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 1 case distinctions, treesize of input 53 treesize of output 64 [2018-11-23 05:08:53,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,765 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 7 [2018-11-23 05:08:53,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,779 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 05:08:53,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-11-23 05:08:53,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,823 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 1 case distinctions, treesize of input 53 treesize of output 64 [2018-11-23 05:08:53,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,826 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 7 [2018-11-23 05:08:53,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,838 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 05:08:53,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-11-23 05:08:53,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 05:08:53,883 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-11-23 05:08:53,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,908 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 33 treesize of output 26 [2018-11-23 05:08:53,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-23 05:08:53,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,933 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 26 treesize of output 20 [2018-11-23 05:08:53,934 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:08:53,946 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-11-23 05:08:53,946 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:08:53,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:08:53,963 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:58, output treesize:7 [2018-11-23 05:08:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:08:53,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:08:53,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 38 [2018-11-23 05:08:53,999 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:08:53,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:08:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash -802506973, now seen corresponding path program 9 times [2018-11-23 05:08:53,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:08:53,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:08:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:54,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:08:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:08:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:08:54,678 WARN L180 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 177 [2018-11-23 05:08:54,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 05:08:54,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1343, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 05:08:54,722 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. cyclomatic complexity: 7 Second operand 39 states. [2018-11-23 05:08:55,815 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2018-11-23 05:08:56,597 WARN L180 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2018-11-23 05:09:09,333 WARN L180 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2018-11-23 05:09:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:09,452 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2018-11-23 05:09:09,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 05:09:09,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 146 transitions. [2018-11-23 05:09:09,453 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2018-11-23 05:09:09,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 135 states and 142 transitions. [2018-11-23 05:09:09,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-11-23 05:09:09,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-23 05:09:09,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 142 transitions. [2018-11-23 05:09:09,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:09:09,454 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-11-23 05:09:09,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 142 transitions. [2018-11-23 05:09:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2018-11-23 05:09:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 05:09:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-11-23 05:09:09,458 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-11-23 05:09:09,458 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-11-23 05:09:09,458 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 05:09:09,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 114 transitions. [2018-11-23 05:09:09,458 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2018-11-23 05:09:09,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:09:09,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:09:09,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 10, 2, 1, 1, 1, 1] [2018-11-23 05:09:09,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 1] [2018-11-23 05:09:09,460 INFO L794 eck$LassoCheckResult]: Stem: 3617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3615#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 3616#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 3618#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 3623#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3709#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3708#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3707#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3706#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3705#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3704#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3703#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3702#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3700#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3701#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3711#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3710#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3626#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3619#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 3620#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3624#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3621#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3622#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3625#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3722#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3721#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3720#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3719#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3718#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3717#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3716#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3715#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3714#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3713#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3712#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3666#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3667#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3665#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3663#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3662#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 3661#L556-2 [2018-11-23 05:09:09,460 INFO L796 eck$LassoCheckResult]: Loop: 3661#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3660#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3627#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3628#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3669#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3658#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3659#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3654#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3655#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3650#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3651#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3646#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3647#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3642#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3643#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3638#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3639#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3635#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 3634#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 3632#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 3633#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 3661#L556-2 [2018-11-23 05:09:09,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:09,460 INFO L82 PathProgramCache]: Analyzing trace with hash 31115049, now seen corresponding path program 13 times [2018-11-23 05:09:09,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:09,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:09,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:09,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:09,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 15 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:10,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:10,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:09:10,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:09:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:10,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:10,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 05:09:10,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:09:10,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 05:09:10,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,149 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:09:10,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 05:09:10,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:09:10,157 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,163 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 05:09:10,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:09:10,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,188 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 38 [2018-11-23 05:09:10,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,191 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 30 [2018-11-23 05:09:10,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:09:10,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,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, 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 38 [2018-11-23 05:09:10,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,226 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 30 [2018-11-23 05:09:10,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:09:10,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,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, 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 38 [2018-11-23 05:09:10,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,261 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 30 [2018-11-23 05:09:10,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:09:10,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,328 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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:09:10,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,330 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 43 treesize of output 43 [2018-11-23 05:09:10,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2018-11-23 05:09:10,407 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 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:09:10,409 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 21 [2018-11-23 05:09:10,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:09:10,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,459 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:09:10,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,462 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 7 [2018-11-23 05:09:10,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:09:10,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,588 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 1 case distinctions, treesize of input 63 treesize of output 72 [2018-11-23 05:09:10,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,590 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 38 treesize of output 16 [2018-11-23 05:09:10,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,603 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 05:09:10,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-11-23 05:09:10,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:09:10,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,648 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 7 [2018-11-23 05:09:10,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,660 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 05:09:10,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:09:10,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,705 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:09:10,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,707 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 7 [2018-11-23 05:09:10,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,720 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 05:09:10,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:09:10,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,767 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:09:10,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,770 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 7 [2018-11-23 05:09:10,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,786 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 05:09:10,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:09:10,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,878 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 1 case distinctions, treesize of input 70 treesize of output 79 [2018-11-23 05:09:10,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:10,880 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 37 treesize of output 15 [2018-11-23 05:09:10,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,895 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 05:09:10,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2018-11-23 05:09:10,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 05:09:10,947 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-23 05:09:10,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,970 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 33 treesize of output 26 [2018-11-23 05:09:10,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 05:09:10,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:10,998 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 26 treesize of output 20 [2018-11-23 05:09:10,999 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:11,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:11,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:11,011 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 05:09:11,012 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:11,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:11,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:11,030 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:71, output treesize:7 [2018-11-23 05:09:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:11,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:11,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-11-23 05:09:11,067 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:09:11,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:11,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1697306636, now seen corresponding path program 10 times [2018-11-23 05:09:11,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:11,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:11,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:11,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:09:11,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:12,236 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 206 DAG size of output: 201 [2018-11-23 05:09:12,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 05:09:12,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 05:09:12,301 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. cyclomatic complexity: 11 Second operand 39 states. [2018-11-23 05:09:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:15,390 INFO L93 Difference]: Finished difference Result 187 states and 200 transitions. [2018-11-23 05:09:15,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 05:09:15,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 200 transitions. [2018-11-23 05:09:15,391 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 63 [2018-11-23 05:09:15,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 185 states and 198 transitions. [2018-11-23 05:09:15,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2018-11-23 05:09:15,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-23 05:09:15,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 198 transitions. [2018-11-23 05:09:15,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:09:15,391 INFO L705 BuchiCegarLoop]: Abstraction has 185 states and 198 transitions. [2018-11-23 05:09:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 198 transitions. [2018-11-23 05:09:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2018-11-23 05:09:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-23 05:09:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 186 transitions. [2018-11-23 05:09:15,401 INFO L728 BuchiCegarLoop]: Abstraction has 173 states and 186 transitions. [2018-11-23 05:09:15,401 INFO L608 BuchiCegarLoop]: Abstraction has 173 states and 186 transitions. [2018-11-23 05:09:15,401 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 05:09:15,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 186 transitions. [2018-11-23 05:09:15,401 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 63 [2018-11-23 05:09:15,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:09:15,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:09:15,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 11, 2, 1, 1, 1, 1] [2018-11-23 05:09:15,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 1] [2018-11-23 05:09:15,402 INFO L794 eck$LassoCheckResult]: Stem: 4167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4165#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 4166#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 4168#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 4173#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4289#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4288#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4287#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4286#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4285#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4284#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4283#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4282#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4280#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4279#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4278#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 4277#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4276#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4275#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4274#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4273#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4272#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4271#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4270#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4269#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4268#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4267#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4266#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4265#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4264#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4263#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4262#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4261#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4260#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4259#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4258#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4257#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4256#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4253#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4254#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4252#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4250#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4248#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 4186#L556-2 [2018-11-23 05:09:15,402 INFO L796 eck$LassoCheckResult]: Loop: 4186#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4245#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4244#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4243#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4241#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4240#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4238#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4236#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4234#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4231#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4229#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4227#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4224#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4220#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4217#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4185#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4214#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4184#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 4186#L556-2 [2018-11-23 05:09:15,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:15,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1414576406, now seen corresponding path program 14 times [2018-11-23 05:09:15,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:15,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:15,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:15,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:15,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 10 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:16,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:16,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:09:16,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:09:16,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:09:16,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:09:16,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:16,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 05:09:16,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:09:16,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 05:09:16,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,217 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:09:16,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,225 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 17 treesize of output 19 [2018-11-23 05:09:16,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 14 treesize of output 13 [2018-11-23 05:09:16,226 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,232 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 05:09:16,232 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:09:16,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,260 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 38 [2018-11-23 05:09:16,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,262 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 30 [2018-11-23 05:09:16,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:09:16,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,296 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 38 [2018-11-23 05:09:16,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,298 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 30 [2018-11-23 05:09:16,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:09:16,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,368 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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:09:16,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,370 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 43 treesize of output 43 [2018-11-23 05:09:16,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2018-11-23 05:09:16,478 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 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:09:16,481 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 21 [2018-11-23 05:09:16,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:09:16,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,541 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:09:16,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,543 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 7 [2018-11-23 05:09:16,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:09:16,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,596 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:09:16,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,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 28 treesize of output 7 [2018-11-23 05:09:16,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:09:16,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,649 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:09:16,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,651 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 7 [2018-11-23 05:09:16,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:09:16,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:09:16,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,706 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 7 [2018-11-23 05:09:16,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:09:16,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,833 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 1 case distinctions, treesize of input 63 treesize of output 72 [2018-11-23 05:09:16,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16 [2018-11-23 05:09:16,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,848 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 05:09:16,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-11-23 05:09:16,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:09:16,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,895 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 7 [2018-11-23 05:09:16,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,908 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 05:09:16,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:09:16,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,954 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:09:16,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:16,958 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 7 [2018-11-23 05:09:16,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:16,970 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 05:09:16,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:09:17,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:17,065 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 1 case distinctions, treesize of input 70 treesize of output 79 [2018-11-23 05:09:17,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:17,068 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 37 treesize of output 15 [2018-11-23 05:09:17,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:17,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:17,082 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 05:09:17,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2018-11-23 05:09:17,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 05:09:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-11-23 05:09:17,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 05:09:17,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 05:09:17,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:17,173 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 11 [2018-11-23 05:09:17,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:17,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 45 treesize of output 38 [2018-11-23 05:09:17,185 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:17,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:17,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:17,197 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 05:09:17,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:17,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:17,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:17,215 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:71, output treesize:7 [2018-11-23 05:09:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:17,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:17,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2018-11-23 05:09:17,266 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:09:17,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash -802506973, now seen corresponding path program 11 times [2018-11-23 05:09:17,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:17,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:17,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:17,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:17,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:17,908 WARN L180 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 177 [2018-11-23 05:09:17,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 05:09:17,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1675, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 05:09:17,959 INFO L87 Difference]: Start difference. First operand 173 states and 186 transitions. cyclomatic complexity: 19 Second operand 43 states. [2018-11-23 05:09:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:21,060 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2018-11-23 05:09:21,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 05:09:21,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 259 transitions. [2018-11-23 05:09:21,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 63 [2018-11-23 05:09:21,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 237 states and 257 transitions. [2018-11-23 05:09:21,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-23 05:09:21,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-23 05:09:21,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 257 transitions. [2018-11-23 05:09:21,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:09:21,063 INFO L705 BuchiCegarLoop]: Abstraction has 237 states and 257 transitions. [2018-11-23 05:09:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 257 transitions. [2018-11-23 05:09:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 214. [2018-11-23 05:09:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-23 05:09:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 234 transitions. [2018-11-23 05:09:21,067 INFO L728 BuchiCegarLoop]: Abstraction has 214 states and 234 transitions. [2018-11-23 05:09:21,067 INFO L608 BuchiCegarLoop]: Abstraction has 214 states and 234 transitions. [2018-11-23 05:09:21,067 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 05:09:21,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 234 transitions. [2018-11-23 05:09:21,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 63 [2018-11-23 05:09:21,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:09:21,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:09:21,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 11, 2, 1, 1, 1, 1] [2018-11-23 05:09:21,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 7, 1] [2018-11-23 05:09:21,071 INFO L794 eck$LassoCheckResult]: Stem: 4855#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4853#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 4854#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 4856#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 4861#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4886#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4885#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4884#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4883#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4882#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4880#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4881#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4973#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4971#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4972#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4877#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4878#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4872#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4873#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 4868#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4869#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4859#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4860#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4863#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5066#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5065#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5064#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5063#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5062#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5061#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5060#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5059#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5058#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5057#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5056#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5055#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5054#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5053#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5052#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4981#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4982#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4994#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4992#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 4990#L556-2 [2018-11-23 05:09:21,071 INFO L796 eck$LassoCheckResult]: Loop: 4990#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4987#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4985#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4983#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4984#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4887#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4888#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5023#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5021#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5019#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5017#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5015#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5013#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5010#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5008#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5006#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5004#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5002#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5000#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4998#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4898#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 4899#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 4993#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 4991#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 4990#L556-2 [2018-11-23 05:09:21,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:21,071 INFO L82 PathProgramCache]: Analyzing trace with hash -764554706, now seen corresponding path program 15 times [2018-11-23 05:09:21,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:21,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:21,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:21,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:21,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 1 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:21,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:21,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:09:21,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:09:21,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-23 05:09:21,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:09:21,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:21,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 05:09:21,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:09:21,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 05:09:21,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:21,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:21,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:21,907 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:09:21,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,914 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 17 treesize of output 19 [2018-11-23 05:09:21,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, 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 05:09:21,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,921 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 05:09:21,921 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:09:21,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:21,937 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 38 [2018-11-23 05:09:21,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:21,939 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 30 [2018-11-23 05:09:21,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:09:21,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:21,963 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 38 [2018-11-23 05:09:21,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:21,978 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 30 [2018-11-23 05:09:21,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:21,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:09:22,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,005 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 38 [2018-11-23 05:09:22,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,007 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 30 [2018-11-23 05:09:22,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:09:22,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,070 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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:09:22,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,073 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 43 treesize of output 43 [2018-11-23 05:09:22,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:35 [2018-11-23 05:09:22,151 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 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:09:22,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, 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 21 [2018-11-23 05:09:22,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:09:22,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,196 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 1 case distinctions, treesize of input 38 treesize of output 49 [2018-11-23 05:09:22,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,199 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 7 [2018-11-23 05:09:22,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:29 [2018-11-23 05:09:22,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,249 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 1 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 05:09:22,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-23 05:09:22,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:36 [2018-11-23 05:09:22,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,367 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 1 case distinctions, treesize of input 57 treesize of output 64 [2018-11-23 05:09:22,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,369 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 43 treesize of output 30 [2018-11-23 05:09:22,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:50 [2018-11-23 05:09:22,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 76 [2018-11-23 05:09:22,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,502 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 0 case distinctions, treesize of input 55 treesize of output 40 [2018-11-23 05:09:22,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:79, output treesize:64 [2018-11-23 05:09:22,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,605 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 1 case distinctions, treesize of input 73 treesize of output 78 [2018-11-23 05:09:22,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,608 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 0 case distinctions, treesize of input 57 treesize of output 42 [2018-11-23 05:09:22,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,625 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 05:09:22,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 [2018-11-23 05:09:22,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,675 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 1 case distinctions, treesize of input 73 treesize of output 78 [2018-11-23 05:09:22,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2018-11-23 05:09:22,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,693 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 05:09:22,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:64 [2018-11-23 05:09:22,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,804 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 1 case distinctions, treesize of input 84 treesize of output 87 [2018-11-23 05:09:22,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 49 [2018-11-23 05:09:22,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,824 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 05:09:22,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:77 [2018-11-23 05:09:22,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 75 [2018-11-23 05:09:22,885 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 71 treesize of output 60 [2018-11-23 05:09:22,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,910 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 52 treesize of output 44 [2018-11-23 05:09:22,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:22,931 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-11-23 05:09:22,932 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,946 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 05:09:22,946 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,956 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 05:09:22,957 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:22,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:22,975 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:91, output treesize:7 [2018-11-23 05:09:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:23,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:23,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 38 [2018-11-23 05:09:23,030 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:09:23,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:23,030 INFO L82 PathProgramCache]: Analyzing trace with hash 187939203, now seen corresponding path program 12 times [2018-11-23 05:09:23,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:23,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:23,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:23,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:23,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:24,610 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 231 DAG size of output: 225 [2018-11-23 05:09:24,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 05:09:24,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1381, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 05:09:24,711 INFO L87 Difference]: Start difference. First operand 214 states and 234 transitions. cyclomatic complexity: 26 Second operand 39 states. [2018-11-23 05:09:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:26,088 INFO L93 Difference]: Finished difference Result 271 states and 292 transitions. [2018-11-23 05:09:26,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 05:09:26,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 292 transitions. [2018-11-23 05:09:26,090 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2018-11-23 05:09:26,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 269 states and 290 transitions. [2018-11-23 05:09:26,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2018-11-23 05:09:26,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2018-11-23 05:09:26,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 269 states and 290 transitions. [2018-11-23 05:09:26,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:09:26,091 INFO L705 BuchiCegarLoop]: Abstraction has 269 states and 290 transitions. [2018-11-23 05:09:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states and 290 transitions. [2018-11-23 05:09:26,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 264. [2018-11-23 05:09:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-23 05:09:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 285 transitions. [2018-11-23 05:09:26,096 INFO L728 BuchiCegarLoop]: Abstraction has 264 states and 285 transitions. [2018-11-23 05:09:26,096 INFO L608 BuchiCegarLoop]: Abstraction has 264 states and 285 transitions. [2018-11-23 05:09:26,096 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 05:09:26,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 264 states and 285 transitions. [2018-11-23 05:09:26,097 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2018-11-23 05:09:26,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:09:26,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:09:26,098 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 11, 2, 1, 1, 1, 1] [2018-11-23 05:09:26,098 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 1] [2018-11-23 05:09:26,098 INFO L794 eck$LassoCheckResult]: Stem: 5554#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5552#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 5553#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 5555#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 5560#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5582#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5581#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5580#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5579#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5578#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5577#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5576#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5574#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5575#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5703#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5702#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5701#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5572#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5704#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5571#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5573#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5567#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 5568#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5772#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5770#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5768#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5766#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5764#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5762#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5760#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5759#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5757#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5756#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5755#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5753#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5751#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5749#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5744#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5737#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5739#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5736#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5733#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5556#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 5557#L556-2 [2018-11-23 05:09:26,098 INFO L796 eck$LassoCheckResult]: Loop: 5557#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5561#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5564#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5721#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5792#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5718#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5717#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5716#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5715#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5714#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5713#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5712#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5711#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5709#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5710#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5746#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5705#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5595#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 5594#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 5592#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 5593#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 5557#L556-2 [2018-11-23 05:09:26,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:26,098 INFO L82 PathProgramCache]: Analyzing trace with hash -686248598, now seen corresponding path program 16 times [2018-11-23 05:09:26,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:26,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:26,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 24 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:26,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:26,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:09:26,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:09:26,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:09:26,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:09:26,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:26,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,757 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:09:26,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,761 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:09:26,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,778 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 33 treesize of output 30 [2018-11-23 05:09:26,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:09:26,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,797 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 33 treesize of output 30 [2018-11-23 05:09:26,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:09:26,799 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,803 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:26,813 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2018-11-23 05:09:26,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,845 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 49 [2018-11-23 05:09:26,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,847 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 30 [2018-11-23 05:09:26,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,869 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 49 [2018-11-23 05:09:26,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,871 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 30 [2018-11-23 05:09:26,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:26,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:09:26,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,921 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 49 [2018-11-23 05:09:26,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,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 34 treesize of output 30 [2018-11-23 05:09:26,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,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, 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 49 [2018-11-23 05:09:26,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,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 34 treesize of output 30 [2018-11-23 05:09:26,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:26,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:26,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:09:26,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:26,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, 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 49 [2018-11-23 05:09:27,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,000 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 30 [2018-11-23 05:09:27,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,023 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 49 [2018-11-23 05:09:27,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,026 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 30 [2018-11-23 05:09:27,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:27,041 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:09:27,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,078 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 49 [2018-11-23 05:09:27,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,080 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 30 [2018-11-23 05:09:27,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,101 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 49 [2018-11-23 05:09:27,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,103 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 30 [2018-11-23 05:09:27,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:27,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:09:27,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,201 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 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:09:27,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,205 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 43 treesize of output 43 [2018-11-23 05:09:27,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,250 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 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:09:27,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,252 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 43 treesize of output 43 [2018-11-23 05:09:27,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:27,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:85 [2018-11-23 05:09:27,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,322 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 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:09:27,324 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 18 [2018-11-23 05:09:27,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,351 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 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:09:27,353 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 18 [2018-11-23 05:09:27,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:27,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:73 [2018-11-23 05:09:27,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09: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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:09:27,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-23 05:09:27,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:09:27,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,586 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:09:27,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,590 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 38 treesize of output 16 [2018-11-23 05:09:27,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:44 [2018-11-23 05:09:27,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 05:09:27,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,706 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 38 treesize of output 16 [2018-11-23 05:09:27,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:52 [2018-11-23 05:09:27,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,836 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 1 case distinctions, treesize of input 73 treesize of output 82 [2018-11-23 05:09:27,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,838 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 38 treesize of output 16 [2018-11-23 05:09:27,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:60 [2018-11-23 05:09:27,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,986 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 1 case distinctions, treesize of input 81 treesize of output 90 [2018-11-23 05:09:27,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:27,989 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 38 treesize of output 16 [2018-11-23 05:09:27,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:27,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:68 [2018-11-23 05:09:28,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:28,157 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 1 case distinctions, treesize of input 89 treesize of output 98 [2018-11-23 05:09:28,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:28,159 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 38 treesize of output 16 [2018-11-23 05:09:28,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:76 [2018-11-23 05:09:28,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 76 [2018-11-23 05:09:28,284 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 72 treesize of output 65 [2018-11-23 05:09:28,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-11-23 05:09:28,313 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 05:09:28,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,349 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 60 treesize of output 53 [2018-11-23 05:09:28,349 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:28,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:28,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-11-23 05:09:28,367 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:28,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:28,388 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:90, output treesize:7 [2018-11-23 05:09:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:28,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:28,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 52 [2018-11-23 05:09:28,438 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:09:28,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:28,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1697306636, now seen corresponding path program 13 times [2018-11-23 05:09:28,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:28,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:28,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:28,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:28,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:29,456 WARN L180 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 201 [2018-11-23 05:09:29,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 05:09:29,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2368, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 05:09:29,538 INFO L87 Difference]: Start difference. First operand 264 states and 285 transitions. cyclomatic complexity: 28 Second operand 53 states. [2018-11-23 05:09:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:32,413 INFO L93 Difference]: Finished difference Result 360 states and 385 transitions. [2018-11-23 05:09:32,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-11-23 05:09:32,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 360 states and 385 transitions. [2018-11-23 05:09:32,415 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 114 [2018-11-23 05:09:32,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 360 states to 346 states and 371 transitions. [2018-11-23 05:09:32,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2018-11-23 05:09:32,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2018-11-23 05:09:32,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 346 states and 371 transitions. [2018-11-23 05:09:32,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:09:32,417 INFO L705 BuchiCegarLoop]: Abstraction has 346 states and 371 transitions. [2018-11-23 05:09:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states and 371 transitions. [2018-11-23 05:09:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 317. [2018-11-23 05:09:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-23 05:09:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 341 transitions. [2018-11-23 05:09:32,422 INFO L728 BuchiCegarLoop]: Abstraction has 317 states and 341 transitions. [2018-11-23 05:09:32,422 INFO L608 BuchiCegarLoop]: Abstraction has 317 states and 341 transitions. [2018-11-23 05:09:32,422 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 05:09:32,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 341 transitions. [2018-11-23 05:09:32,423 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 114 [2018-11-23 05:09:32,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:09:32,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:09:32,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 13, 2, 1, 1, 1, 1] [2018-11-23 05:09:32,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 7, 1] [2018-11-23 05:09:32,424 INFO L794 eck$LassoCheckResult]: Stem: 6480#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6478#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 6479#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 6481#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 6486#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6508#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6507#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6506#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6505#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6504#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6502#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6503#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6634#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6632#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6631#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6630#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6628#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6627#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6626#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 6625#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6624#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6623#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6622#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6621#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6620#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6619#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6618#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6617#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6616#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6615#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6614#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6613#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6612#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6611#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6610#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6609#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6608#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6607#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6606#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6605#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6604#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6603#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6602#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6600#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6601#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6748#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6746#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6734#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6758#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 6719#L556-2 [2018-11-23 05:09:32,424 INFO L796 eck$LassoCheckResult]: Loop: 6719#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6710#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6509#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6510#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6489#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6490#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6689#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6762#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6761#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6760#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6759#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6757#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6756#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6755#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6754#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6752#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6677#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6642#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6639#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6640#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6521#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 6522#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 6715#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 6716#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 6719#L556-2 [2018-11-23 05:09:32,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:32,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1654972338, now seen corresponding path program 17 times [2018-11-23 05:09:32,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:32,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:32,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:09:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 14 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:33,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:33,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:09:33,274 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:09:33,467 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-23 05:09:33,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:09:33,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:33,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 05:09:33,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, 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 05:09:33,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2018-11-23 05:09:33,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:09:33,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 05:09:33,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-11-23 05:09:33,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,581 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:09:33,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,589 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 26 [2018-11-23 05:09:33,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:09:33,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,593 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,597 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 05:09:33,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-11-23 05:09:33,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,631 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 38 treesize of output 45 [2018-11-23 05:09:33,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,633 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 30 [2018-11-23 05:09:33,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:09:33,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,676 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 38 treesize of output 45 [2018-11-23 05:09:33,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,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 34 treesize of output 30 [2018-11-23 05:09:33,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:09:33,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,721 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 38 treesize of output 45 [2018-11-23 05:09:33,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,723 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 30 [2018-11-23 05:09:33,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:09:33,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,807 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 1 case distinctions, treesize of input 49 treesize of output 58 [2018-11-23 05:09:33,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,809 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 43 treesize of output 43 [2018-11-23 05:09:33,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-11-23 05:09:33,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:33,864 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 1 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 05:09:33,865 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 18 [2018-11-23 05:09:33,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:33,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:09:34,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,002 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:09:34,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,006 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 38 treesize of output 16 [2018-11-23 05:09:34,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:44 [2018-11-23 05:09:34,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,157 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 1 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 05:09:34,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,159 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 38 treesize of output 16 [2018-11-23 05:09:34,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:52 [2018-11-23 05:09:34,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09: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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 82 [2018-11-23 05:09:34,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,325 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 38 treesize of output 16 [2018-11-23 05:09:34,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:60 [2018-11-23 05:09:34,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,511 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 1 case distinctions, treesize of input 81 treesize of output 90 [2018-11-23 05:09:34,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16 [2018-11-23 05:09:34,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:68 [2018-11-23 05:09:34,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,709 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 1 case distinctions, treesize of input 89 treesize of output 98 [2018-11-23 05:09:34,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,712 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 38 treesize of output 16 [2018-11-23 05:09:34,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:76 [2018-11-23 05:09:34,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,913 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 1 case distinctions, treesize of input 97 treesize of output 106 [2018-11-23 05:09:34,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:34,915 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 38 treesize of output 16 [2018-11-23 05:09:34,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:34,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:105, output treesize:84 [2018-11-23 05:09:35,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:35,133 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 1 case distinctions, treesize of input 105 treesize of output 114 [2018-11-23 05:09:35,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:35,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, 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 16 [2018-11-23 05:09:35,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:113, output treesize:92 [2018-11-23 05:09:35,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:35,366 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 1 case distinctions, treesize of input 113 treesize of output 122 [2018-11-23 05:09:35,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:35,369 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 38 treesize of output 16 [2018-11-23 05:09:35,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:121, output treesize:100 [2018-11-23 05:09:35,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:35,619 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 1 case distinctions, treesize of input 121 treesize of output 130 [2018-11-23 05:09:35,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:35,622 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 38 treesize of output 16 [2018-11-23 05:09:35,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:129, output treesize:108 [2018-11-23 05:09:35,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 100 [2018-11-23 05:09:35,807 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 96 treesize of output 89 [2018-11-23 05:09:35,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 59 [2018-11-23 05:09:35,896 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,940 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 05:09:35,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:35,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:35,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:35,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2018-11-23 05:09:35,998 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:36,021 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 11 [2018-11-23 05:09:36,022 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:36,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:36,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:36,042 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:122, output treesize:15 [2018-11-23 05:09:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:36,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:36,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 39] total 63 [2018-11-23 05:09:36,121 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:09:36,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash 187939203, now seen corresponding path program 14 times [2018-11-23 05:09:36,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:36,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:36,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:36,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:36,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:37,742 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 231 DAG size of output: 225 [2018-11-23 05:09:37,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-23 05:09:37,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=3539, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 05:09:37,807 INFO L87 Difference]: Start difference. First operand 317 states and 341 transitions. cyclomatic complexity: 33 Second operand 64 states. [2018-11-23 05:09:42,213 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2018-11-23 05:09:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:09:43,086 INFO L93 Difference]: Finished difference Result 399 states and 426 transitions. [2018-11-23 05:09:43,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-11-23 05:09:43,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 426 transitions. [2018-11-23 05:09:43,087 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 63 [2018-11-23 05:09:43,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 385 states and 412 transitions. [2018-11-23 05:09:43,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2018-11-23 05:09:43,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2018-11-23 05:09:43,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 412 transitions. [2018-11-23 05:09:43,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:09:43,089 INFO L705 BuchiCegarLoop]: Abstraction has 385 states and 412 transitions. [2018-11-23 05:09:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 412 transitions. [2018-11-23 05:09:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 318. [2018-11-23 05:09:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-11-23 05:09:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 345 transitions. [2018-11-23 05:09:43,095 INFO L728 BuchiCegarLoop]: Abstraction has 318 states and 345 transitions. [2018-11-23 05:09:43,095 INFO L608 BuchiCegarLoop]: Abstraction has 318 states and 345 transitions. [2018-11-23 05:09:43,095 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 05:09:43,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 345 transitions. [2018-11-23 05:09:43,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 63 [2018-11-23 05:09:43,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:09:43,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:09:43,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 13, 2, 1, 1, 1, 1] [2018-11-23 05:09:43,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 7, 1] [2018-11-23 05:09:43,097 INFO L794 eck$LassoCheckResult]: Stem: 7565#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7563#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 7564#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 7566#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 7571#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7691#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7690#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7689#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7688#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7687#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7686#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7685#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7684#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7682#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7681#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7680#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7678#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7679#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7849#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7847#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7846#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7845#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7844#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7572#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7567#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 7568#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7865#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7864#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7863#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7862#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7861#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7860#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7859#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7858#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7857#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7856#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7855#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7854#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7853#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7852#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7851#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7795#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7850#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7809#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7807#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7808#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7810#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7783#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7782#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 7781#L556-2 [2018-11-23 05:09:43,097 INFO L796 eck$LassoCheckResult]: Loop: 7781#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7780#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7576#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7577#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7800#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7798#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7742#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7743#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7797#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7796#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7793#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7792#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7791#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7790#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7789#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7788#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7787#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7786#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7785#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7784#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7585#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 7586#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 7581#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 7582#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 7781#L556-2 [2018-11-23 05:09:43,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:43,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2078943694, now seen corresponding path program 18 times [2018-11-23 05:09:43,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:43,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:43,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:09:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 60 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:43,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:09:43,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:09:43,713 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:09:43,928 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 05:09:43,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:09:43,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:09:43,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:43,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:43,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:43,958 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:09:43,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:43,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:43,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:43,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:43,962 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:09:43,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:43,978 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 33 treesize of output 30 [2018-11-23 05:09:43,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:09:43,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:43,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:43,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-11-23 05:09:44,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 14 treesize of output 13 [2018-11-23 05:09:44,000 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,004 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:44,014 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2018-11-23 05:09:44,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,042 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 49 [2018-11-23 05:09:44,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,045 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 30 [2018-11-23 05:09:44,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,066 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 49 [2018-11-23 05:09:44,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2018-11-23 05:09:44,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:44,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:09:44,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,115 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 49 [2018-11-23 05:09:44,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,117 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 30 [2018-11-23 05:09:44,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,139 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 49 [2018-11-23 05:09:44,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,141 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 30 [2018-11-23 05:09:44,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:44,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:09:44,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,196 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 49 [2018-11-23 05:09:44,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,199 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 30 [2018-11-23 05:09:44,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,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 46 treesize of output 49 [2018-11-23 05:09:44,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,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, 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 30 [2018-11-23 05:09:44,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:44,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:09:44,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,271 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 49 [2018-11-23 05:09:44,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,273 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 30 [2018-11-23 05:09:44,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,294 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 49 [2018-11-23 05:09:44,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,296 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 30 [2018-11-23 05:09:44,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:44,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:09:44,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,347 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 49 [2018-11-23 05:09:44,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,349 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 30 [2018-11-23 05:09:44,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,370 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 49 [2018-11-23 05:09:44,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,372 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 30 [2018-11-23 05:09:44,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:44,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:09:44,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,466 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 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:09:44,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-11-23 05:09:44,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,498 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 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:09:44,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,500 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 43 treesize of output 43 [2018-11-23 05:09:44,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:44,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:85 [2018-11-23 05:09:44,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:09:44,572 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 18 [2018-11-23 05:09:44,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,600 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 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:09:44,601 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 18 [2018-11-23 05:09:44,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:44,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:73 [2018-11-23 05:09:44,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,747 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:09:44,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,749 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 7 [2018-11-23 05:09:44,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:09:44,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:09:44,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,820 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 7 [2018-11-23 05:09:44,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,830 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 05:09:44,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:09:44,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,865 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:09:44,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,867 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 7 [2018-11-23 05:09:44,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,877 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 05:09:44,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:09:44,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,913 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:09:44,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,915 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 7 [2018-11-23 05:09:44,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,926 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 05:09:44,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:09:44,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,965 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:09:44,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:44,968 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 7 [2018-11-23 05:09:44,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:44,981 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 05:09:44,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:09:45,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:45,018 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:09:45,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:45,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, 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 7 [2018-11-23 05:09:45,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:45,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:45,037 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 05:09:45,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:09:45,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:45,077 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:09:45,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:45,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 28 treesize of output 7 [2018-11-23 05:09:45,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:45,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:45,090 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 05:09:45,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:09:45,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2018-11-23 05:09:45,130 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 42 treesize of output 35 [2018-11-23 05:09:45,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:45,150 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 05:09:45,150 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:45,161 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 05:09:45,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:45,172 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 30 treesize of output 23 [2018-11-23 05:09:45,172 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:45,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:45,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:09:45,182 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-11-23 05:09:45,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:09:45,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:09:45,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:09:45,204 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:50, output treesize:7 [2018-11-23 05:09:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:09:45,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:09:45,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-11-23 05:09:45,229 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:09:45,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:09:45,229 INFO L82 PathProgramCache]: Analyzing trace with hash 187939203, now seen corresponding path program 15 times [2018-11-23 05:09:45,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:09:45,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:09:45,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:45,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:09:45,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:09:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:09:46,797 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 231 DAG size of output: 225 [2018-11-23 05:09:46,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 05:09:46,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1754, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 05:09:46,876 INFO L87 Difference]: Start difference. First operand 318 states and 345 transitions. cyclomatic complexity: 34 Second operand 45 states. [2018-11-23 05:09:49,234 WARN L180 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2018-11-23 05:09:49,783 WARN L180 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2018-11-23 05:10:01,876 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-11-23 05:10:14,002 WARN L180 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-11-23 05:10:26,247 WARN L180 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-11-23 05:10:26,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:10:26,357 INFO L93 Difference]: Finished difference Result 411 states and 441 transitions. [2018-11-23 05:10:26,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 05:10:26,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 441 transitions. [2018-11-23 05:10:26,359 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2018-11-23 05:10:26,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 407 states and 436 transitions. [2018-11-23 05:10:26,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2018-11-23 05:10:26,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2018-11-23 05:10:26,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 436 transitions. [2018-11-23 05:10:26,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:10:26,360 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 436 transitions. [2018-11-23 05:10:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 436 transitions. [2018-11-23 05:10:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 371. [2018-11-23 05:10:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-23 05:10:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 399 transitions. [2018-11-23 05:10:26,363 INFO L728 BuchiCegarLoop]: Abstraction has 371 states and 399 transitions. [2018-11-23 05:10:26,363 INFO L608 BuchiCegarLoop]: Abstraction has 371 states and 399 transitions. [2018-11-23 05:10:26,363 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 05:10:26,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 399 transitions. [2018-11-23 05:10:26,364 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2018-11-23 05:10:26,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:10:26,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:10:26,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [16, 16, 14, 2, 1, 1, 1, 1] [2018-11-23 05:10:26,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 8, 1] [2018-11-23 05:10:26,364 INFO L794 eck$LassoCheckResult]: Stem: 8580#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8578#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 8579#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 8581#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 8586#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8704#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8703#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8702#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8701#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8700#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8699#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8698#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8697#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8695#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8694#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8693#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8691#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8692#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8889#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8887#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8888#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8933#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8932#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8596#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8582#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 8583#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8587#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8584#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8585#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8588#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8948#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8947#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8946#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8945#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8944#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8943#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8942#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8941#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8940#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8939#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8938#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8937#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8936#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8935#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8826#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8934#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8896#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8894#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8890#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8891#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8823#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8809#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 8807#L556-2 [2018-11-23 05:10:26,364 INFO L796 eck$LassoCheckResult]: Loop: 8807#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8804#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8591#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8592#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8845#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8799#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8797#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8798#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8758#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8759#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8843#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8842#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8840#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8838#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8836#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8834#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8832#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8830#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8828#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8746#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8744#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8745#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8817#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8815#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 8811#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 8813#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 8810#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 8807#L556-2 [2018-11-23 05:10:26,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:26,365 INFO L82 PathProgramCache]: Analyzing trace with hash 383136105, now seen corresponding path program 19 times [2018-11-23 05:10:26,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:26,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:26,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:26,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:10:26,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 20 proven. 340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:27,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:10:27,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:10:27,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:27,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:27,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,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, 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 27 [2018-11-23 05:10:27,296 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 23 treesize of output 15 [2018-11-23 05:10:27,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2018-11-23 05:10:27,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,337 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 05:10:27,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,346 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 17 treesize of output 19 [2018-11-23 05:10:27,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:10:27,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,350 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,354 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 05:10:27,354 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:26 [2018-11-23 05:10:27,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,387 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 31 treesize of output 38 [2018-11-23 05:10:27,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,389 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 30 [2018-11-23 05:10:27,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:26 [2018-11-23 05:10:27,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,432 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 31 treesize of output 38 [2018-11-23 05:10:27,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,434 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 30 [2018-11-23 05:10:27,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:26 [2018-11-23 05:10:27,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,476 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 31 treesize of output 38 [2018-11-23 05:10:27,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,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, 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 30 [2018-11-23 05:10:27,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:26 [2018-11-23 05:10:27,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-23 05:10:27,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2018-11-23 05:10:27,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:26 [2018-11-23 05:10:27,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,566 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 31 treesize of output 38 [2018-11-23 05:10:27,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,568 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 30 [2018-11-23 05:10:27,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:26 [2018-11-23 05:10:27,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,649 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 42 treesize of output 55 [2018-11-23 05:10:27,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,652 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 43 treesize of output 43 [2018-11-23 05:10:27,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:39 [2018-11-23 05:10:27,748 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 51 treesize of output 56 [2018-11-23 05:10:27,751 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 21 [2018-11-23 05:10:27,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:10:27,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,810 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 51 treesize of output 66 [2018-11-23 05:10:27,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,813 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 7 [2018-11-23 05:10:27,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:10:27,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,965 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 63 treesize of output 76 [2018-11-23 05:10:27,967 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:27,968 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 38 treesize of output 16 [2018-11-23 05:10:27,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:27,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:75, output treesize:54 [2018-11-23 05:10:28,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,133 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 71 treesize of output 84 [2018-11-23 05:10:28,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,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, 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 16 [2018-11-23 05:10:28,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:62 [2018-11-23 05:10:28,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,314 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 79 treesize of output 92 [2018-11-23 05:10:28,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,317 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 38 treesize of output 16 [2018-11-23 05:10:28,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:91, output treesize:70 [2018-11-23 05:10:28,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,513 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 87 treesize of output 100 [2018-11-23 05:10:28,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,515 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 38 treesize of output 16 [2018-11-23 05:10:28,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:99, output treesize:78 [2018-11-23 05:10:28,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,664 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 83 treesize of output 98 [2018-11-23 05:10:28,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,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 28 treesize of output 7 [2018-11-23 05:10:28,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,688 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 05:10:28,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:78 [2018-11-23 05:10:28,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,753 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 83 treesize of output 98 [2018-11-23 05:10:28,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-23 05:10:28,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,778 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 05:10:28,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:78 [2018-11-23 05:10:28,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,909 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 94 treesize of output 107 [2018-11-23 05:10:28,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:28,912 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 37 treesize of output 15 [2018-11-23 05:10:28,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:28,936 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 05:10:28,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:85 [2018-11-23 05:10:29,004 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 87 treesize of output 75 [2018-11-23 05:10:29,006 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-11-23 05:10:29,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 05:10:29,019 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 05:10:29,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:29,024 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 05:10:29,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:29,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:29,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:29,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:99, output treesize:7 [2018-11-23 05:10:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:29,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:10:29,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 56 [2018-11-23 05:10:29,094 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:10:29,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1740600940, now seen corresponding path program 16 times [2018-11-23 05:10:29,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:29,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:29,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:29,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:10:29,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:31,954 WARN L180 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 256 DAG size of output: 249 [2018-11-23 05:10:32,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 05:10:32,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=2905, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 05:10:32,039 INFO L87 Difference]: Start difference. First operand 371 states and 399 transitions. cyclomatic complexity: 37 Second operand 57 states. [2018-11-23 05:10:32,756 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2018-11-23 05:10:35,809 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2018-11-23 05:10:35,952 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-11-23 05:10:36,368 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2018-11-23 05:10:36,783 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-11-23 05:10:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:10:37,215 INFO L93 Difference]: Finished difference Result 467 states and 503 transitions. [2018-11-23 05:10:37,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-11-23 05:10:37,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 467 states and 503 transitions. [2018-11-23 05:10:37,222 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 120 [2018-11-23 05:10:37,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 467 states to 465 states and 501 transitions. [2018-11-23 05:10:37,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2018-11-23 05:10:37,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2018-11-23 05:10:37,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 465 states and 501 transitions. [2018-11-23 05:10:37,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:10:37,224 INFO L705 BuchiCegarLoop]: Abstraction has 465 states and 501 transitions. [2018-11-23 05:10:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states and 501 transitions. [2018-11-23 05:10:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 451. [2018-11-23 05:10:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-11-23 05:10:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 487 transitions. [2018-11-23 05:10:37,231 INFO L728 BuchiCegarLoop]: Abstraction has 451 states and 487 transitions. [2018-11-23 05:10:37,232 INFO L608 BuchiCegarLoop]: Abstraction has 451 states and 487 transitions. [2018-11-23 05:10:37,232 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-23 05:10:37,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 451 states and 487 transitions. [2018-11-23 05:10:37,233 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 120 [2018-11-23 05:10:37,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:10:37,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:10:37,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 17, 15, 2, 1, 1, 1, 1] [2018-11-23 05:10:37,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 8, 1] [2018-11-23 05:10:37,234 INFO L794 eck$LassoCheckResult]: Stem: 9761#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9759#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 9760#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 9762#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 9767#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 9883#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 9882#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 9881#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 9880#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 9879#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 9878#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 9877#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 9876#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 9874#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 9873#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 9872#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 9870#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 9871#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10103#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10101#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10102#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10147#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10145#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10144#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10143#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10142#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10106#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10107#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 10173#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10170#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10169#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10168#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10167#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10166#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10165#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10164#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10163#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10161#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10162#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10203#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10157#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10156#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10155#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10154#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10153#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10152#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10151#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10018#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10148#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10108#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10105#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10037#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10038#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10015#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10013#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 10012#L556-2 [2018-11-23 05:10:37,234 INFO L796 eck$LassoCheckResult]: Loop: 10012#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10095#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10093#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10091#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10000#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10001#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10076#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10074#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10072#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10070#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10068#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10066#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10064#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10062#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10060#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10058#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10056#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10054#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10052#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10050#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10048#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 10046#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10045#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10043#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 9781#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 10039#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 10011#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 10012#L556-2 [2018-11-23 05:10:37,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1068482090, now seen corresponding path program 20 times [2018-11-23 05:10:37,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:37,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:37,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:37,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:10:37,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:10:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 65 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:37,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:10:37,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:10:37,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:10:37,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:10:37,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:10:37,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:10:37,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 [2018-11-23 05:10:37,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:10:37,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:37,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:37,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-11-23 05:10:37,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:10:37,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:37,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:37,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:37,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-11-23 05:10:37,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:37,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:37,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:37,973 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:10:37,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:37,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:37,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:37,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:37,979 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:10:37,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,001 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 33 treesize of output 30 [2018-11-23 05:10:38,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:10:38,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,027 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 33 treesize of output 30 [2018-11-23 05:10:38,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:10:38,028 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,034 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:38,046 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2018-11-23 05:10:38,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,089 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 49 [2018-11-23 05:10:38,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,092 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 30 [2018-11-23 05:10:38,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,114 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,115 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 49 [2018-11-23 05:10:38,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,118 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 30 [2018-11-23 05:10:38,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:38,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:10:38,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,168 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 49 [2018-11-23 05:10:38,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,173 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 30 [2018-11-23 05:10:38,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,198 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 49 [2018-11-23 05:10:38,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,200 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 30 [2018-11-23 05:10:38,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:38,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:10:38,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,252 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 49 [2018-11-23 05:10:38,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,255 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 30 [2018-11-23 05:10:38,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,277 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 49 [2018-11-23 05:10:38,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,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 34 treesize of output 30 [2018-11-23 05:10:38,279 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:38,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:10:38,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,332 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 49 [2018-11-23 05:10:38,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,335 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 30 [2018-11-23 05:10:38,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,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, 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 49 [2018-11-23 05:10:38,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,360 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 30 [2018-11-23 05:10:38,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:38,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:10:38,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,416 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 49 [2018-11-23 05:10:38,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,418 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 30 [2018-11-23 05:10:38,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,442 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 49 [2018-11-23 05:10:38,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,445 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 30 [2018-11-23 05:10:38,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:38,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:10:38,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,509 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 49 [2018-11-23 05:10:38,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,511 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 30 [2018-11-23 05:10:38,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 49 [2018-11-23 05:10:38,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,537 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 30 [2018-11-23 05:10:38,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:38,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:10:38,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:10:38,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,654 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 43 treesize of output 43 [2018-11-23 05:10:38,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,685 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 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:10:38,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,687 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 43 treesize of output 43 [2018-11-23 05:10:38,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:38,708 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:85 [2018-11-23 05:10:38,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:10:38,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 26 treesize of output 18 [2018-11-23 05:10:38,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,793 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 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:10:38,794 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 18 [2018-11-23 05:10:38,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:38,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:73 [2018-11-23 05:10:38,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,958 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:10:38,960 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:38,960 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 38 treesize of output 16 [2018-11-23 05:10:38,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:38,973 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 05:10:38,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:36 [2018-11-23 05:10:39,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,014 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:10:39,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,016 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 7 [2018-11-23 05:10:39,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,028 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 05:10:39,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:10:39,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:10:39,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,071 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 7 [2018-11-23 05:10:39,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,082 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 05:10:39,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:10:39,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,123 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:10:39,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,125 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 7 [2018-11-23 05:10:39,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,137 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 05:10:39,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:10:39,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,179 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:10:39,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,182 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 7 [2018-11-23 05:10:39,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,193 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 05:10:39,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:10:39,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,238 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:10:39,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,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 28 treesize of output 7 [2018-11-23 05:10:39,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,252 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 05:10:39,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:10:39,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:10:39,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,303 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 7 [2018-11-23 05:10:39,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,314 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 05:10:39,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:10:39,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:10:39,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,362 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 7 [2018-11-23 05:10:39,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,374 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 05:10:39,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:10:39,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2018-11-23 05:10:39,422 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 38 treesize of output 31 [2018-11-23 05:10:39,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,439 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-23 05:10:39,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,452 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 05:10:39,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,462 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 11 [2018-11-23 05:10:39,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:10:39,473 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-11-23 05:10:39,473 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:10:39,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:10:39,491 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:50, output treesize:7 [2018-11-23 05:10:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:10:39,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:10:39,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2018-11-23 05:10:39,543 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:10:39,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:10:39,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1740600940, now seen corresponding path program 17 times [2018-11-23 05:10:39,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:10:39,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:10:39,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:39,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:10:39,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:10:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:10:42,721 WARN L180 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 256 DAG size of output: 249 [2018-11-23 05:10:42,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 05:10:42,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1927, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 05:10:42,801 INFO L87 Difference]: Start difference. First operand 451 states and 487 transitions. cyclomatic complexity: 46 Second operand 47 states. [2018-11-23 05:11:04,144 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-11-23 05:11:16,280 WARN L180 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-11-23 05:11:28,407 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-11-23 05:11:40,555 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-11-23 05:11:46,411 WARN L180 SmtUtils]: Spent 5.76 s on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2018-11-23 05:11:51,643 WARN L180 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2018-11-23 05:11:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:52,163 INFO L93 Difference]: Finished difference Result 532 states and 571 transitions. [2018-11-23 05:11:52,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 05:11:52,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 571 transitions. [2018-11-23 05:11:52,165 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 150 [2018-11-23 05:11:52,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 528 states and 566 transitions. [2018-11-23 05:11:52,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2018-11-23 05:11:52,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2018-11-23 05:11:52,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 528 states and 566 transitions. [2018-11-23 05:11:52,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:11:52,167 INFO L705 BuchiCegarLoop]: Abstraction has 528 states and 566 transitions. [2018-11-23 05:11:52,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states and 566 transitions. [2018-11-23 05:11:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 468. [2018-11-23 05:11:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-11-23 05:11:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 505 transitions. [2018-11-23 05:11:52,175 INFO L728 BuchiCegarLoop]: Abstraction has 468 states and 505 transitions. [2018-11-23 05:11:52,175 INFO L608 BuchiCegarLoop]: Abstraction has 468 states and 505 transitions. [2018-11-23 05:11:52,175 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-23 05:11:52,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 468 states and 505 transitions. [2018-11-23 05:11:52,176 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 150 [2018-11-23 05:11:52,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:11:52,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:11:52,177 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [17, 17, 15, 2, 1, 1, 1, 1] [2018-11-23 05:11:52,177 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 9, 1] [2018-11-23 05:11:52,177 INFO L794 eck$LassoCheckResult]: Stem: 11058#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11056#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 11057#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 11059#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 11064#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11182#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11181#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11180#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11179#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11178#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11177#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11176#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11175#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11173#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11172#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11171#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11169#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11170#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11374#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11372#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11373#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11483#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11481#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11480#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11479#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 11478#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11477#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11476#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11475#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11474#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11473#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11472#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11471#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11470#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11469#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11468#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11467#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11466#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11465#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11464#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11463#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11462#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11461#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11460#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11459#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11458#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11457#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11456#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11455#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11454#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11453#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11451#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11437#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11430#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11434#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 11381#L556-2 [2018-11-23 05:11:52,177 INFO L796 eck$LassoCheckResult]: Loop: 11381#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11431#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11428#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11427#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11425#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11422#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11420#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11418#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11279#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11280#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11412#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11410#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11408#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11236#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11235#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11233#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11234#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11230#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11228#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11229#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11396#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11395#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11393#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11222#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11221#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11220#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11081#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 11077#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 11075#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 11076#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 11381#L556-2 [2018-11-23 05:11:52,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2015412242, now seen corresponding path program 21 times [2018-11-23 05:11:52,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:11:52,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:11:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:52,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:11:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 1 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:53,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:11:53,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:11:53,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:11:53,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-23 05:11:53,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:11:53,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:11:53,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 05:11:53,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:11:53,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 05:11:53,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,683 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:11:53,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,696 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 17 treesize of output 19 [2018-11-23 05:11:53,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 05:11:53,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,709 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 05:11:53,710 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:11:53,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,736 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 38 [2018-11-23 05:11:53,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2018-11-23 05:11:53,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:11:53,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,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, 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 38 [2018-11-23 05:11:53,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,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 34 treesize of output 30 [2018-11-23 05:11:53,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:11:53,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,834 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 38 [2018-11-23 05:11:53,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,837 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 30 [2018-11-23 05:11:53,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:11:53,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,872 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 38 [2018-11-23 05:11:53,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,875 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 30 [2018-11-23 05:11:53,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:11:53,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,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, 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 38 [2018-11-23 05:11:53,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:53,913 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 30 [2018-11-23 05:11:53,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:53,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:11:54,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,004 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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:11:54,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,006 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 43 treesize of output 43 [2018-11-23 05:11:54,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:35 [2018-11-23 05:11:54,113 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 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:11:54,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, 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 21 [2018-11-23 05:11:54,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:11:54,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,174 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 1 case distinctions, treesize of input 38 treesize of output 49 [2018-11-23 05:11:54,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,176 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 7 [2018-11-23 05:11:54,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:29 [2018-11-23 05:11:54,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 49 [2018-11-23 05:11:54,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,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 28 treesize of output 7 [2018-11-23 05:11:54,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:11:54,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,399 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 1 case distinctions, treesize of input 50 treesize of output 59 [2018-11-23 05:11:54,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,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, 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 16 [2018-11-23 05:11:54,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,415 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 05:11:54,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:37 [2018-11-23 05:11:54,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,472 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 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:11:54,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,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 28 treesize of output 7 [2018-11-23 05:11:54,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,488 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 05:11:54,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:11:54,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,555 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 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:11:54,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,558 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 7 [2018-11-23 05:11:54,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,575 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 05:11:54,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:11:54,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,637 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 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:11:54,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,640 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 7 [2018-11-23 05:11:54,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,654 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 05:11:54,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:11:54,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,715 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 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:11:54,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,718 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 7 [2018-11-23 05:11:54,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,732 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 05:11:54,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:11:54,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,799 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 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:11:54,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,802 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 7 [2018-11-23 05:11:54,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,816 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 05:11:54,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:11:54,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,948 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:11:54,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:54,951 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 37 treesize of output 15 [2018-11-23 05:11:54,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:54,966 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 05:11:54,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:44 [2018-11-23 05:11:55,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 05:11:55,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:55,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:11:55,034 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-11-23 05:11:55,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:55,055 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 11 [2018-11-23 05:11:55,055 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:55,069 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 40 treesize of output 33 [2018-11-23 05:11:55,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:55,083 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 33 treesize of output 26 [2018-11-23 05:11:55,083 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:55,095 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 26 treesize of output 20 [2018-11-23 05:11:55,096 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:11:55,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:11:55,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:11:55,116 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:58, output treesize:7 [2018-11-23 05:11:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:55,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:11:55,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25] total 47 [2018-11-23 05:11:55,173 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:11:55,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:55,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1102482461, now seen corresponding path program 18 times [2018-11-23 05:11:55,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:11:55,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:11:55,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:55,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:11:55,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:11:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:00,411 WARN L180 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 281 DAG size of output: 273 [2018-11-23 05:12:00,523 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-23 05:12:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 05:12:00,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=2142, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 05:12:00,530 INFO L87 Difference]: Start difference. First operand 468 states and 505 transitions. cyclomatic complexity: 49 Second operand 48 states. [2018-11-23 05:12:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:03,019 INFO L93 Difference]: Finished difference Result 470 states and 506 transitions. [2018-11-23 05:12:03,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 05:12:03,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 470 states and 506 transitions. [2018-11-23 05:12:03,021 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 150 [2018-11-23 05:12:03,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 470 states to 468 states and 504 transitions. [2018-11-23 05:12:03,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2018-11-23 05:12:03,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2018-11-23 05:12:03,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 468 states and 504 transitions. [2018-11-23 05:12:03,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:12:03,023 INFO L705 BuchiCegarLoop]: Abstraction has 468 states and 504 transitions. [2018-11-23 05:12:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states and 504 transitions. [2018-11-23 05:12:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2018-11-23 05:12:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-11-23 05:12:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 504 transitions. [2018-11-23 05:12:03,031 INFO L728 BuchiCegarLoop]: Abstraction has 468 states and 504 transitions. [2018-11-23 05:12:03,031 INFO L608 BuchiCegarLoop]: Abstraction has 468 states and 504 transitions. [2018-11-23 05:12:03,031 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-23 05:12:03,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 468 states and 504 transitions. [2018-11-23 05:12:03,032 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 150 [2018-11-23 05:12:03,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:03,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:03,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 18, 16, 2, 1, 1, 1, 1] [2018-11-23 05:12:03,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 1] [2018-11-23 05:12:03,033 INFO L794 eck$LassoCheckResult]: Stem: 12267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12265#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 12266#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 12268#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 12273#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12302#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12301#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12300#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12299#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12298#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12296#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12297#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12401#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12399#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12400#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12438#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 12437#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12436#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12435#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12434#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12433#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12432#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12431#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12430#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12429#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12428#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12427#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12426#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12425#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12424#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12423#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12422#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12421#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12420#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12419#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12418#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12416#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12414#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12412#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12410#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12408#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12404#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12405#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12406#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12407#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12402#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12403#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12417#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12415#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12413#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12411#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12409#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12345#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12346#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12474#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12473#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12467#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12464#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 12462#L556-2 [2018-11-23 05:12:03,033 INFO L796 eck$LassoCheckResult]: Loop: 12462#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12497#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12496#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12495#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12494#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12493#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12492#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12491#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12490#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12489#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12488#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12487#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12463#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12486#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12471#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 12461#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 12466#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 12460#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 12462#L556-2 [2018-11-23 05:12:03,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:03,033 INFO L82 PathProgramCache]: Analyzing trace with hash -451724147, now seen corresponding path program 22 times [2018-11-23 05:12:03,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:03,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:03,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:03,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:03,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 1 proven. 350 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-23 05:12:03,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:03,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:12:03,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:12:03,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:12:03,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:03,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:03,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,682 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:12:03,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,692 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 17 treesize of output 19 [2018-11-23 05:12:03,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:12:03,694 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,702 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 05:12:03,702 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:12:03,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,722 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 38 [2018-11-23 05:12:03,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-23 05:12:03,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:12:03,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,755 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 38 [2018-11-23 05:12:03,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,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 30 [2018-11-23 05:12:03,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:12:03,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,829 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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:12:03,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,831 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 43 treesize of output 43 [2018-11-23 05:12:03,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:35 [2018-11-23 05:12:03,912 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 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:12:03,915 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 21 [2018-11-23 05:12:03,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:12:03,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,961 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:12:03,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:03,964 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 7 [2018-11-23 05:12:03,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:03,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:12:04,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,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 1 case distinctions, treesize of input 63 treesize of output 72 [2018-11-23 05:12:04,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,075 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 38 treesize of output 16 [2018-11-23 05:12:04,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:50 [2018-11-23 05:12:04,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,202 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 1 case distinctions, treesize of input 71 treesize of output 80 [2018-11-23 05:12:04,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,205 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 38 treesize of output 16 [2018-11-23 05:12:04,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:79, output treesize:58 [2018-11-23 05:12:04,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,367 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 1 case distinctions, treesize of input 79 treesize of output 88 [2018-11-23 05:12:04,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,369 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 38 treesize of output 16 [2018-11-23 05:12:04,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:66 [2018-11-23 05:12:04,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,539 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 1 case distinctions, treesize of input 87 treesize of output 96 [2018-11-23 05:12:04,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,542 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 38 treesize of output 16 [2018-11-23 05:12:04,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:95, output treesize:74 [2018-11-23 05:12:04,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,730 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 1 case distinctions, treesize of input 95 treesize of output 104 [2018-11-23 05:12:04,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,733 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 38 treesize of output 16 [2018-11-23 05:12:04,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:103, output treesize:82 [2018-11-23 05:12:04,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,936 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 1 case distinctions, treesize of input 103 treesize of output 112 [2018-11-23 05:12:04,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:04,943 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 38 treesize of output 16 [2018-11-23 05:12:04,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:04,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:90 [2018-11-23 05:12:05,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:05,234 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 1 case distinctions, treesize of input 111 treesize of output 120 [2018-11-23 05:12:05,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:05,237 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 38 treesize of output 16 [2018-11-23 05:12:05,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:05,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:05,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:05,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:119, output treesize:98 [2018-11-23 05:12:05,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:05,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 1 case distinctions, treesize of input 119 treesize of output 128 [2018-11-23 05:12:05,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:05,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16 [2018-11-23 05:12:05,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:05,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:05,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:05,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:127, output treesize:106 [2018-11-23 05:12:05,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:05,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 136 [2018-11-23 05:12:05,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:05,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, 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 16 [2018-11-23 05:12:05,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:05,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:05,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:05,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:135, output treesize:114 [2018-11-23 05:12:06,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:06,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 1 case distinctions, treesize of input 135 treesize of output 144 [2018-11-23 05:12:06,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:06,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, 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 16 [2018-11-23 05:12:06,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:06,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:06,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:06,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:143, output treesize:122 [2018-11-23 05:12:06,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:06,392 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 1 case distinctions, treesize of input 143 treesize of output 152 [2018-11-23 05:12:06,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:06,395 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 38 treesize of output 16 [2018-11-23 05:12:06,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:06,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:06,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:06,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:151, output treesize:130 [2018-11-23 05:12:06,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:06,784 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 1 case distinctions, treesize of input 162 treesize of output 169 [2018-11-23 05:12:06,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:06,787 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 47 treesize of output 23 [2018-11-23 05:12:06,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:06,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:06,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:06,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:170, output treesize:81 [2018-11-23 05:12:06,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 79 [2018-11-23 05:12: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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2018-11-23 05:12:06,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 05:12:07,034 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 05:12:07,035 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:07,060 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 11 [2018-11-23 05:12:07,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:07,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:07,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:07,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2018-11-23 05:12:07,085 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:07,134 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 11 [2018-11-23 05:12:07,134 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:07,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:07,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:07,185 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:95, output treesize:7 [2018-11-23 05:12:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:07,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:07,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 48] total 62 [2018-11-23 05:12:07,277 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:07,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:07,277 INFO L82 PathProgramCache]: Analyzing trace with hash -802506973, now seen corresponding path program 19 times [2018-11-23 05:12:07,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:07,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:07,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:07,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:07,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:08,045 WARN L180 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 177 [2018-11-23 05:12:08,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-23 05:12:08,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=3537, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 05:12:08,107 INFO L87 Difference]: Start difference. First operand 468 states and 504 transitions. cyclomatic complexity: 48 Second operand 63 states. [2018-11-23 05:12:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:11,744 INFO L93 Difference]: Finished difference Result 439 states and 466 transitions. [2018-11-23 05:12:11,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 05:12:11,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 439 states and 466 transitions. [2018-11-23 05:12:11,745 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 132 [2018-11-23 05:12:11,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 439 states to 380 states and 406 transitions. [2018-11-23 05:12:11,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2018-11-23 05:12:11,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2018-11-23 05:12:11,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 380 states and 406 transitions. [2018-11-23 05:12:11,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:12:11,746 INFO L705 BuchiCegarLoop]: Abstraction has 380 states and 406 transitions. [2018-11-23 05:12:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states and 406 transitions. [2018-11-23 05:12:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-23 05:12:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-23 05:12:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 406 transitions. [2018-11-23 05:12:11,751 INFO L728 BuchiCegarLoop]: Abstraction has 380 states and 406 transitions. [2018-11-23 05:12:11,751 INFO L608 BuchiCegarLoop]: Abstraction has 380 states and 406 transitions. [2018-11-23 05:12:11,751 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-23 05:12:11,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 406 transitions. [2018-11-23 05:12:11,752 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 132 [2018-11-23 05:12:11,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:11,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:11,752 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 18, 16, 2, 1, 1, 1, 1] [2018-11-23 05:12:11,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 9, 1] [2018-11-23 05:12:11,753 INFO L794 eck$LassoCheckResult]: Stem: 13513#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13511#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 13512#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 13514#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 13519#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13551#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13550#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13549#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13548#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13547#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13546#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13545#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13544#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13542#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13543#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13632#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13630#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13631#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13744#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13743#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13541#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13540#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13535#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13536#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13874#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13872#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13854#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13852#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 13850#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13848#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13847#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13846#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13845#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13844#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13843#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13842#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13841#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13840#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13839#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13838#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13837#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13836#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13834#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13832#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13830#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13828#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13826#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13824#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13822#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13820#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13818#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13816#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13814#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13755#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13811#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13754#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13752#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13749#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 13746#L556-2 [2018-11-23 05:12:11,753 INFO L796 eck$LassoCheckResult]: Loop: 13746#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13745#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13524#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13525#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13801#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13799#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13797#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13795#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13793#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13791#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13789#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13787#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13785#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13783#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13781#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13779#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13777#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13775#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13773#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13771#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13769#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13767#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13637#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13636#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13634#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13635#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13756#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 13753#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 13750#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 13751#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 13746#L556-2 [2018-11-23 05:12:11,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1147269005, now seen corresponding path program 23 times [2018-11-23 05:12:11,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:11,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:11,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:11,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:11,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 107 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:12,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:12,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:12:12,990 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:12:13,201 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 05:12:13,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:13,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:13,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,249 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 3 case distinctions, treesize of input 17 treesize of output 41 [2018-11-23 05:12:13,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-23 05:12:13,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,266 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 16 treesize of output 22 [2018-11-23 05:12:13,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:13,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:13,279 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:27, output treesize:37 [2018-11-23 05:12:13,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,327 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 30 treesize of output 35 [2018-11-23 05:12:13,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 05:12:13,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,352 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 40 treesize of output 66 [2018-11-23 05:12:13,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,367 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 53 treesize of output 71 [2018-11-23 05:12:13,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:12:13,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:13,393 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:12:13,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-11-23 05:12:13,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,439 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 23 treesize of output 16 [2018-11-23 05:12:13,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,462 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 40 treesize of output 66 [2018-11-23 05:12:13,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,478 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 53 treesize of output 71 [2018-11-23 05:12:13,479 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:12:13,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:13,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:12:13,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,559 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 30 treesize of output 35 [2018-11-23 05:12:13,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,561 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 23 treesize of output 16 [2018-11-23 05:12:13,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,585 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 40 treesize of output 66 [2018-11-23 05:12:13,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,600 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 53 treesize of output 71 [2018-11-23 05:12:13,600 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:12:13,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:13,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:12:13,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,675 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 40 treesize of output 66 [2018-11-23 05:12:13,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,689 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 53 treesize of output 71 [2018-11-23 05:12:13,691 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:12:13,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,722 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 30 treesize of output 35 [2018-11-23 05:12:13,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 05:12:13,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:13,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:12:13,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,795 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 40 treesize of output 66 [2018-11-23 05:12:13,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,809 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 53 treesize of output 71 [2018-11-23 05:12:13,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:12:13,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,840 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 30 treesize of output 35 [2018-11-23 05:12:13,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,842 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 23 treesize of output 16 [2018-11-23 05:12:13,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:13,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:12:13,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,914 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 40 treesize of output 66 [2018-11-23 05:12:13,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,928 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 53 treesize of output 71 [2018-11-23 05:12:13,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:12:13,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-11-23 05:12:13,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:13,960 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 23 treesize of output 16 [2018-11-23 05:12:13,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:13,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:13,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:12:14,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,146 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 3 case distinctions, treesize of input 42 treesize of output 91 [2018-11-23 05:12:14,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,162 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 82 treesize of output 104 [2018-11-23 05:12:14,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:12:14,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,196 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 27 treesize of output 33 [2018-11-23 05:12:14,196 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,209 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-11-23 05:12:14,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,308 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 51 treesize of output 76 [2018-11-23 05:12:14,333 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 87 [2018-11-23 05:12:14,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2018-11-23 05:12:14,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:51 [2018-11-23 05:12:14,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,437 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 51 treesize of output 74 [2018-11-23 05:12:14,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,441 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 19 [2018-11-23 05:12:14,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:53 [2018-11-23 05:12:14,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,668 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 65 treesize of output 92 [2018-11-23 05:12:14,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,684 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:12:14,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:12:14,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,720 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 05:12:14,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:60 [2018-11-23 05:12:14,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,786 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 63 treesize of output 86 [2018-11-23 05:12:14,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,789 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 05:12:14,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,812 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 05:12:14,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:60 [2018-11-23 05:12:14,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,887 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 63 treesize of output 86 [2018-11-23 05:12:14,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,890 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 05:12:14,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:14,914 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 05:12:14,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:60 [2018-11-23 05:12:14,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,981 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 63 treesize of output 86 [2018-11-23 05:12:14,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:14,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, 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 05:12:14,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,017 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 05:12:15,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:60 [2018-11-23 05:12:15,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,083 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 63 treesize of output 86 [2018-11-23 05:12:15,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,086 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 05:12:15,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,105 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 05:12:15,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:60 [2018-11-23 05:12:15,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,172 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 63 treesize of output 86 [2018-11-23 05:12:15,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 05:12:15,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,194 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 05:12:15,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:60 [2018-11-23 05:12:15,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,271 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 63 treesize of output 99 [2018-11-23 05:12:15,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,274 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 43 treesize of output 26 [2018-11-23 05:12:15,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,294 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 05:12:15,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:56 [2018-11-23 05:12:15,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,453 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 74 treesize of output 101 [2018-11-23 05:12:15,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,469 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 45 treesize of output 56 [2018-11-23 05:12:15,470 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:12:15,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,506 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 05:12:15,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:69 [2018-11-23 05:12:15,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:15,602 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 63 treesize of output 61 [2018-11-23 05:12:15,608 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-11-23 05:12:15,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-23 05:12:15,629 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 05:12:15,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,637 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 05:12:15,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:15,646 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 05:12:15,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2018-11-23 05:12:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:15,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:15,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 56 [2018-11-23 05:12:15,711 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:15,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:15,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1102482461, now seen corresponding path program 20 times [2018-11-23 05:12:15,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:15,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:15,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:15,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:15,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:20,226 WARN L180 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 281 DAG size of output: 273 [2018-11-23 05:12:20,351 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-23 05:12:20,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 05:12:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2964, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 05:12:20,352 INFO L87 Difference]: Start difference. First operand 380 states and 406 transitions. cyclomatic complexity: 36 Second operand 57 states. [2018-11-23 05:12:21,451 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2018-11-23 05:12:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:26,623 INFO L93 Difference]: Finished difference Result 487 states and 522 transitions. [2018-11-23 05:12:26,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-23 05:12:26,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 487 states and 522 transitions. [2018-11-23 05:12:26,624 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 165 [2018-11-23 05:12:26,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 487 states to 485 states and 520 transitions. [2018-11-23 05:12:26,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2018-11-23 05:12:26,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2018-11-23 05:12:26,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 485 states and 520 transitions. [2018-11-23 05:12:26,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:12:26,627 INFO L705 BuchiCegarLoop]: Abstraction has 485 states and 520 transitions. [2018-11-23 05:12:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 520 transitions. [2018-11-23 05:12:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2018-11-23 05:12:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-11-23 05:12:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 504 transitions. [2018-11-23 05:12:26,633 INFO L728 BuchiCegarLoop]: Abstraction has 469 states and 504 transitions. [2018-11-23 05:12:26,633 INFO L608 BuchiCegarLoop]: Abstraction has 469 states and 504 transitions. [2018-11-23 05:12:26,633 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-23 05:12:26,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 469 states and 504 transitions. [2018-11-23 05:12:26,634 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 165 [2018-11-23 05:12:26,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:26,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:26,635 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [18, 18, 16, 2, 1, 1, 1, 1] [2018-11-23 05:12:26,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 9, 1] [2018-11-23 05:12:26,635 INFO L794 eck$LassoCheckResult]: Stem: 14757#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14755#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 14756#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 14758#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 14763#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 14866#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 14865#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 14864#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 14863#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 14862#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 14861#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 14860#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 14859#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 14858#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 14857#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 14856#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 14854#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 14855#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 14979#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 14977#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 14978#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15100#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15097#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15095#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15093#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 15091#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15089#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15087#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15085#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15083#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15081#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15079#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15077#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15075#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15073#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15071#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15069#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15067#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15065#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15063#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15061#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15059#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15057#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15055#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15053#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15051#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15049#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15047#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15045#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15043#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15041#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15039#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15037#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15035#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15033#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15031#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 14998#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15102#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 15020#L556-2 [2018-11-23 05:12:26,635 INFO L796 eck$LassoCheckResult]: Loop: 15020#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15101#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15099#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15096#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15094#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15092#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15090#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15088#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15086#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15084#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15082#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15080#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15078#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15076#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15074#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15072#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15070#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15068#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15066#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15064#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15062#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15060#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15058#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15056#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15054#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15052#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15050#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 15048#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 15046#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 15019#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 15020#L556-2 [2018-11-23 05:12:26,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:26,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1798314167, now seen corresponding path program 24 times [2018-11-23 05:12:26,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:26,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:26,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:26,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 1 proven. 458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:28,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:28,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:12:28,052 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:12:28,653 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-11-23 05:12:28,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:28,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:28,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 23 treesize of output 25 [2018-11-23 05:12:28,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:12:28,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 [2018-11-23 05:12:28,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, 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 05:12:28,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:28,694 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-11-23 05:12:28,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:28,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:28,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:28,769 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:12:28,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,778 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 26 [2018-11-23 05:12:28,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:12:28,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,784 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,788 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 05:12:28,788 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-11-23 05:12:28,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:28,828 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 38 treesize of output 45 [2018-11-23 05:12:28,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:28,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 30 [2018-11-23 05:12:28,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:12:28,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:28,882 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 38 treesize of output 45 [2018-11-23 05:12:28,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:28,884 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 30 [2018-11-23 05:12:28,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:12:28,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:28,948 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 38 treesize of output 45 [2018-11-23 05:12:28,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:28,951 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 30 [2018-11-23 05:12:28,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:28,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:12:29,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 45 [2018-11-23 05:12:29,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,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, 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 30 [2018-11-23 05:12:29,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:12:29,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,087 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 38 treesize of output 45 [2018-11-23 05:12:29,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,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 34 treesize of output 30 [2018-11-23 05:12:29,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:12:29,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 58 [2018-11-23 05:12:29,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2018-11-23 05:12:29,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-11-23 05:12:29,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,285 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 1 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 05:12:29,287 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 18 [2018-11-23 05:12:29,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:12:29,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,469 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:12:29,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,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, 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 16 [2018-11-23 05:12:29,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:44 [2018-11-23 05:12:29,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,661 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 1 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 05:12:29,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,664 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 38 treesize of output 16 [2018-11-23 05:12:29,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:52 [2018-11-23 05:12:29,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,858 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 1 case distinctions, treesize of input 73 treesize of output 82 [2018-11-23 05:12:29,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:29,860 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 38 treesize of output 16 [2018-11-23 05:12:29,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:29,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:60 [2018-11-23 05:12:30,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,065 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 1 case distinctions, treesize of input 81 treesize of output 90 [2018-11-23 05:12:30,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,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, 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 16 [2018-11-23 05:12:30,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,089 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 05:12:30,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:68 [2018-11-23 05:12:30,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,163 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 1 case distinctions, treesize of input 77 treesize of output 88 [2018-11-23 05:12:30,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,165 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 7 [2018-11-23 05:12:30,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,185 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 05:12:30,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:68 [2018-11-23 05:12:30,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,257 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 1 case distinctions, treesize of input 77 treesize of output 88 [2018-11-23 05:12:30,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,260 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 7 [2018-11-23 05:12:30,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,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 05:12:30,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:68 [2018-11-23 05:12:30,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,351 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 1 case distinctions, treesize of input 77 treesize of output 88 [2018-11-23 05:12:30,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,353 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 7 [2018-11-23 05:12:30,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,374 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 05:12:30,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:68 [2018-11-23 05:12:30,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,447 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 1 case distinctions, treesize of input 77 treesize of output 88 [2018-11-23 05:12:30,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,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, 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 7 [2018-11-23 05:12:30,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,475 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 05:12:30,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:68 [2018-11-23 05:12:30,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 88 [2018-11-23 05:12:30,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,574 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 7 [2018-11-23 05:12:30,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,599 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 05:12:30,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:68 [2018-11-23 05:12:30,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,693 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 1 case distinctions, treesize of input 77 treesize of output 88 [2018-11-23 05:12:30,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,696 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 7 [2018-11-23 05:12:30,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,718 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 05:12:30,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:68 [2018-11-23 05:12:30,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 70 [2018-11-23 05:12:30,804 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-11-23 05:12:30,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,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 51 treesize of output 44 [2018-11-23 05:12:30,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,864 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 54 treesize of output 47 [2018-11-23 05:12:30,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-11-23 05:12:30,890 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:30,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-23 05:12:30,911 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:30,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:30,934 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:82, output treesize:7 [2018-11-23 05:12:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:30,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:30,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 60 [2018-11-23 05:12:30,990 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:30,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1102482461, now seen corresponding path program 21 times [2018-11-23 05:12:30,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:30,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:30,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:30,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:30,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:35,936 WARN L180 SmtUtils]: Spent 4.91 s on a formula simplification. DAG size of input: 281 DAG size of output: 273 [2018-11-23 05:12:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-11-23 05:12:36,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3496, Unknown=0, NotChecked=0, Total=3660 [2018-11-23 05:12:36,038 INFO L87 Difference]: Start difference. First operand 469 states and 504 transitions. cyclomatic complexity: 46 Second operand 61 states. [2018-11-23 05:12:38,312 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 49 [2018-11-23 05:12:38,756 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 49 [2018-11-23 05:12:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:39,892 INFO L93 Difference]: Finished difference Result 471 states and 505 transitions. [2018-11-23 05:12:39,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 05:12:39,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 471 states and 505 transitions. [2018-11-23 05:12:39,893 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 165 [2018-11-23 05:12:39,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 471 states to 469 states and 503 transitions. [2018-11-23 05:12:39,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229 [2018-11-23 05:12:39,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 229 [2018-11-23 05:12:39,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 469 states and 503 transitions. [2018-11-23 05:12:39,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:12:39,895 INFO L705 BuchiCegarLoop]: Abstraction has 469 states and 503 transitions. [2018-11-23 05:12:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states and 503 transitions. [2018-11-23 05:12:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2018-11-23 05:12:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-11-23 05:12:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 503 transitions. [2018-11-23 05:12:39,903 INFO L728 BuchiCegarLoop]: Abstraction has 469 states and 503 transitions. [2018-11-23 05:12:39,903 INFO L608 BuchiCegarLoop]: Abstraction has 469 states and 503 transitions. [2018-11-23 05:12:39,903 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-23 05:12:39,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 469 states and 503 transitions. [2018-11-23 05:12:39,904 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 165 [2018-11-23 05:12:39,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:39,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:39,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 17, 2, 1, 1, 1, 1] [2018-11-23 05:12:39,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 7, 1] [2018-11-23 05:12:39,905 INFO L794 eck$LassoCheckResult]: Stem: 16006#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 16004#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 16005#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 16007#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 16012#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16114#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16113#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16112#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16111#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16110#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16109#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16108#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16107#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16106#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16105#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16104#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16102#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16103#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16230#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16228#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16227#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16226#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 16225#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16224#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16223#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16222#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16221#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16220#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16219#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16218#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16217#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16216#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16215#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16214#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16213#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16212#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16211#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16210#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16208#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16206#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16204#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16202#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16200#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16198#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16196#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16194#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16192#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16190#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16188#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16186#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16184#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16182#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16180#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16178#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16176#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16174#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16170#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16171#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16169#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16167#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16163#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 16164#L556-2 [2018-11-23 05:12:39,906 INFO L796 eck$LassoCheckResult]: Loop: 16164#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16209#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16207#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16205#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16203#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16201#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16199#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16197#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16195#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16193#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16191#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16189#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16187#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16185#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16183#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16181#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16179#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16177#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16175#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16173#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16172#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 16166#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 16168#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 16165#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 16164#L556-2 [2018-11-23 05:12:39,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:39,906 INFO L82 PathProgramCache]: Analyzing trace with hash -186681142, now seen corresponding path program 25 times [2018-11-23 05:12:39,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:39,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:39,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:39,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 6 proven. 467 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 05:12:40,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:40,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:12:40,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:40,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:40,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:40,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:40,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:40,855 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:12:40,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:40,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, 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 26 [2018-11-23 05:12:40,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 14 treesize of output 13 [2018-11-23 05:12:40,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:40,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:40,877 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 05:12:40,877 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-11-23 05:12:40,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:40,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 45 [2018-11-23 05:12:40,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:40,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, 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 30 [2018-11-23 05:12:40,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:40,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:40,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:40,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:12:40,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:40,974 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 38 treesize of output 45 [2018-11-23 05:12:40,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:40,977 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 30 [2018-11-23 05:12:40,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:40,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:40,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:40,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:12:41,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,033 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 38 treesize of output 45 [2018-11-23 05:12:41,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,045 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 30 [2018-11-23 05:12:41,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:12:41,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,099 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 38 treesize of output 45 [2018-11-23 05:12:41,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,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 34 treesize of output 30 [2018-11-23 05:12:41,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:12:41,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,213 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 1 case distinctions, treesize of input 49 treesize of output 58 [2018-11-23 05:12:41,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,216 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 43 treesize of output 43 [2018-11-23 05:12:41,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-11-23 05:12:41,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,293 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 1 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 05:12:41,296 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 18 [2018-11-23 05:12:41,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:12:41,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:12:41,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,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, 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 16 [2018-11-23 05:12:41,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:44 [2018-11-23 05:12:41,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,635 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 1 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 05:12:41,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,638 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 38 treesize of output 16 [2018-11-23 05:12:41,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:52 [2018-11-23 05:12:41,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 82 [2018-11-23 05:12:41,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:41,809 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 38 treesize of output 16 [2018-11-23 05:12:41,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:41,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:60 [2018-11-23 05:12:41,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:42,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 90 [2018-11-23 05:12:42,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:42,003 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 38 treesize of output 16 [2018-11-23 05:12:42,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:68 [2018-11-23 05:12:42,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:42,213 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 1 case distinctions, treesize of input 89 treesize of output 98 [2018-11-23 05:12:42,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:42,215 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 38 treesize of output 16 [2018-11-23 05:12:42,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:76 [2018-11-23 05:12:42,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:42,449 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 1 case distinctions, treesize of input 97 treesize of output 106 [2018-11-23 05:12:42,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:42,451 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 38 treesize of output 16 [2018-11-23 05:12:42,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:105, output treesize:84 [2018-11-23 05:12:42,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:42,699 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 1 case distinctions, treesize of input 105 treesize of output 114 [2018-11-23 05:12:42,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:42,703 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 38 treesize of output 16 [2018-11-23 05:12:42,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:113, output treesize:92 [2018-11-23 05:12:42,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:42,972 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 1 case distinctions, treesize of input 113 treesize of output 122 [2018-11-23 05:12:42,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:42,974 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 38 treesize of output 16 [2018-11-23 05:12:42,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:42,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:121, output treesize:100 [2018-11-23 05:12:43,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:43,278 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 1 case distinctions, treesize of input 121 treesize of output 130 [2018-11-23 05:12:43,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:43,281 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 38 treesize of output 16 [2018-11-23 05:12:43,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:129, output treesize:108 [2018-11-23 05:12:43,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:43,599 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 1 case distinctions, treesize of input 129 treesize of output 138 [2018-11-23 05:12:43,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:43,602 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 38 treesize of output 16 [2018-11-23 05:12:43,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:137, output treesize:116 [2018-11-23 05:12:43,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:43,943 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 1 case distinctions, treesize of input 137 treesize of output 146 [2018-11-23 05:12:43,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:43,946 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 38 treesize of output 16 [2018-11-23 05:12:43,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:43,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:145, output treesize:124 [2018-11-23 05:12:44,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:44,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 154 [2018-11-23 05:12:44,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:44,310 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 38 treesize of output 16 [2018-11-23 05:12:44,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:44,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:44,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:44,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:153, output treesize:132 [2018-11-23 05:12:44,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 118 [2018-11-23 05:12:44,562 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 114 treesize of output 107 [2018-11-23 05:12:44,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:44,619 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 95 [2018-11-23 05:12:44,620 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:44,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 64 [2018-11-23 05:12:45,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:45,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:45,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:45,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 78 [2018-11-23 05:12:45,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:45,466 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 11 [2018-11-23 05:12:45,466 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:45,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:45,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:45,489 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:146, output treesize:7 [2018-11-23 05:12:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:45,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:45,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 49] total 73 [2018-11-23 05:12:45,580 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:45,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:45,580 INFO L82 PathProgramCache]: Analyzing trace with hash 187939203, now seen corresponding path program 22 times [2018-11-23 05:12:45,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:45,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:45,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:45,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:12:45,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:47,505 WARN L180 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 231 DAG size of output: 225 [2018-11-23 05:12:47,614 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-11-23 05:12:47,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-11-23 05:12:47,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=4840, Unknown=0, NotChecked=0, Total=5402 [2018-11-23 05:12:47,615 INFO L87 Difference]: Start difference. First operand 469 states and 503 transitions. cyclomatic complexity: 45 Second operand 74 states. [2018-11-23 05:12:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:12:52,472 INFO L93 Difference]: Finished difference Result 452 states and 484 transitions. [2018-11-23 05:12:52,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 05:12:52,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 452 states and 484 transitions. [2018-11-23 05:12:52,473 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 141 [2018-11-23 05:12:52,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 452 states to 404 states and 435 transitions. [2018-11-23 05:12:52,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 200 [2018-11-23 05:12:52,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 200 [2018-11-23 05:12:52,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 404 states and 435 transitions. [2018-11-23 05:12:52,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:12:52,474 INFO L705 BuchiCegarLoop]: Abstraction has 404 states and 435 transitions. [2018-11-23 05:12:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states and 435 transitions. [2018-11-23 05:12:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-11-23 05:12:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-11-23 05:12:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 435 transitions. [2018-11-23 05:12:52,479 INFO L728 BuchiCegarLoop]: Abstraction has 404 states and 435 transitions. [2018-11-23 05:12:52,479 INFO L608 BuchiCegarLoop]: Abstraction has 404 states and 435 transitions. [2018-11-23 05:12:52,479 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-23 05:12:52,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 404 states and 435 transitions. [2018-11-23 05:12:52,480 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 141 [2018-11-23 05:12:52,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:12:52,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:12:52,481 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 17, 2, 1, 1, 1, 1] [2018-11-23 05:12:52,481 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 9, 1] [2018-11-23 05:12:52,481 INFO L794 eck$LassoCheckResult]: Stem: 17284#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 17282#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 17283#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 17285#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 17290#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17391#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17390#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17389#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17388#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17387#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17386#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17385#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17384#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17383#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17382#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17381#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17379#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17380#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17563#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17561#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17560#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17559#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17557#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17556#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17555#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 17553#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17551#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17549#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17547#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17545#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17543#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17541#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17539#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17537#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17535#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17533#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17531#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17529#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17527#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17525#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17523#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17521#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17519#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17517#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17515#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17513#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17511#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17510#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17508#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17506#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17504#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17502#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17500#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17498#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17496#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17494#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17492#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17490#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17488#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17461#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17597#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 17482#L556-2 [2018-11-23 05:12:52,482 INFO L796 eck$LassoCheckResult]: Loop: 17482#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17593#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17591#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17589#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17588#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17586#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17584#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17582#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17580#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17578#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17576#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17574#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17572#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17406#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17404#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17405#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17509#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17507#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17505#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17503#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17501#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17499#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17497#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17495#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17493#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17491#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17489#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 17487#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 17485#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 17481#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 17482#L556-2 [2018-11-23 05:12:52,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:52,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1844657678, now seen corresponding path program 26 times [2018-11-23 05:12:52,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:52,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:52,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:52,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:52,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:12:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 17 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:53,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:12:53,715 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/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 05:12:53,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:12:53,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:12:53,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:12:53,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:12:53,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 05:12:53,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, 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 05:12:53,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 05:12:53,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:53,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:53,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:53,805 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:12:53,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,814 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 17 treesize of output 19 [2018-11-23 05:12:53,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 05:12:53,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,823 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 05:12:53,823 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:12:53,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:53,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-23 05:12:53,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:53,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 34 treesize of output 30 [2018-11-23 05:12:53,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:12:53,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:53,926 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 38 [2018-11-23 05:12:53,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:53,929 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 30 [2018-11-23 05:12:53,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:12:53,979 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:53,981 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 38 [2018-11-23 05:12:53,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:53,984 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 30 [2018-11-23 05:12:53,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:53,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:12:54,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,036 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 38 [2018-11-23 05:12:54,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,038 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 30 [2018-11-23 05:12:54,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:12:54,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,091 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 38 [2018-11-23 05:12:54,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,094 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 30 [2018-11-23 05:12:54,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:12:54,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,197 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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:12:54,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,200 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 43 treesize of output 43 [2018-11-23 05:12:54,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2018-11-23 05:12:54,318 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 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:12:54,321 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 21 [2018-11-23 05:12:54,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:12:54,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,392 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:12:54,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,395 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 7 [2018-11-23 05:12:54,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:12:54,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,467 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:12:54,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,470 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 7 [2018-11-23 05:12:54,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:12:54,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:12:54,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,548 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 7 [2018-11-23 05:12:54,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:12:54,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,619 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:12:54,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,622 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 7 [2018-11-23 05:12:54,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:12:54,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,808 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 1 case distinctions, treesize of input 63 treesize of output 72 [2018-11-23 05:12:54,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,811 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 38 treesize of output 16 [2018-11-23 05:12:54,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,832 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 05:12:54,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-11-23 05:12:54,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,909 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:12:54,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:54,915 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 7 [2018-11-23 05:12:54,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:54,931 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 05:12:54,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:12:54,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:12:55,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,003 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 7 [2018-11-23 05:12:55,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,019 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 05:12:55,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:12:55,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,085 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:12:55,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,088 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 7 [2018-11-23 05:12:55,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,104 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 05:12:55,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:12:55,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,175 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:12:55,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,178 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 7 [2018-11-23 05:12:55,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,194 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 05:12:55,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:12:55,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,274 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:12:55,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,277 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 7 [2018-11-23 05:12:55,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,293 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 05:12:55,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:12:55,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,443 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 1 case distinctions, treesize of input 70 treesize of output 79 [2018-11-23 05:12:55,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,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 37 treesize of output 15 [2018-11-23 05:12:55,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,464 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 05:12:55,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2018-11-23 05:12:55,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 05:12:55,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:12:55,545 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-11-23 05:12:55,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,569 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 11 [2018-11-23 05:12:55,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,586 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 49 treesize of output 42 [2018-11-23 05:12:55,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-23 05:12:55,601 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 05:12:55,615 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 05:12:55,615 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:12:55,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:12:55,634 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:71, output treesize:7 [2018-11-23 05:12:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:12:55,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:12:55,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 55 [2018-11-23 05:12:55,709 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:12:55,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:12:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1102482461, now seen corresponding path program 23 times [2018-11-23 05:12:55,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:12:55,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:12:55,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:55,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:12:55,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:12:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:12:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:13:00,442 WARN L180 SmtUtils]: Spent 4.68 s on a formula simplification. DAG size of input: 281 DAG size of output: 273 [2018-11-23 05:13:00,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 05:13:00,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2908, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 05:13:00,540 INFO L87 Difference]: Start difference. First operand 404 states and 435 transitions. cyclomatic complexity: 40 Second operand 56 states. [2018-11-23 05:13:06,211 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2018-11-23 05:13:06,476 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2018-11-23 05:13:06,721 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2018-11-23 05:13:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:13:07,978 INFO L93 Difference]: Finished difference Result 537 states and 574 transitions. [2018-11-23 05:13:07,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-23 05:13:07,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 574 transitions. [2018-11-23 05:13:07,979 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 141 [2018-11-23 05:13:07,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 535 states and 572 transitions. [2018-11-23 05:13:07,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2018-11-23 05:13:07,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 320 [2018-11-23 05:13:07,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 535 states and 572 transitions. [2018-11-23 05:13:07,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:13:07,982 INFO L705 BuchiCegarLoop]: Abstraction has 535 states and 572 transitions. [2018-11-23 05:13:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states and 572 transitions. [2018-11-23 05:13:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 478. [2018-11-23 05:13:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-11-23 05:13:07,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 515 transitions. [2018-11-23 05:13:07,988 INFO L728 BuchiCegarLoop]: Abstraction has 478 states and 515 transitions. [2018-11-23 05:13:07,989 INFO L608 BuchiCegarLoop]: Abstraction has 478 states and 515 transitions. [2018-11-23 05:13:07,989 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-23 05:13:07,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 515 transitions. [2018-11-23 05:13:07,990 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 141 [2018-11-23 05:13:07,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:13:07,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:13:07,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 17, 2, 1, 1, 1, 1] [2018-11-23 05:13:07,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 9, 1] [2018-11-23 05:13:07,991 INFO L794 eck$LassoCheckResult]: Stem: 18612#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 18610#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 18611#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 18613#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 18618#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18649#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18648#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18647#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18646#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18645#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18644#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18643#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18642#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18640#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18639#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18638#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18629#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18631#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18641#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18636#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18637#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18857#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18855#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18856#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 19044#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 19042#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 19040#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 19038#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 19036#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18635#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 19009#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 19006#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 19004#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 19002#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 19000#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18998#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18996#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18993#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18990#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18987#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18983#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18980#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18977#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18974#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18971#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18968#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18965#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18962#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18959#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18955#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18951#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18950#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18948#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18946#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18944#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18942#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18933#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18936#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18932#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18858#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18614#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 18615#L556-2 [2018-11-23 05:13:07,991 INFO L796 eck$LassoCheckResult]: Loop: 18615#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 19084#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18912#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18913#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 19087#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 19086#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 19085#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18907#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18876#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18875#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18874#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18873#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18872#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18871#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18870#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18869#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18868#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18867#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18866#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18865#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18864#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18863#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18862#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18861#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18860#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18859#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18663#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 18662#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 18657#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 18658#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 18615#L556-2 [2018-11-23 05:13:07,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:13:07,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1886726030, now seen corresponding path program 27 times [2018-11-23 05:13:07,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:13:07,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:13:07,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:07,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:13:07,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:13:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 111 proven. 402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:13:08,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:13:08,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:13:08,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:13:09,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-23 05:13:09,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:13:09,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:13:09,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 [2018-11-23 05:13:09,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:13:09,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2018-11-23 05:13:09,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:13:09,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:09,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-11-23 05:13:09,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,251 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:13:09,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,256 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:13:09,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,281 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 33 treesize of output 30 [2018-11-23 05:13:09,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 14 treesize of output 13 [2018-11-23 05:13:09,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-11-23 05:13:09,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 14 treesize of output 13 [2018-11-23 05:13:09,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,312 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:09,325 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2018-11-23 05:13:09,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,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, 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 49 [2018-11-23 05:13:09,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,360 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 30 [2018-11-23 05:13:09,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,386 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 49 [2018-11-23 05:13:09,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,388 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 30 [2018-11-23 05:13:09,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:09,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:13:09,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,442 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 49 [2018-11-23 05:13:09,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,444 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 30 [2018-11-23 05:13:09,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,469 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 49 [2018-11-23 05:13:09,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,471 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 30 [2018-11-23 05:13:09,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:09,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:13:09,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,527 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 49 [2018-11-23 05:13:09,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,530 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 30 [2018-11-23 05:13:09,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,560 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 49 [2018-11-23 05:13:09,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,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 34 treesize of output 30 [2018-11-23 05:13:09,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:09,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:13:09,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,619 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 49 [2018-11-23 05:13:09,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,622 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 30 [2018-11-23 05:13:09,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,649 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 49 [2018-11-23 05:13:09,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,652 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 30 [2018-11-23 05:13:09,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:09,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:13:09,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,716 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 49 [2018-11-23 05:13:09,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,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 34 treesize of output 30 [2018-11-23 05:13:09,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,745 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 49 [2018-11-23 05:13:09,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,748 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 30 [2018-11-23 05:13:09,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:09,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:13:09,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,809 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 49 [2018-11-23 05:13:09,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,812 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 30 [2018-11-23 05:13:09,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,837 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 49 [2018-11-23 05:13:09,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,840 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 30 [2018-11-23 05:13:09,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:09,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:13:09,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,905 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 49 [2018-11-23 05:13:09,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,907 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 30 [2018-11-23 05:13:09,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,934 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 49 [2018-11-23 05:13:09,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:09,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 34 treesize of output 30 [2018-11-23 05:13:09,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:09,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:09,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:13:10,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,053 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 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:13:10,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,055 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 43 treesize of output 43 [2018-11-23 05:13:10,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,091 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 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:13:10,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,093 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 43 treesize of output 43 [2018-11-23 05:13:10,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:10,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:85 [2018-11-23 05:13:10,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,180 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 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:13:10,182 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 18 [2018-11-23 05:13:10,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,215 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 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:13:10,217 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 18 [2018-11-23 05:13:10,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:10,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:73 [2018-11-23 05:13:10,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,387 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:13:10,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,389 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 7 [2018-11-23 05:13:10,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:13:10,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,511 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:13:10,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,518 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 38 treesize of output 16 [2018-11-23 05:13:10,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:44 [2018-11-23 05:13:10,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,649 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 1 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 05:13:10,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,652 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 38 treesize of output 16 [2018-11-23 05:13:10,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:52 [2018-11-23 05:13:10,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,809 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 1 case distinctions, treesize of input 73 treesize of output 82 [2018-11-23 05:13:10,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,812 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 38 treesize of output 16 [2018-11-23 05:13:10,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:10,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:60 [2018-11-23 05:13:10,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:10,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 1 case distinctions, treesize of input 81 treesize of output 90 [2018-11-23 05:13:11,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:11,000 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 38 treesize of output 16 [2018-11-23 05:13:11,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:68 [2018-11-23 05:13:11,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:11,198 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 1 case distinctions, treesize of input 89 treesize of output 98 [2018-11-23 05:13:11,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:11,201 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 38 treesize of output 16 [2018-11-23 05:13:11,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:76 [2018-11-23 05:13:11,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:11,424 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 1 case distinctions, treesize of input 97 treesize of output 106 [2018-11-23 05:13:11,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:11,427 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 38 treesize of output 16 [2018-11-23 05:13:11,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:105, output treesize:84 [2018-11-23 05:13:11,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:11,663 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 1 case distinctions, treesize of input 105 treesize of output 114 [2018-11-23 05:13:11,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:11,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, 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 16 [2018-11-23 05:13:11,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:113, output treesize:92 [2018-11-23 05:13:11,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:11,828 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 1 case distinctions, treesize of input 101 treesize of output 112 [2018-11-23 05:13:11,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:11,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 28 treesize of output 7 [2018-11-23 05:13:11,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,860 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 05:13:11,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:92 [2018-11-23 05:13:11,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 88 [2018-11-23 05:13:11,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2018-11-23 05:13:11,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,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 69 treesize of output 62 [2018-11-23 05:13:11,965 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:11,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2018-11-23 05:13:12,001 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:12,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:12,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:12,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2018-11-23 05:13:12,031 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:12,048 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 11 [2018-11-23 05:13:12,049 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:12,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:12,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:12,066 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:106, output treesize:7 [2018-11-23 05:13:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:13:12,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:13:12,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 41] total 67 [2018-11-23 05:13:12,129 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:13:12,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:13:12,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1102482461, now seen corresponding path program 24 times [2018-11-23 05:13:12,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:13:12,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:13:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:12,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:13:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:13:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:13:16,552 WARN L180 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 281 DAG size of output: 273 [2018-11-23 05:13:16,692 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-23 05:13:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-23 05:13:16,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=3971, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 05:13:16,693 INFO L87 Difference]: Start difference. First operand 478 states and 515 transitions. cyclomatic complexity: 46 Second operand 68 states. [2018-11-23 05:13:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:13:20,059 INFO L93 Difference]: Finished difference Result 586 states and 626 transitions. [2018-11-23 05:13:20,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-23 05:13:20,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 586 states and 626 transitions. [2018-11-23 05:13:20,061 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 174 [2018-11-23 05:13:20,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 586 states to 582 states and 622 transitions. [2018-11-23 05:13:20,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 305 [2018-11-23 05:13:20,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 305 [2018-11-23 05:13:20,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 582 states and 622 transitions. [2018-11-23 05:13:20,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:13:20,063 INFO L705 BuchiCegarLoop]: Abstraction has 582 states and 622 transitions. [2018-11-23 05:13:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states and 622 transitions. [2018-11-23 05:13:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 507. [2018-11-23 05:13:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-11-23 05:13:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 544 transitions. [2018-11-23 05:13:20,066 INFO L728 BuchiCegarLoop]: Abstraction has 507 states and 544 transitions. [2018-11-23 05:13:20,066 INFO L608 BuchiCegarLoop]: Abstraction has 507 states and 544 transitions. [2018-11-23 05:13:20,066 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-23 05:13:20,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 507 states and 544 transitions. [2018-11-23 05:13:20,066 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 174 [2018-11-23 05:13:20,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:13:20,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:13:20,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [19, 19, 17, 2, 1, 1, 1, 1] [2018-11-23 05:13:20,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 10, 1] [2018-11-23 05:13:20,067 INFO L794 eck$LassoCheckResult]: Stem: 20053#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 20051#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 20052#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 20054#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 20059#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20087#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20086#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20085#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20084#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20083#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20082#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20081#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20080#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20078#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20077#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20076#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20068#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20070#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20079#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20074#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20075#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20278#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20276#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20277#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20533#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20532#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20531#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20530#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 20529#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20528#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20527#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20526#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20525#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20524#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20523#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20522#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20521#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20520#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20519#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20518#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20517#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20516#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20515#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20514#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20512#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20510#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20508#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20506#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20504#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20502#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20500#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20498#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20496#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20494#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20492#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20490#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20488#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20486#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20484#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20438#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20481#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 20411#L556-2 [2018-11-23 05:13:20,067 INFO L796 eck$LassoCheckResult]: Loop: 20411#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20412#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20475#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20473#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20471#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20469#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20467#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20465#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20463#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20461#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20459#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20457#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20455#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20453#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20451#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20449#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20447#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20445#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20443#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20441#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20439#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20436#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20435#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20433#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20430#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20427#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20425#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20424#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20422#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20421#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 20417#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 20418#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 20414#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 20411#L556-2 [2018-11-23 05:13:20,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:13:20,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1058857142, now seen corresponding path program 28 times [2018-11-23 05:13:20,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:13:20,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:13:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:20,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:13:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:13:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 1 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:13:21,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:13:21,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:13:21,091 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:13:21,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:13:21,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:13:21,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:13:21,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,148 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:13:21,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 05:13:21,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:13:21,158 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,164 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 05:13:21,164 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:13:21,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,221 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 38 [2018-11-23 05:13:21,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,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 34 treesize of output 30 [2018-11-23 05:13:21,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:21,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,250 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 38 [2018-11-23 05:13:21,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,252 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 30 [2018-11-23 05:13:21,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:21,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,279 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 38 [2018-11-23 05:13:21,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,281 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 30 [2018-11-23 05:13:21,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:21,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,309 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 38 [2018-11-23 05:13:21,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,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 34 treesize of output 30 [2018-11-23 05:13:21,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:21,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,341 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 38 [2018-11-23 05:13:21,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,343 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 30 [2018-11-23 05:13:21,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:21,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 38 [2018-11-23 05:13:21,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,375 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 30 [2018-11-23 05:13:21,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:21,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,453 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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:13:21,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,455 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 43 treesize of output 43 [2018-11-23 05:13:21,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:35 [2018-11-23 05:13:21,552 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 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:13:21,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, 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 21 [2018-11-23 05:13:21,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:13:21,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,611 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 1 case distinctions, treesize of input 38 treesize of output 49 [2018-11-23 05:13:21,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,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 28 treesize of output 7 [2018-11-23 05:13:21,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:29 [2018-11-23 05:13:21,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,667 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 1 case distinctions, treesize of input 38 treesize of output 49 [2018-11-23 05:13:21,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-23 05:13:21,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:13:21,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,809 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 1 case distinctions, treesize of input 50 treesize of output 59 [2018-11-23 05:13:21,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,813 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 38 treesize of output 16 [2018-11-23 05:13:21,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,826 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 05:13:21,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:37 [2018-11-23 05:13:21,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:13:21,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,881 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 7 [2018-11-23 05:13:21,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,893 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 05:13:21,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:13:21,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,946 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 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:13:21,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:21,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 28 treesize of output 7 [2018-11-23 05:13:21,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:21,960 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 05:13:21,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:13:22,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,027 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 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:13:22,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,029 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 7 [2018-11-23 05:13:22,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,041 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 05:13:22,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:13:22,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:13:22,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,111 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 7 [2018-11-23 05:13:22,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,123 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 05:13:22,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:13:22,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,178 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 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:13:22,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,180 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 7 [2018-11-23 05:13:22,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,192 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 05:13:22,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:13:22,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,249 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 1 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:13:22,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,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 28 treesize of output 7 [2018-11-23 05:13:22,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,263 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 05:13:22,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:37 [2018-11-23 05:13:22,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,388 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:13:22,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,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 37 treesize of output 15 [2018-11-23 05:13:22,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,409 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 05:13:22,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:44 [2018-11-23 05:13:22,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 05:13:22,484 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 44 treesize of output 37 [2018-11-23 05:13:22,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,515 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 40 treesize of output 33 [2018-11-23 05:13:22,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:22,536 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-11-23 05:13:22,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,550 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 33 treesize of output 26 [2018-11-23 05:13:22,550 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,566 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 26 treesize of output 20 [2018-11-23 05:13:22,566 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:22,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:22,587 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:58, output treesize:7 [2018-11-23 05:13:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:13:22,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:13:22,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 47 [2018-11-23 05:13:22,647 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:13:22,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:13:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash -440126668, now seen corresponding path program 25 times [2018-11-23 05:13:22,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:13:22,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:13:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:22,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:13:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:13:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:13:29,088 WARN L180 SmtUtils]: Spent 6.39 s on a formula simplification. DAG size of input: 306 DAG size of output: 297 [2018-11-23 05:13:29,235 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-23 05:13:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 05:13:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=2144, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 05:13:29,236 INFO L87 Difference]: Start difference. First operand 507 states and 544 transitions. cyclomatic complexity: 48 Second operand 48 states. [2018-11-23 05:13:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:13:31,547 INFO L93 Difference]: Finished difference Result 511 states and 547 transitions. [2018-11-23 05:13:31,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 05:13:31,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 547 transitions. [2018-11-23 05:13:31,548 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 174 [2018-11-23 05:13:31,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 509 states and 545 transitions. [2018-11-23 05:13:31,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 297 [2018-11-23 05:13:31,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2018-11-23 05:13:31,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 509 states and 545 transitions. [2018-11-23 05:13:31,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:13:31,549 INFO L705 BuchiCegarLoop]: Abstraction has 509 states and 545 transitions. [2018-11-23 05:13:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states and 545 transitions. [2018-11-23 05:13:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 507. [2018-11-23 05:13:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-11-23 05:13:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 543 transitions. [2018-11-23 05:13:31,554 INFO L728 BuchiCegarLoop]: Abstraction has 507 states and 543 transitions. [2018-11-23 05:13:31,554 INFO L608 BuchiCegarLoop]: Abstraction has 507 states and 543 transitions. [2018-11-23 05:13:31,554 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-23 05:13:31,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 507 states and 543 transitions. [2018-11-23 05:13:31,555 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 174 [2018-11-23 05:13:31,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:13:31,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:13:31,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 20, 18, 2, 1, 1, 1, 1] [2018-11-23 05:13:31,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 10, 1] [2018-11-23 05:13:31,556 INFO L794 eck$LassoCheckResult]: Stem: 21358#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 21356#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 21357#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 21359#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 21364#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21397#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21396#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21395#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21394#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21393#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21392#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21391#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21390#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21388#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21387#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21386#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21376#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21378#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21389#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21384#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21385#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21589#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21587#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21588#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21781#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21382#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21381#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21379#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21380#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21374#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21375#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 21370#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21371#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21862#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21367#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21368#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21362#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21363#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21861#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21860#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21859#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21858#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21857#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21856#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21855#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21854#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21853#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21852#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21851#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21850#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21849#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21848#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21847#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21846#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21845#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21844#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21843#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21842#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21841#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21405#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21840#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21404#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21406#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21839#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 21787#L556-2 [2018-11-23 05:13:31,556 INFO L796 eck$LassoCheckResult]: Loop: 21787#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21838#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21837#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21836#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21835#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21833#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21831#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21829#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21827#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21825#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21823#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21821#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21819#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21817#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21815#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21813#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21811#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21809#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21807#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21805#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21803#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21801#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21799#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21797#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21795#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21596#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21594#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21595#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21590#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21591#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 21786#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 21788#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 21785#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 21787#L556-2 [2018-11-23 05:13:31,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:13:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash -781886551, now seen corresponding path program 29 times [2018-11-23 05:13:31,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:13:31,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:13:31,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:31,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:13:31,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:13:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 92 proven. 478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:13:32,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:13:32,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:13:32,973 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:13:33,423 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2018-11-23 05:13:33,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:13:33,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:13:33,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,483 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 3 case distinctions, treesize of input 17 treesize of output 41 [2018-11-23 05:13:33,485 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-23 05:13:33,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 05:13:33,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:33,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:33,507 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:27, output treesize:37 [2018-11-23 05:13:33,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,555 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 30 treesize of output 35 [2018-11-23 05:13:33,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 05:13:33,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,578 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 40 treesize of output 66 [2018-11-23 05:13:33,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,596 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 53 treesize of output 71 [2018-11-23 05:13:33,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:13:33,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:33,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:13:33,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,676 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 40 treesize of output 66 [2018-11-23 05:13:33,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,702 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 53 treesize of output 71 [2018-11-23 05:13:33,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:13:33,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,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 30 treesize of output 35 [2018-11-23 05:13:33,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,735 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 23 treesize of output 16 [2018-11-23 05:13:33,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:33,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:13:33,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,799 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 30 treesize of output 35 [2018-11-23 05:13:33,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,801 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 23 treesize of output 16 [2018-11-23 05:13:33,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,822 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 40 treesize of output 66 [2018-11-23 05:13:33,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,836 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 53 treesize of output 71 [2018-11-23 05:13:33,837 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:13:33,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:33,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:13:33,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 66 [2018-11-23 05:13:33,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,936 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 53 treesize of output 71 [2018-11-23 05:13:33,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:13:33,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-11-23 05:13:33,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:33,975 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 23 treesize of output 16 [2018-11-23 05:13:33,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:33,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:33,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:13:34,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,057 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 30 treesize of output 35 [2018-11-23 05:13:34,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 05:13:34,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,087 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 40 treesize of output 66 [2018-11-23 05:13:34,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,106 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 53 treesize of output 71 [2018-11-23 05:13:34,106 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:13:34,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:34,138 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2018-11-23 05:13:34,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,343 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 31 treesize of output 57 [2018-11-23 05:13:34,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,362 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 53 treesize of output 71 [2018-11-23 05:13:34,363 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:13:34,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:23 [2018-11-23 05:13:34,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,446 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 31 treesize of output 57 [2018-11-23 05:13:34,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,464 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 53 treesize of output 71 [2018-11-23 05:13:34,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:13:34,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:23 [2018-11-23 05:13:34,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,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, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 91 [2018-11-23 05:13:34,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,650 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 82 treesize of output 104 [2018-11-23 05:13:34,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:13:34,697 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,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 27 treesize of output 33 [2018-11-23 05:13:34,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,716 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2018-11-23 05:13:34,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 76 [2018-11-23 05:13:34,886 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 87 [2018-11-23 05:13:34,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2018-11-23 05:13:34,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:34,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:51 [2018-11-23 05:13:34,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,992 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 51 treesize of output 74 [2018-11-23 05:13:34,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:34,994 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 19 [2018-11-23 05:13:34,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:53 [2018-11-23 05:13:35,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,235 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 65 treesize of output 92 [2018-11-23 05:13:35,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,252 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 05:13:35,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:13:35,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,286 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 05:13:35,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:60 [2018-11-23 05:13:35,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,452 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 74 treesize of output 95 [2018-11-23 05:13:35,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,455 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 39 treesize of output 27 [2018-11-23 05:13:35,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,478 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 05:13:35,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:69 [2018-11-23 05:13:35,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 95 [2018-11-23 05:13:35,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,564 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 05:13:35,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,592 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 05:13:35,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:69 [2018-11-23 05:13:35,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,688 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 72 treesize of output 95 [2018-11-23 05:13:35,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,691 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 05:13:35,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,716 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 05:13:35,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:69 [2018-11-23 05:13:35,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 95 [2018-11-23 05:13:35,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,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 18 [2018-11-23 05:13:35,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,825 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 05:13:35,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:69 [2018-11-23 05:13:35,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,915 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 72 treesize of output 95 [2018-11-23 05:13:35,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:35,918 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 05:13:35,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:35,940 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 05:13:35,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:69 [2018-11-23 05:13:36,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,022 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 72 treesize of output 95 [2018-11-23 05:13:36,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,026 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 05:13:36,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:36,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:36,048 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 05:13:36,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:69 [2018-11-23 05:13:36,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,132 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 72 treesize of output 108 [2018-11-23 05:13:36,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,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 43 treesize of output 26 [2018-11-23 05:13:36,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:36,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:36,160 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 05:13:36,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:65 [2018-11-23 05:13:36,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,351 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 83 treesize of output 110 [2018-11-23 05:13:36,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,365 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 45 treesize of output 56 [2018-11-23 05:13:36,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:13:36,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:36,394 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 05:13:36,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:69 [2018-11-23 05:13:36,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:36,477 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 63 treesize of output 61 [2018-11-23 05:13:36,482 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-11-23 05:13:36,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-23 05:13:36,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, 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 7 [2018-11-23 05:13:36,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:36,504 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 05:13:36,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:36,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:36,512 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 05:13:36,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2018-11-23 05:13:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:13:36,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:13:36,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 63 [2018-11-23 05:13:36,573 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:13:36,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:13:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash -440126668, now seen corresponding path program 26 times [2018-11-23 05:13:36,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:13:36,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:13:36,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:36,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:13:36,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:13:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:13:43,991 WARN L180 SmtUtils]: Spent 7.36 s on a formula simplification. DAG size of input: 306 DAG size of output: 297 [2018-11-23 05:13:44,103 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-23 05:13:44,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-23 05:13:44,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3803, Unknown=0, NotChecked=0, Total=4032 [2018-11-23 05:13:44,104 INFO L87 Difference]: Start difference. First operand 507 states and 543 transitions. cyclomatic complexity: 47 Second operand 64 states. [2018-11-23 05:13:45,748 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2018-11-23 05:13:46,202 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-23 05:13:46,670 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-11-23 05:13:47,183 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2018-11-23 05:13:52,054 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2018-11-23 05:13:54,228 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2018-11-23 05:13:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:13:54,334 INFO L93 Difference]: Finished difference Result 651 states and 705 transitions. [2018-11-23 05:13:54,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-23 05:13:54,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 651 states and 705 transitions. [2018-11-23 05:13:54,336 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 231 [2018-11-23 05:13:54,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 651 states to 649 states and 703 transitions. [2018-11-23 05:13:54,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2018-11-23 05:13:54,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2018-11-23 05:13:54,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 649 states and 703 transitions. [2018-11-23 05:13:54,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:13:54,337 INFO L705 BuchiCegarLoop]: Abstraction has 649 states and 703 transitions. [2018-11-23 05:13:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states and 703 transitions. [2018-11-23 05:13:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2018-11-23 05:13:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-11-23 05:13:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 683 transitions. [2018-11-23 05:13:54,343 INFO L728 BuchiCegarLoop]: Abstraction has 629 states and 683 transitions. [2018-11-23 05:13:54,343 INFO L608 BuchiCegarLoop]: Abstraction has 629 states and 683 transitions. [2018-11-23 05:13:54,343 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-23 05:13:54,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 629 states and 683 transitions. [2018-11-23 05:13:54,345 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 231 [2018-11-23 05:13:54,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:13:54,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:13:54,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 20, 18, 2, 1, 1, 1, 1] [2018-11-23 05:13:54,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 10, 1] [2018-11-23 05:13:54,345 INFO L794 eck$LassoCheckResult]: Stem: 22936#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 22934#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 22935#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 22937#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 22942#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 22974#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 22973#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 22972#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 22971#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 22970#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 22969#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 22968#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 22967#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 22965#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 22964#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 22963#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 22953#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 22955#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 22966#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 22961#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 22962#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23170#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23168#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23169#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23476#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23473#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23471#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23469#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 23468#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23467#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23466#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23465#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23464#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23463#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23462#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23461#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23460#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23459#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23458#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23457#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23455#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23454#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23453#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23451#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23448#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23446#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23444#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23443#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23441#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23440#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23439#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23437#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23435#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23433#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23431#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23429#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23427#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23425#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23423#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23421#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23419#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23417#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23324#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23305#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 22943#L556-2 [2018-11-23 05:13:54,346 INFO L796 eck$LassoCheckResult]: Loop: 22943#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 22944#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23302#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23414#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23412#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23410#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23408#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23406#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23404#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23400#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23395#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23390#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23385#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23381#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23377#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23373#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23370#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23368#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23366#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23365#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23357#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23353#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23346#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23343#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23340#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23337#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23334#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23331#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23328#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23325#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 23321#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 23319#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 23316#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 22943#L556-2 [2018-11-23 05:13:54,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:13:54,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2121628269, now seen corresponding path program 30 times [2018-11-23 05:13:54,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:13:54,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:13:54,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:54,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:13:54,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:13:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 7 proven. 560 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:13:55,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:13:55,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:13:55,463 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:13:56,283 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-11-23 05:13:56,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:13:56,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:13:56,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,305 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:13:56,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-23 05:13:56,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:13:56,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,328 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 05:13:56,328 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:13:56,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,352 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 38 [2018-11-23 05:13:56,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,357 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 30 [2018-11-23 05:13:56,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:56,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,398 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 38 [2018-11-23 05:13:56,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,400 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 30 [2018-11-23 05:13:56,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:56,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,435 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 38 [2018-11-23 05:13:56,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,439 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 30 [2018-11-23 05:13:56,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:56,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,480 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 38 [2018-11-23 05:13:56,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-23 05:13:56,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:56,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,539 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 38 [2018-11-23 05:13:56,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,542 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 30 [2018-11-23 05:13:56,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:56,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,588 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 38 [2018-11-23 05:13:56,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,594 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 30 [2018-11-23 05:13:56,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:13:56,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,698 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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:13:56,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,700 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 43 treesize of output 43 [2018-11-23 05:13:56,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:64, output treesize:35 [2018-11-23 05:13:56,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:13:56,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, 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 21 [2018-11-23 05:13:56,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:13:56,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,855 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:13:56,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,858 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 7 [2018-11-23 05:13:56,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:13:56,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,918 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:13:56,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,920 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 7 [2018-11-23 05:13:56,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:13:56,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,980 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:13:56,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:56,982 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 7 [2018-11-23 05:13:56,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:56,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:13:57,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,133 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 1 case distinctions, treesize of input 63 treesize of output 72 [2018-11-23 05:13:57,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,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, 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 16 [2018-11-23 05:13:57,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,149 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 05:13:57,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-11-23 05:13:57,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,203 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:13:57,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,205 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 7 [2018-11-23 05:13:57,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,219 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 05:13:57,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:13:57,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:13:57,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,278 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 7 [2018-11-23 05:13:57,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,294 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 05:13:57,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:13:57,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,364 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:13:57,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,367 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 7 [2018-11-23 05:13:57,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,385 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 05:13:57,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:13:57,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,471 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:13:57,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,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 28 treesize of output 7 [2018-11-23 05:13:57,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,489 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 05:13:57,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:13:57,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:13:57,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,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 28 treesize of output 7 [2018-11-23 05:13:57,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,579 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 05:13:57,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:13:57,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,642 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:13:57,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,645 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 7 [2018-11-23 05:13:57,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,663 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 05:13:57,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:13:57,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,808 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 1 case distinctions, treesize of input 70 treesize of output 79 [2018-11-23 05:13:57,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,811 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 37 treesize of output 15 [2018-11-23 05:13:57,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,827 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 05:13:57,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2018-11-23 05:13:57,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 05:13:57,895 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 53 treesize of output 46 [2018-11-23 05:13:57,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,919 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 49 treesize of output 43 [2018-11-23 05:13:57,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 05:13:57,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:13:57,941 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 05:13:57,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,953 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 25 treesize of output 18 [2018-11-23 05:13:57,953 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 05:13:57,963 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:13:57,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:13:57,980 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:71, output treesize:7 [2018-11-23 05:13:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:13:58,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:13:58,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 50 [2018-11-23 05:13:58,052 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:13:58,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:13:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash -440126668, now seen corresponding path program 27 times [2018-11-23 05:13:58,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:13:58,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:13:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:58,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:13:58,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:13:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:13:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:05,435 WARN L180 SmtUtils]: Spent 7.33 s on a formula simplification. DAG size of input: 306 DAG size of output: 297 [2018-11-23 05:14:05,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 05:14:05,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2413, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 05:14:05,539 INFO L87 Difference]: Start difference. First operand 629 states and 683 transitions. cyclomatic complexity: 66 Second operand 51 states. [2018-11-23 05:14:09,368 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2018-11-23 05:14:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:10,930 INFO L93 Difference]: Finished difference Result 568 states and 617 transitions. [2018-11-23 05:14:10,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 05:14:10,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 568 states and 617 transitions. [2018-11-23 05:14:10,931 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 168 [2018-11-23 05:14:10,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 568 states to 505 states and 548 transitions. [2018-11-23 05:14:10,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2018-11-23 05:14:10,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2018-11-23 05:14:10,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 505 states and 548 transitions. [2018-11-23 05:14:10,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:14:10,932 INFO L705 BuchiCegarLoop]: Abstraction has 505 states and 548 transitions. [2018-11-23 05:14:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states and 548 transitions. [2018-11-23 05:14:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2018-11-23 05:14:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-11-23 05:14:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 548 transitions. [2018-11-23 05:14:10,938 INFO L728 BuchiCegarLoop]: Abstraction has 505 states and 548 transitions. [2018-11-23 05:14:10,938 INFO L608 BuchiCegarLoop]: Abstraction has 505 states and 548 transitions. [2018-11-23 05:14:10,938 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-23 05:14:10,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 505 states and 548 transitions. [2018-11-23 05:14:10,939 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 168 [2018-11-23 05:14:10,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:14:10,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:14:10,940 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [21, 21, 19, 2, 1, 1, 1, 1] [2018-11-23 05:14:10,940 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 1] [2018-11-23 05:14:10,940 INFO L794 eck$LassoCheckResult]: Stem: 24476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 24474#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 24475#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 24477#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 24482#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24519#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24518#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24517#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24516#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24515#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24514#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24513#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24512#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24510#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24498#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24499#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24493#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24494#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24658#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 24657#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24656#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24655#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24654#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24653#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24652#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24651#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24650#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24649#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24648#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24647#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24646#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24645#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24644#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24643#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24642#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24641#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24640#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24639#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24638#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24637#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24636#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24635#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24634#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24633#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24632#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24631#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24630#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24629#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24628#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24627#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24626#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24625#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24624#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24623#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24622#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24621#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24618#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24616#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24614#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24612#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24610#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24607#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24608#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24760#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24759#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24756#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24751#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 24749#L556-2 [2018-11-23 05:14:10,940 INFO L796 eck$LassoCheckResult]: Loop: 24749#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24792#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24791#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24790#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24789#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24788#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24787#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24786#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24785#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24771#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24767#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24766#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24765#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24764#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24763#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24748#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24762#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24761#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 24754#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 24758#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 24753#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 24749#L556-2 [2018-11-23 05:14:10,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:10,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2045278894, now seen corresponding path program 31 times [2018-11-23 05:14:10,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:10,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:10,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:10,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:10,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 7 proven. 497 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-23 05:14:11,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:11,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:11,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:11,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:11,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:11,818 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 15 treesize of output 27 [2018-11-23 05:14:11,820 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 23 treesize of output 15 [2018-11-23 05:14:11,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2018-11-23 05:14:11,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:11,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:11,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:11,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, 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 05:14:11,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,875 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 17 treesize of output 19 [2018-11-23 05:14:11,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:14:11,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,885 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 05:14:11,885 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:26 [2018-11-23 05:14:11,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:11,923 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 31 treesize of output 38 [2018-11-23 05:14:11,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:11,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, 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 30 [2018-11-23 05:14:11,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:26 [2018-11-23 05:14:11,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:11,973 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 31 treesize of output 38 [2018-11-23 05:14:11,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:11,976 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 30 [2018-11-23 05:14:11,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:11,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:26 [2018-11-23 05:14:12,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,025 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 31 treesize of output 38 [2018-11-23 05:14:12,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,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 34 treesize of output 30 [2018-11-23 05:14:12,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:26 [2018-11-23 05:14:12,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,115 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 42 treesize of output 55 [2018-11-23 05:14:12,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,118 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 43 treesize of output 43 [2018-11-23 05:14:12,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:39 [2018-11-23 05:14:12,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-11-23 05:14:12,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, 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 21 [2018-11-23 05:14:12,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:12,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 05:14:12,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,287 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 7 [2018-11-23 05:14:12,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:12,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,348 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 51 treesize of output 66 [2018-11-23 05:14:12,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,351 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 7 [2018-11-23 05:14:12,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:12,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,414 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 51 treesize of output 66 [2018-11-23 05:14:12,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-23 05:14:12,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:12,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 05:14:12,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,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, 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 7 [2018-11-23 05:14:12,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:12,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,548 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 51 treesize of output 66 [2018-11-23 05:14:12,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,551 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 7 [2018-11-23 05:14:12,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:12,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,617 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 51 treesize of output 66 [2018-11-23 05:14:12,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,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 28 treesize of output 7 [2018-11-23 05:14:12,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:12,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,688 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 51 treesize of output 66 [2018-11-23 05:14:12,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,690 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 7 [2018-11-23 05:14:12,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:12,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,760 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 51 treesize of output 66 [2018-11-23 05:14:12,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,762 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 7 [2018-11-23 05:14:12,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:12,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,833 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 51 treesize of output 66 [2018-11-23 05:14:12,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,837 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 7 [2018-11-23 05:14:12,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:12,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,908 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 51 treesize of output 66 [2018-11-23 05:14:12,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:12,911 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 7 [2018-11-23 05:14:12,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:12,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:46 [2018-11-23 05:14:13,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:13,088 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 63 treesize of output 76 [2018-11-23 05:14:13,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:13,091 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 38 treesize of output 16 [2018-11-23 05:14:13,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:75, output treesize:54 [2018-11-23 05:14:13,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:13,287 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 71 treesize of output 84 [2018-11-23 05:14:13,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:13,290 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 38 treesize of output 16 [2018-11-23 05:14:13,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:62 [2018-11-23 05:14:13,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:13,440 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 67 treesize of output 82 [2018-11-23 05:14:13,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:13,442 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 7 [2018-11-23 05:14:13,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,462 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 05:14:13,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:62 [2018-11-23 05:14:13,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:13,526 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 67 treesize of output 82 [2018-11-23 05:14:13,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:13,529 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 7 [2018-11-23 05:14:13,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,549 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 05:14:13,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:62 [2018-11-23 05:14:13,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:13,678 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 78 treesize of output 91 [2018-11-23 05:14:13,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:13,681 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 37 treesize of output 15 [2018-11-23 05:14:13,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,704 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 05:14:13,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:69 [2018-11-23 05:14:13,771 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 71 treesize of output 63 [2018-11-23 05:14:13,773 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 05:14:13,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,786 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 05:14:13,786 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 05:14:13,795 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 05:14:13,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:13,804 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:83, output treesize:7 [2018-11-23 05:14:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:13,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:13,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 32] total 55 [2018-11-23 05:14:13,881 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:14:13,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:13,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1697306636, now seen corresponding path program 28 times [2018-11-23 05:14:13,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:13,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:13,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:13,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:14:13,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:15,069 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 206 DAG size of output: 201 [2018-11-23 05:14:15,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 05:14:15,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2898, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 05:14:15,141 INFO L87 Difference]: Start difference. First operand 505 states and 548 transitions. cyclomatic complexity: 52 Second operand 56 states. [2018-11-23 05:14:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:14:20,741 INFO L93 Difference]: Finished difference Result 464 states and 501 transitions. [2018-11-23 05:14:20,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-23 05:14:20,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 464 states and 501 transitions. [2018-11-23 05:14:20,742 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 147 [2018-11-23 05:14:20,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 464 states to 405 states and 441 transitions. [2018-11-23 05:14:20,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2018-11-23 05:14:20,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234 [2018-11-23 05:14:20,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 405 states and 441 transitions. [2018-11-23 05:14:20,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:14:20,744 INFO L705 BuchiCegarLoop]: Abstraction has 405 states and 441 transitions. [2018-11-23 05:14:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states and 441 transitions. [2018-11-23 05:14:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2018-11-23 05:14:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-11-23 05:14:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 441 transitions. [2018-11-23 05:14:20,748 INFO L728 BuchiCegarLoop]: Abstraction has 405 states and 441 transitions. [2018-11-23 05:14:20,748 INFO L608 BuchiCegarLoop]: Abstraction has 405 states and 441 transitions. [2018-11-23 05:14:20,748 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2018-11-23 05:14:20,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 405 states and 441 transitions. [2018-11-23 05:14:20,749 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 147 [2018-11-23 05:14:20,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:14:20,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:14:20,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [21, 21, 19, 2, 1, 1, 1, 1] [2018-11-23 05:14:20,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 10, 1] [2018-11-23 05:14:20,750 INFO L794 eck$LassoCheckResult]: Stem: 25822#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 25820#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 25821#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 25823#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 25828#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25866#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25865#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25864#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25863#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25862#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25861#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25860#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25859#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25858#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25857#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25856#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25855#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25854#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25853#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25851#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25850#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25849#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25838#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25839#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25852#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25847#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25848#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25841#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25842#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25843#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25844#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25845#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25846#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26219#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 26217#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26215#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26213#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26211#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26209#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26207#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26205#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26203#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26201#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26199#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26197#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26195#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26193#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26191#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26189#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26187#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26185#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26183#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26181#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26179#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26177#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26175#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26174#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26173#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26171#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26169#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26167#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26101#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25876#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26098#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25875#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25877#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25824#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 25825#L556-2 [2018-11-23 05:14:20,750 INFO L796 eck$LassoCheckResult]: Loop: 25825#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 25829#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25872#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26091#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26090#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26031#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26030#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26029#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26028#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26027#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26026#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26025#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26024#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26023#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26022#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26021#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26020#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26019#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26018#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26017#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26016#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26015#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26014#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26013#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26012#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26011#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26010#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 26009#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26007#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 26008#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 25880#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 26097#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 25879#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 25825#L556-2 [2018-11-23 05:14:20,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash -183185686, now seen corresponding path program 32 times [2018-11-23 05:14:20,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:20,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:20,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:20,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:20,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:14:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 99 proven. 531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:21,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:14:21,603 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:14:21,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:14:21,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:14:21,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:14:21,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:14:21,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,670 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:14:21,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,674 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:14:21,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,694 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 33 treesize of output 30 [2018-11-23 05:14:21,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 14 treesize of output 13 [2018-11-23 05:14:21,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,715 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 33 treesize of output 30 [2018-11-23 05:14:21,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:14:21,717 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,721 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:21,733 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2018-11-23 05:14:21,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,774 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 49 [2018-11-23 05:14:21,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,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 34 treesize of output 30 [2018-11-23 05:14:21,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,801 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 49 [2018-11-23 05:14:21,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,804 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 30 [2018-11-23 05:14:21,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:21,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:14:21,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,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, 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 49 [2018-11-23 05:14:21,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,867 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 30 [2018-11-23 05:14:21,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,893 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 49 [2018-11-23 05:14:21,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,895 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 30 [2018-11-23 05:14:21,895 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:21,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:14:21,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,959 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 49 [2018-11-23 05:14:21,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,962 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 30 [2018-11-23 05:14:21,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,987 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 49 [2018-11-23 05:14:21,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:21,989 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 30 [2018-11-23 05:14:21,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:21,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:22,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:14:22,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,056 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 49 [2018-11-23 05:14:22,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,058 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 30 [2018-11-23 05:14:22,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,084 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 49 [2018-11-23 05:14:22,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,086 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 30 [2018-11-23 05:14:22,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:22,106 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:14:22,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,154 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 49 [2018-11-23 05:14:22,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,157 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 30 [2018-11-23 05:14:22,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,181 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 49 [2018-11-23 05:14:22,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,184 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 30 [2018-11-23 05:14:22,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:22,203 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:14:22,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,253 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 49 [2018-11-23 05:14:22,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,255 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 30 [2018-11-23 05:14:22,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,281 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 49 [2018-11-23 05:14:22,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,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 34 treesize of output 30 [2018-11-23 05:14:22,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:22,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:14:22,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,357 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 49 [2018-11-23 05:14:22,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,360 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 30 [2018-11-23 05:14:22,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,386 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 49 [2018-11-23 05:14:22,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,388 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 30 [2018-11-23 05:14:22,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:22,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:14:22,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,462 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 49 [2018-11-23 05:14:22,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,465 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 30 [2018-11-23 05:14:22,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,490 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 49 [2018-11-23 05:14:22,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,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 34 treesize of output 30 [2018-11-23 05:14:22,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:22,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:14:22,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,630 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 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:14:22,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,633 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 43 treesize of output 43 [2018-11-23 05:14:22,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,668 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 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:14:22,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,671 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 43 treesize of output 43 [2018-11-23 05:14:22,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:22,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:85 [2018-11-23 05:14:22,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,773 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 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:14:22,775 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 18 [2018-11-23 05:14:22,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:22,808 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 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:14:22,809 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 18 [2018-11-23 05:14:22,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:22,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:22,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:73 [2018-11-23 05:14:23,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,008 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:14:23,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,011 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 38 treesize of output 16 [2018-11-23 05:14:23,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,024 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 05:14:23,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:36 [2018-11-23 05:14:23,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,076 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:14:23,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,078 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 7 [2018-11-23 05:14:23,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,090 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 05:14:23,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:14:23,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:14:23,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,144 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 7 [2018-11-23 05:14:23,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,156 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 05:14:23,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:14:23,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,209 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:14:23,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,212 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 7 [2018-11-23 05:14:23,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,225 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 05:14:23,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:14:23,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:14:23,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,282 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 7 [2018-11-23 05:14:23,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,295 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 05:14:23,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:14:23,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,351 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:14:23,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,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, 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 7 [2018-11-23 05:14:23,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,367 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 05:14:23,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:14:23,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:14:23,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-23 05:14:23,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,441 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 05:14:23,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:14:23,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:14:23,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,503 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 7 [2018-11-23 05:14:23,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,516 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 05:14:23,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:14:23,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,576 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:14:23,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-23 05:14:23,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,592 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 05:14:23,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:14:23,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,652 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:14:23,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,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 28 treesize of output 7 [2018-11-23 05:14:23,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,669 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 05:14:23,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:36 [2018-11-23 05:14:23,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2018-11-23 05:14:23,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:14:23,733 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-11-23 05:14:23,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,755 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 11 [2018-11-23 05:14:23,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,769 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 34 treesize of output 27 [2018-11-23 05:14:23,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,781 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 05:14:23,782 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,793 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 05:14:23,793 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:14:23,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:14:23,813 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:50, output treesize:7 [2018-11-23 05:14:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:14:23,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:14:23,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2018-11-23 05:14:23,883 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:14:23,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:14:23,883 INFO L82 PathProgramCache]: Analyzing trace with hash -440126668, now seen corresponding path program 29 times [2018-11-23 05:14:23,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:14:23,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:14:23,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:23,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:14:23,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:14:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:14:31,527 WARN L180 SmtUtils]: Spent 7.59 s on a formula simplification. DAG size of input: 306 DAG size of output: 297 [2018-11-23 05:14:31,650 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-23 05:14:31,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 05:14:31,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 05:14:31,650 INFO L87 Difference]: Start difference. First operand 405 states and 441 transitions. cyclomatic complexity: 43 Second operand 56 states. [2018-11-23 05:14:45,668 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2018-11-23 05:14:57,838 WARN L180 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-11-23 05:15:09,960 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-11-23 05:15:22,084 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-11-23 05:15:34,207 WARN L180 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-11-23 05:15:46,352 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-11-23 05:15:58,467 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-11-23 05:16:10,615 WARN L180 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-11-23 05:16:22,759 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2018-11-23 05:16:34,918 WARN L180 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2018-11-23 05:16:37,385 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2018-11-23 05:16:49,695 WARN L180 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2018-11-23 05:17:02,016 WARN L180 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2018-11-23 05:17:14,190 WARN L180 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2018-11-23 05:17:26,428 WARN L180 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2018-11-23 05:17:38,585 WARN L180 SmtUtils]: Spent 12.03 s on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2018-11-23 05:17:50,785 WARN L180 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2018-11-23 05:17:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:50,967 INFO L93 Difference]: Finished difference Result 500 states and 540 transitions. [2018-11-23 05:17:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-23 05:17:50,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 540 transitions. [2018-11-23 05:17:50,968 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 183 [2018-11-23 05:17:50,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 496 states and 536 transitions. [2018-11-23 05:17:50,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 277 [2018-11-23 05:17:50,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2018-11-23 05:17:50,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 496 states and 536 transitions. [2018-11-23 05:17:50,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:17:50,969 INFO L705 BuchiCegarLoop]: Abstraction has 496 states and 536 transitions. [2018-11-23 05:17:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states and 536 transitions. [2018-11-23 05:17:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 449. [2018-11-23 05:17:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-23 05:17:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 487 transitions. [2018-11-23 05:17:50,972 INFO L728 BuchiCegarLoop]: Abstraction has 449 states and 487 transitions. [2018-11-23 05:17:50,972 INFO L608 BuchiCegarLoop]: Abstraction has 449 states and 487 transitions. [2018-11-23 05:17:50,972 INFO L442 BuchiCegarLoop]: ======== Iteration 35============ [2018-11-23 05:17:50,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 487 transitions. [2018-11-23 05:17:50,973 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 183 [2018-11-23 05:17:50,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:17:50,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:17:50,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [21, 21, 19, 2, 1, 1, 1, 1] [2018-11-23 05:17:50,974 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 12, 11, 1] [2018-11-23 05:17:50,974 INFO L794 eck$LassoCheckResult]: Stem: 27114#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 27112#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 27113#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 27115#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 27120#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27154#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27153#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27152#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27151#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27150#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27149#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27148#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27147#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27146#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27145#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27144#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27143#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27142#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27141#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27139#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27138#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27137#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27129#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27131#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27140#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27135#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27136#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27533#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27532#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27531#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27530#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 27529#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27528#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27527#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27526#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27525#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27524#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27523#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27502#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27501#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27499#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27497#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27495#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27493#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27491#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27489#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27487#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27485#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27482#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27479#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27476#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27473#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27470#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27467#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27464#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27461#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27458#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27456#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27454#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27452#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27450#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27448#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27446#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27444#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27442#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27394#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27522#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 27392#L556-2 [2018-11-23 05:17:50,974 INFO L796 eck$LassoCheckResult]: Loop: 27392#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27381#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27382#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27521#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27123#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27124#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27380#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27500#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27498#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27496#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27494#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27492#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27490#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27488#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27486#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27484#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27481#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27478#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27475#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27472#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27469#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27466#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27463#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27460#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27457#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27455#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27453#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27451#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27449#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27447#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27445#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27443#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27441#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 27439#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 27437#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 27435#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 27392#L556-2 [2018-11-23 05:17:50,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:50,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1574638162, now seen corresponding path program 33 times [2018-11-23 05:17:50,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:50,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:50,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:50,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:50,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 1 proven. 626 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:17:52,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:17:52,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:17:52,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:17:53,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-23 05:17:53,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:17:53,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:53,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,346 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:17:53,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,355 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 17 treesize of output 19 [2018-11-23 05:17:53,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:17:53,356 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,359 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,362 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 05:17:53,362 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:17:53,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,386 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 38 [2018-11-23 05:17:53,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,388 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 30 [2018-11-23 05:17:53,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:17:53,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,417 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 38 [2018-11-23 05:17:53,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,420 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 30 [2018-11-23 05:17:53,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:17:53,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,450 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 38 [2018-11-23 05:17:53,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,452 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 30 [2018-11-23 05:17:53,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:17:53,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,484 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 38 [2018-11-23 05:17:53,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,487 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 30 [2018-11-23 05:17:53,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:22 [2018-11-23 05:17:53,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,557 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 38 [2018-11-23 05:17:53,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,560 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 30 [2018-11-23 05:17:53,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:22 [2018-11-23 05:17:53,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,638 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 38 [2018-11-23 05:17:53,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,641 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 30 [2018-11-23 05:17:53,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:22 [2018-11-23 05:17:53,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,730 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 38 [2018-11-23 05:17:53,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,732 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 30 [2018-11-23 05:17:53,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:22 [2018-11-23 05:17:53,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:17:53,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:53,878 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 43 treesize of output 43 [2018-11-23 05:17:53,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:53,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:35 [2018-11-23 05:17:54,012 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 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:17:54,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, 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 21 [2018-11-23 05:17:54,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:17:54,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,100 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:17:54,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,104 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 7 [2018-11-23 05:17:54,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:17:54,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,193 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:17:54,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,196 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 7 [2018-11-23 05:17:54,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:17:54,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,382 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 1 case distinctions, treesize of input 63 treesize of output 72 [2018-11-23 05:17:54,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,388 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 38 treesize of output 16 [2018-11-23 05:17:54,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,408 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 05:17:54,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:50 [2018-11-23 05:17:54,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,495 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:17:54,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,500 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 7 [2018-11-23 05:17:54,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,520 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 05:17:54,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:17:54,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,616 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:17:54,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,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 28 treesize of output 7 [2018-11-23 05:17:54,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,643 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 05:17:54,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:17:54,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,727 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:17:54,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,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 28 treesize of output 7 [2018-11-23 05:17:54,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,748 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 05:17:54,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:17:54,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,831 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:17:54,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,836 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 7 [2018-11-23 05:17:54,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,856 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 05:17:54,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:17:54,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,946 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:17:54,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:54,949 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 7 [2018-11-23 05:17:54,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:54,968 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 05:17:54,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:17:55,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:55,046 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:17:55,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:55,049 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 7 [2018-11-23 05:17:55,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,065 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 05:17:55,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:17:55,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:55,146 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 1 case distinctions, treesize of input 59 treesize of output 70 [2018-11-23 05:17:55,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:55,148 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 7 [2018-11-23 05:17:55,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,174 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 05:17:55,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-11-23 05:17:55,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:55,334 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 1 case distinctions, treesize of input 70 treesize of output 79 [2018-11-23 05:17:55,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:55,338 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 37 treesize of output 15 [2018-11-23 05:17:55,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,359 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 05:17:55,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2018-11-23 05:17:55,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-11-23 05:17:55,457 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 53 treesize of output 46 [2018-11-23 05:17:55,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:55,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:55,488 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-11-23 05:17:55,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-11-23 05:17:55,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 05:17:55,536 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 05:17:55,536 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,549 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 11 [2018-11-23 05:17:55,549 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:17:55,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:55,584 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:71, output treesize:7 [2018-11-23 05:17:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:17:55,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:17:55,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 50 [2018-11-23 05:17:55,680 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:17:55,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:55,681 INFO L82 PathProgramCache]: Analyzing trace with hash 721544771, now seen corresponding path program 30 times [2018-11-23 05:17:55,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:17:55,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:17:55,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:55,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:55,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:17:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:17:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:18:08,697 WARN L180 SmtUtils]: Spent 12.95 s on a formula simplification. DAG size of input: 331 DAG size of output: 321 [2018-11-23 05:18:08,806 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-11-23 05:18:08,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 05:18:08,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2430, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 05:18:08,807 INFO L87 Difference]: Start difference. First operand 449 states and 487 transitions. cyclomatic complexity: 47 Second operand 51 states. [2018-11-23 05:18:12,697 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-11-23 05:18:12,904 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-11-23 05:18:13,103 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2018-11-23 05:18:13,317 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2018-11-23 05:18:13,540 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2018-11-23 05:18:13,751 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2018-11-23 05:18:13,976 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2018-11-23 05:18:14,227 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2018-11-23 05:18:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:18:15,852 INFO L93 Difference]: Finished difference Result 363 states and 389 transitions. [2018-11-23 05:18:15,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 05:18:15,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 389 transitions. [2018-11-23 05:18:15,853 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2018-11-23 05:18:15,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 294 states and 312 transitions. [2018-11-23 05:18:15,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2018-11-23 05:18:15,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2018-11-23 05:18:15,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 312 transitions. [2018-11-23 05:18:15,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:18:15,854 INFO L705 BuchiCegarLoop]: Abstraction has 294 states and 312 transitions. [2018-11-23 05:18:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 312 transitions. [2018-11-23 05:18:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2018-11-23 05:18:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-23 05:18:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 310 transitions. [2018-11-23 05:18:15,857 INFO L728 BuchiCegarLoop]: Abstraction has 292 states and 310 transitions. [2018-11-23 05:18:15,857 INFO L608 BuchiCegarLoop]: Abstraction has 292 states and 310 transitions. [2018-11-23 05:18:15,857 INFO L442 BuchiCegarLoop]: ======== Iteration 36============ [2018-11-23 05:18:15,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 310 transitions. [2018-11-23 05:18:15,858 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2018-11-23 05:18:15,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:18:15,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:18:15,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 20, 2, 1, 1, 1, 1] [2018-11-23 05:18:15,858 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 12, 11, 1] [2018-11-23 05:18:15,858 INFO L794 eck$LassoCheckResult]: Stem: 28280#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 28278#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 28279#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 28281#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 28286#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28325#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28324#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28323#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28322#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28321#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28320#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28319#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28318#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28317#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28316#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28314#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28312#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28310#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28308#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28307#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28306#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28305#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28298#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28299#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28315#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28313#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28311#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28309#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28303#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28302#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28300#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28301#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28304#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28294#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 28295#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28471#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28469#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28467#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28465#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28463#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28461#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28459#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28457#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28455#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28453#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28451#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28449#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28447#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28445#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28443#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28442#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28441#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28439#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28437#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28435#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28433#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28431#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28429#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28427#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28425#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28423#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28421#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28420#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28418#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28416#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28334#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28413#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28332#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28333#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28282#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 28283#L556-2 [2018-11-23 05:18:15,859 INFO L796 eck$LassoCheckResult]: Loop: 28283#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28287#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28290#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28326#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28568#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28567#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28566#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28565#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28564#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28562#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28561#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28508#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28507#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28506#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28505#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28503#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28504#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28549#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28547#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28545#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28543#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28541#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28539#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28538#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28537#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28535#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28533#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28532#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28531#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28529#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28527#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28525#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28524#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 28337#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 28335#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 28336#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 28283#L556-2 [2018-11-23 05:18:15,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:18:15,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1618618061, now seen corresponding path program 34 times [2018-11-23 05:18:15,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:18:15,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:18:15,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:18:15,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:18:15,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:18:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 28 proven. 665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:18:17,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:18:17,140 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:18:17,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:18:17,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:18:17,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:18:17,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:18:17,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,221 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:18:17,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,235 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 17 treesize of output 19 [2018-11-23 05:18:17,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:18:17,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,250 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 05:18:17,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 05:18:17,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,303 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 38 [2018-11-23 05:18:17,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,305 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 30 [2018-11-23 05:18:17,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:18:17,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,354 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 38 [2018-11-23 05:18:17,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,356 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 30 [2018-11-23 05:18:17,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:18:17,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,405 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 38 [2018-11-23 05:18:17,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,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, 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 30 [2018-11-23 05:18:17,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:18:17,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,460 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 38 [2018-11-23 05:18:17,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,462 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 30 [2018-11-23 05:18:17,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:18:17,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,513 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 38 [2018-11-23 05:18:17,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,515 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 30 [2018-11-23 05:18:17,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:18:17,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,566 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 38 [2018-11-23 05:18:17,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,568 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 30 [2018-11-23 05:18:17,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:18:17,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,621 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 38 [2018-11-23 05:18:17,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,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 34 treesize of output 30 [2018-11-23 05:18:17,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:18:17,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,675 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 38 [2018-11-23 05:18:17,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,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 34 treesize of output 30 [2018-11-23 05:18:17,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:22 [2018-11-23 05:18:17,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,780 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 1 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 05:18:17,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,783 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 43 treesize of output 43 [2018-11-23 05:18:17,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2018-11-23 05:18:17,899 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 1 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 05:18:17,901 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 21 [2018-11-23 05:18:17,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:18:17,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,972 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 1 case distinctions, treesize of input 51 treesize of output 62 [2018-11-23 05:18:17,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:17,975 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 7 [2018-11-23 05:18:17,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:17,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:42 [2018-11-23 05:18:18,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:18,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 72 [2018-11-23 05:18:18,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:18,169 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 38 treesize of output 16 [2018-11-23 05:18:18,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:50 [2018-11-23 05:18:18,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:18,381 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 1 case distinctions, treesize of input 71 treesize of output 80 [2018-11-23 05:18:18,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:18,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16 [2018-11-23 05:18:18,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:79, output treesize:58 [2018-11-23 05:18:18,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:18,600 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 1 case distinctions, treesize of input 79 treesize of output 88 [2018-11-23 05:18:18,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:18,602 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 38 treesize of output 16 [2018-11-23 05:18:18,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:66 [2018-11-23 05:18:18,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:18,833 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 1 case distinctions, treesize of input 87 treesize of output 96 [2018-11-23 05:18:18,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:18,837 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 38 treesize of output 16 [2018-11-23 05:18:18,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:18,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:95, output treesize:74 [2018-11-23 05:18:19,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:19,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 104 [2018-11-23 05:18:19,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:19,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, 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 16 [2018-11-23 05:18:19,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:19,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:19,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:19,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:103, output treesize:82 [2018-11-23 05:18:19,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:19,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 112 [2018-11-23 05:18:19,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:19,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, 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 16 [2018-11-23 05:18:19,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:19,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:19,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:19,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:90 [2018-11-23 05:18:19,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:19,653 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 1 case distinctions, treesize of input 111 treesize of output 120 [2018-11-23 05:18:19,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:19,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16 [2018-11-23 05:18:19,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:19,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:19,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:19,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:119, output treesize:98 [2018-11-23 05:18:19,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:19,994 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 1 case distinctions, treesize of input 119 treesize of output 128 [2018-11-23 05:18:19,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:19,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16 [2018-11-23 05:18:19,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:20,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:20,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:20,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:127, output treesize:106 [2018-11-23 05:18:20,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:20,322 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 1 case distinctions, treesize of input 127 treesize of output 136 [2018-11-23 05:18:20,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:20,325 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 38 treesize of output 16 [2018-11-23 05:18:20,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:20,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:20,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:20,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:135, output treesize:114 [2018-11-23 05:18:20,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:20,684 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 1 case distinctions, treesize of input 146 treesize of output 153 [2018-11-23 05:18:20,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:20,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2018-11-23 05:18:20,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:20,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:20,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:20,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:154, output treesize:129 [2018-11-23 05:18:20,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 115 [2018-11-23 05:18:20,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 103 [2018-11-23 05:18:20,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:21,020 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 05:18:21,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:21,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 87 treesize of output 80 [2018-11-23 05:18:21,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:21,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, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 56 [2018-11-23 05:18:21,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:21,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:21,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:21,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 68 [2018-11-23 05:18:21,360 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:21,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:21,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:21,399 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:143, output treesize:7 [2018-11-23 05:18:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:18:21,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:18:21,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 48] total 78 [2018-11-23 05:18:21,497 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:18:21,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:18:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash 721544771, now seen corresponding path program 31 times [2018-11-23 05:18:21,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:18:21,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:18:21,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:18:21,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:18:21,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:18:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:18:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:18:32,759 WARN L180 SmtUtils]: Spent 11.20 s on a formula simplification. DAG size of input: 331 DAG size of output: 321 [2018-11-23 05:18:32,913 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-11-23 05:18:32,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-11-23 05:18:32,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=712, Invalid=5450, Unknown=0, NotChecked=0, Total=6162 [2018-11-23 05:18:32,914 INFO L87 Difference]: Start difference. First operand 292 states and 310 transitions. cyclomatic complexity: 24 Second operand 79 states. [2018-11-23 05:18:34,175 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2018-11-23 05:18:34,560 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2018-11-23 05:18:34,947 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2018-11-23 05:18:35,378 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2018-11-23 05:18:35,862 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-11-23 05:18:39,803 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 91 [2018-11-23 05:18:40,133 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2018-11-23 05:18:40,432 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 77 [2018-11-23 05:18:40,659 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2018-11-23 05:18:40,942 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 74 [2018-11-23 05:18:41,145 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2018-11-23 05:18:41,392 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 70 [2018-11-23 05:18:41,582 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2018-11-23 05:18:41,829 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 68 [2018-11-23 05:18:41,996 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2018-11-23 05:18:42,215 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 64 [2018-11-23 05:18:42,363 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2018-11-23 05:18:42,548 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 60 [2018-11-23 05:18:42,832 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2018-11-23 05:18:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:18:43,390 INFO L93 Difference]: Finished difference Result 392 states and 411 transitions. [2018-11-23 05:18:43,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-11-23 05:18:43,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 392 states and 411 transitions. [2018-11-23 05:18:43,391 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2018-11-23 05:18:43,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 392 states to 368 states and 387 transitions. [2018-11-23 05:18:43,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2018-11-23 05:18:43,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2018-11-23 05:18:43,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 387 transitions. [2018-11-23 05:18:43,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:18:43,392 INFO L705 BuchiCegarLoop]: Abstraction has 368 states and 387 transitions. [2018-11-23 05:18:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 387 transitions. [2018-11-23 05:18:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 334. [2018-11-23 05:18:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-23 05:18:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 353 transitions. [2018-11-23 05:18:43,395 INFO L728 BuchiCegarLoop]: Abstraction has 334 states and 353 transitions. [2018-11-23 05:18:43,395 INFO L608 BuchiCegarLoop]: Abstraction has 334 states and 353 transitions. [2018-11-23 05:18:43,395 INFO L442 BuchiCegarLoop]: ======== Iteration 37============ [2018-11-23 05:18:43,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 353 transitions. [2018-11-23 05:18:43,396 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2018-11-23 05:18:43,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:18:43,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:18:43,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [23, 23, 21, 2, 1, 1, 1, 1] [2018-11-23 05:18:43,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 12, 11, 1] [2018-11-23 05:18:43,397 INFO L794 eck$LassoCheckResult]: Stem: 29437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 29435#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 29436#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 29438#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 29443#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29606#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29605#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29604#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29603#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29602#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29601#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29600#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29599#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29598#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29597#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29596#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29595#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29594#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29593#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29592#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29591#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29590#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29588#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29589#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29748#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29746#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29744#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29742#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29740#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29738#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29698#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29699#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29449#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29450#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29459#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29460#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29733#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 29731#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29729#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29728#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29727#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29726#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29725#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29724#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29723#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29722#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29721#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29720#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29719#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29718#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29717#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29716#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29715#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29714#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29713#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29712#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29711#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29710#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29709#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29708#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29707#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29706#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29705#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29704#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29703#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29702#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29701#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29700#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29696#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29697#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29695#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29694#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29693#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 29462#L556-2 [2018-11-23 05:18:43,397 INFO L796 eck$LassoCheckResult]: Loop: 29462#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29692#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29451#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29452#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29691#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29690#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29689#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29688#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29686#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29685#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29684#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29683#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29682#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29680#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29678#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29676#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29674#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29672#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29671#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29669#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29667#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29665#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29618#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29616#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29617#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29659#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29657#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29655#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29653#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29651#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29608#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29607#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29463#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 29461#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 29457#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 29458#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 29462#L556-2 [2018-11-23 05:18:43,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:18:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1610848946, now seen corresponding path program 35 times [2018-11-23 05:18:43,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:18:43,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:18:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:18:43,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:18:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:18:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:18:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 137 proven. 622 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:18:44,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:18:44,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:18:44,253 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 05:18:44,578 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 05:18:44,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:18:44,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:18:44,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 25 [2018-11-23 05:18:44,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:18:44,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 [2018-11-23 05:18:44,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:18:44,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 05:18:44,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-11-23 05:18:44,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,654 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:18:44,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,659 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:18:44,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-11-23 05:18:44,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 14 treesize of output 13 [2018-11-23 05:18:44,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,705 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 33 treesize of output 30 [2018-11-23 05:18:44,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 05:18:44,707 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,712 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:44,726 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2018-11-23 05:18:44,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,768 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 49 [2018-11-23 05:18:44,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,770 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 30 [2018-11-23 05:18:44,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,794 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 49 [2018-11-23 05:18:44,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,796 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 30 [2018-11-23 05:18:44,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:44,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:18:44,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,856 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 49 [2018-11-23 05:18:44,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,858 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 30 [2018-11-23 05:18:44,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,883 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 49 [2018-11-23 05:18:44,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,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 34 treesize of output 30 [2018-11-23 05:18:44,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:44,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:18:44,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,948 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 49 [2018-11-23 05:18:44,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,950 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 30 [2018-11-23 05:18:44,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-11-23 05:18:44,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:44,982 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 30 [2018-11-23 05:18:44,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:44,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:45,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:18:45,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,044 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 49 [2018-11-23 05:18:45,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,046 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 30 [2018-11-23 05:18:45,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,076 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 49 [2018-11-23 05:18:45,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,078 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 30 [2018-11-23 05:18:45,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:45,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:18:45,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,147 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 49 [2018-11-23 05:18:45,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,149 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 30 [2018-11-23 05:18:45,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,174 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 49 [2018-11-23 05:18:45,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,176 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 30 [2018-11-23 05:18:45,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:45,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:18:45,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,241 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 49 [2018-11-23 05:18:45,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-23 05:18:45,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,271 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 49 [2018-11-23 05:18:45,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,274 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 30 [2018-11-23 05:18:45,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:45,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:18:45,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,428 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 49 [2018-11-23 05:18:45,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-23 05:18:45,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,456 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 49 [2018-11-23 05:18:45,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,458 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 30 [2018-11-23 05:18:45,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:45,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:18:45,527 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,529 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 49 [2018-11-23 05:18:45,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,531 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 30 [2018-11-23 05:18:45,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,563 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 49 [2018-11-23 05:18:45,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,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, 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 30 [2018-11-23 05:18:45,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:45,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:18:45,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,639 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 49 [2018-11-23 05:18:45,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,642 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 30 [2018-11-23 05:18:45,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,671 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 49 [2018-11-23 05:18:45,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,674 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 30 [2018-11-23 05:18:45,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:45,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:59 [2018-11-23 05:18:45,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,842 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 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:18:45,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,844 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 43 treesize of output 43 [2018-11-23 05:18:45,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 58 [2018-11-23 05:18:45,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,882 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 43 treesize of output 43 [2018-11-23 05:18:45,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:45,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:85 [2018-11-23 05:18:45,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:45,972 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 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:18:45,974 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 18 [2018-11-23 05:18:45,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:45,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2018-11-23 05:18:46,007 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 18 [2018-11-23 05:18:46,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:46,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:73 [2018-11-23 05:18:46,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,166 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:18:46,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,168 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 7 [2018-11-23 05:18:46,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:18:46,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,223 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:18:46,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,225 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 7 [2018-11-23 05:18:46,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:18:46,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,279 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:18:46,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,281 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 7 [2018-11-23 05:18:46,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:18:46,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,338 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:18:46,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,340 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 7 [2018-11-23 05:18:46,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:18:46,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,397 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:18:46,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,399 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 7 [2018-11-23 05:18:46,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:18:46,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,460 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 1 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 05:18:46,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,462 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 7 [2018-11-23 05:18:46,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:18:46,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,616 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:18:46,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,619 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 38 treesize of output 16 [2018-11-23 05:18:46,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,634 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 05:18:46,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:44 [2018-11-23 05:18:46,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,690 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 1 case distinctions, treesize of input 53 treesize of output 64 [2018-11-23 05:18:46,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,693 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 7 [2018-11-23 05:18:46,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,708 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 05:18:46,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-11-23 05:18:46,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,764 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 1 case distinctions, treesize of input 53 treesize of output 64 [2018-11-23 05:18:46,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,767 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 7 [2018-11-23 05:18:46,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,782 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 05:18:46,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-11-23 05:18:46,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,841 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 1 case distinctions, treesize of input 53 treesize of output 64 [2018-11-23 05:18:46,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,843 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 7 [2018-11-23 05:18:46,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,861 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 05:18:46,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-11-23 05:18:46,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,927 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 1 case distinctions, treesize of input 53 treesize of output 64 [2018-11-23 05:18:46,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:46,929 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 7 [2018-11-23 05:18:46,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:46,945 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 05:18:46,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-11-23 05:18:47,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 52 [2018-11-23 05:18:47,013 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 44 treesize of output 37 [2018-11-23 05:18:47,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:47,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-23 05:18:47,036 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:47,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:47,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:18:47,053 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-11-23 05:18:47,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 05:18:47,071 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 25 treesize of output 18 [2018-11-23 05:18:47,072 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:47,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-23 05:18:47,082 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:18:47,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:18:47,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:18:47,101 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:58, output treesize:7 [2018-11-23 05:18:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:18:47,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:18:47,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 62 [2018-11-23 05:18:47,174 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:18:47,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:18:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash 721544771, now seen corresponding path program 32 times [2018-11-23 05:18:47,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:18:47,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:18:47,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:18:47,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:18:47,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:18:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:18:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:18:58,648 WARN L180 SmtUtils]: Spent 11.42 s on a formula simplification. DAG size of input: 331 DAG size of output: 321 [2018-11-23 05:18:58,770 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-11-23 05:18:58,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-23 05:18:58,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=3423, Unknown=0, NotChecked=0, Total=3906 [2018-11-23 05:18:58,771 INFO L87 Difference]: Start difference. First operand 334 states and 353 transitions. cyclomatic complexity: 25 Second operand 63 states. [2018-11-23 05:19:15,353 WARN L180 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2018-11-23 05:19:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:19:15,761 INFO L93 Difference]: Finished difference Result 465 states and 488 transitions. [2018-11-23 05:19:15,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-23 05:19:15,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 488 transitions. [2018-11-23 05:19:15,762 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 132 [2018-11-23 05:19:15,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 461 states and 484 transitions. [2018-11-23 05:19:15,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 224 [2018-11-23 05:19:15,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2018-11-23 05:19:15,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 484 transitions. [2018-11-23 05:19:15,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:19:15,763 INFO L705 BuchiCegarLoop]: Abstraction has 461 states and 484 transitions. [2018-11-23 05:19:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 484 transitions. [2018-11-23 05:19:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 411. [2018-11-23 05:19:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-11-23 05:19:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 432 transitions. [2018-11-23 05:19:15,765 INFO L728 BuchiCegarLoop]: Abstraction has 411 states and 432 transitions. [2018-11-23 05:19:15,765 INFO L608 BuchiCegarLoop]: Abstraction has 411 states and 432 transitions. [2018-11-23 05:19:15,765 INFO L442 BuchiCegarLoop]: ======== Iteration 38============ [2018-11-23 05:19:15,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 411 states and 432 transitions. [2018-11-23 05:19:15,766 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 132 [2018-11-23 05:19:15,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:19:15,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:19:15,766 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [24, 24, 22, 2, 1, 1, 1, 1] [2018-11-23 05:19:15,766 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 13, 12, 1] [2018-11-23 05:19:15,767 INFO L794 eck$LassoCheckResult]: Stem: 30654#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 30652#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~nondet5, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~short9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem15, main_#t~mem16, main_#t~mem17, main_#t~mem12, main_#t~mem13, main_#t~nondet14, main_~tmp~0.base, main_~tmp~0.offset, main_~id~0.base, main_~id~0.offset, main_~maxId~0.base, main_~maxId~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~id~0.base, main_~id~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~maxId~0.base, main_~maxId~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~id~0.base, main_~id~0.offset, 4);havoc main_#t~nondet4;call write~int(main_#t~nondet5, main_~maxId~0.base, main_~maxId~0.offset, 4);havoc main_#t~nondet5;call main_#t~mem6 := read~int(main_~id~0.base, main_~id~0.offset, 4);main_#t~short9 := 0 <= main_#t~mem6; 30653#L552 assume main_#t~short9;call main_#t~mem7 := read~int(main_~id~0.base, main_~id~0.offset, 4);call main_#t~mem8 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4);main_#t~short9 := main_#t~mem7 < main_#t~mem8; 30655#L552-2 assume main_#t~short9;havoc main_#t~mem8;havoc main_#t~short9;havoc main_#t~mem7;havoc main_#t~mem6;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~tmp~0.base, main_~tmp~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~id~0.base, main_~id~0.offset, 4);call write~int(1 + main_#t~mem11, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem11; 30660#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30820#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30819#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30818#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30817#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30816#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30815#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30814#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30813#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30812#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30811#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30810#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30809#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30808#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30807#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30806#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30805#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30804#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30802#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30803#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31028#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31027#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31026#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31025#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31024#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31023#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31022#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31020#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31021#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31032#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31029#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30669#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30656#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 30657#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30661#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30658#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30659#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30662#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31062#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31061#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31060#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31059#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31058#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31057#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31056#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31055#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31054#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31053#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31052#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31051#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31050#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31049#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31048#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31047#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31046#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31045#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31044#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31043#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31042#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31041#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31040#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31039#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31038#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31037#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31036#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31035#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31034#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 31031#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 31033#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 31030#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30976#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30937#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 30676#L556-2 [2018-11-23 05:19:15,767 INFO L796 eck$LassoCheckResult]: Loop: 30676#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30663#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30664#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30665#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30931#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30932#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30927#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30928#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30924#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30923#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30921#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30922#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30968#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30858#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30859#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30854#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30855#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30850#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30851#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30846#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30847#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30842#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30843#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30956#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30954#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30952#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30950#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30948#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30833#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30834#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30829#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30830#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30825#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30826#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30821#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30822#L556 assume main_#t~mem15 <= main_#t~mem16;havoc main_#t~mem16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call write~int(1 + main_#t~mem17, main_~tmp~0.base, main_~tmp~0.offset, 4);havoc main_#t~mem17; 30675#L556-2 call main_#t~mem12 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem13 := read~int(main_~id~0.base, main_~id~0.offset, 4); 30936#L555-1 assume !!(main_#t~mem12 != main_#t~mem13 && 0 != main_#t~nondet14);havoc main_#t~mem13;havoc main_#t~nondet14;havoc main_#t~mem12;call main_#t~mem15 := read~int(main_~tmp~0.base, main_~tmp~0.offset, 4);call main_#t~mem16 := read~int(main_~maxId~0.base, main_~maxId~0.offset, 4); 30674#L556 assume !(main_#t~mem15 <= main_#t~mem16);havoc main_#t~mem16;havoc main_#t~mem15;call write~int(0, main_~tmp~0.base, main_~tmp~0.offset, 4); 30676#L556-2 [2018-11-23 05:19:15,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:19:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1131395607, now seen corresponding path program 36 times [2018-11-23 05:19:15,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:19:15,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:19:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:19:15,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:19:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:19:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:19:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 32 proven. 796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:19:16,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:19:16,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_834d9c04-b41a-45cf-85b4-71a02bb72cad/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:19:17,002 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 05:19:17,483 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2018-11-23 05:19:17,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:19:17,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:19:17,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-11-23 05:19:17,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 12 treesize of output 11 [2018-11-23 05:19:17,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,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, 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 19 [2018-11-23 05:19:17,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 05:19:17,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,514 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:19:17,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-11-23 05:19:17,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,610 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 05:19:17,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,621 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 26 [2018-11-23 05:19:17,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 14 treesize of output 13 [2018-11-23 05:19:17,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,628 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,633 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 05:19:17,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-11-23 05:19:17,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,680 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 38 treesize of output 45 [2018-11-23 05:19:17,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-23 05:19:17,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:19:17,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,742 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 38 treesize of output 45 [2018-11-23 05:19:17,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,744 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 30 [2018-11-23 05:19:17,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:19:17,802 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,804 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 38 treesize of output 45 [2018-11-23 05:19:17,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,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, 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 30 [2018-11-23 05:19:17,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:19:17,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,866 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 38 treesize of output 45 [2018-11-23 05:19:17,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,876 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 30 [2018-11-23 05:19:17,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:19:17,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,936 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 38 treesize of output 45 [2018-11-23 05:19:17,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:17,938 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 30 [2018-11-23 05:19:17,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:17,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:19:17,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,000 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 38 treesize of output 45 [2018-11-23 05:19:18,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,003 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 30 [2018-11-23 05:19:18,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:19:18,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 45 [2018-11-23 05:19:18,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,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 34 treesize of output 30 [2018-11-23 05:19:18,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:19:18,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,131 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 38 treesize of output 45 [2018-11-23 05:19:18,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,138 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 30 [2018-11-23 05:19:18,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:19:18,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,225 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 38 treesize of output 45 [2018-11-23 05:19:18,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,228 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 30 [2018-11-23 05:19:18,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:29 [2018-11-23 05:19:18,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,362 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 1 case distinctions, treesize of input 49 treesize of output 58 [2018-11-23 05:19:18,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,365 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 43 treesize of output 43 [2018-11-23 05:19:18,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-11-23 05:19:18,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,450 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 1 case distinctions, treesize of input 45 treesize of output 54 [2018-11-23 05:19:18,452 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 18 [2018-11-23 05:19:18,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:36 [2018-11-23 05:19:18,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,662 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 1 case distinctions, treesize of input 57 treesize of output 66 [2018-11-23 05:19:18,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,664 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 38 treesize of output 16 [2018-11-23 05:19:18,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:44 [2018-11-23 05:19:18,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,884 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 1 case distinctions, treesize of input 65 treesize of output 74 [2018-11-23 05:19:18,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,887 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 38 treesize of output 16 [2018-11-23 05:19:18,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:18,910 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 05:19:18,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:52 [2018-11-23 05:19:18,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,990 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:19:18,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:18,993 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 7 [2018-11-23 05:19:18,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,011 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 05:19:19,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:19:19,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,091 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:19:19,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,094 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 7 [2018-11-23 05:19:19,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,117 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 05:19:19,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:19:19,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,228 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:19:19,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,236 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 7 [2018-11-23 05:19:19,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,256 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 05:19:19,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:19:19,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,365 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:19:19,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,369 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 7 [2018-11-23 05:19:19,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,400 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 05:19:19,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:19:19,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,481 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:19:19,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,484 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 7 [2018-11-23 05:19:19,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,502 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 05:19:19,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:19:19,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,586 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:19:19,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,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 28 treesize of output 7 [2018-11-23 05:19:19,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,607 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 05:19:19,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:19:19,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,691 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:19:19,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,693 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 7 [2018-11-23 05:19:19,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,711 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 05:19:19,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:19:19,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,797 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:19:19,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,800 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 7 [2018-11-23 05:19:19,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,820 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 05:19:19,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:19:19,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,909 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:19:19,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:19,912 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 7 [2018-11-23 05:19:19,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:19,932 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 05:19:19,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:19:20,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:20,020 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 1 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 05:19:20,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:20,023 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 7 [2018-11-23 05:19:20,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:20,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:20,042 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 05:19:20,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:52 [2018-11-23 05:19:20,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2018-11-23 05:19:20,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-11-23 05:19:20,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:20,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-11-23 05:19:20,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:20,181 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 39 treesize of output 31 [2018-11-23 05:19:20,181 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:20,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:20,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:19:20,200 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-23 05:19:20,200 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:20,216 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 11 [2018-11-23 05:19:20,216 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:19:20,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:19:20,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:19:20,236 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:66, output treesize:7 [2018-11-23 05:19:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:19:20,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:19:20,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 66 [2018-11-23 05:19:20,324 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:19:20,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:19:20,324 INFO L82 PathProgramCache]: Analyzing trace with hash -771087148, now seen corresponding path program 33 times [2018-11-23 05:19:20,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:19:20,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:19:20,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:19:20,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:19:20,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:19:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:19:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:19:38,884 WARN L180 SmtUtils]: Spent 18.51 s on a formula simplification. DAG size of input: 356 DAG size of output: 345 [2018-11-23 05:19:39,037 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-11-23 05:19:39,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-23 05:19:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=4087, Unknown=0, NotChecked=0, Total=4422 [2018-11-23 05:19:39,038 INFO L87 Difference]: Start difference. First operand 411 states and 432 transitions. cyclomatic complexity: 29 Second operand 67 states. [2018-11-23 05:19:44,826 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2018-11-23 05:19:45,326 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-11-23 05:19:45,756 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-11-23 05:19:46,174 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-23 05:19:46,763 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-11-23 05:19:59,616 WARN L180 SmtUtils]: Spent 12.05 s on a formula simplification. DAG size of input: 136 DAG size of output: 39 [2018-11-23 05:20:11,966 WARN L180 SmtUtils]: Spent 12.07 s on a formula simplification. DAG size of input: 145 DAG size of output: 43 [2018-11-23 05:20:12,954 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-11-23 05:20:13,843 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2018-11-23 05:20:14,734 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2018-11-23 05:20:15,559 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2018-11-23 05:20:16,183 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2018-11-23 05:20:16,676 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-23 05:20:29,769 WARN L180 SmtUtils]: Spent 12.04 s on a formula simplification. DAG size of input: 98 DAG size of output: 39 [2018-11-23 05:20:38,104 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-11-23 05:20:38,105 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:980) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2018-11-23 05:20:38,107 INFO L168 Benchmark]: Toolchain (without parser) took 759756.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 950.0 MB in the beginning and 926.8 MB in the end (delta: 23.2 MB). Peak memory consumption was 178.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:20:38,107 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:20:38,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:20:38,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:20:38,108 INFO L168 Benchmark]: Boogie Preprocessor took 18.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:20:38,108 INFO L168 Benchmark]: RCFGBuilder took 203.81 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: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:20:38,108 INFO L168 Benchmark]: BuchiAutomizer took 759169.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.8 MB). Free memory was 1.1 GB in the beginning and 926.8 MB in the end (delta: 190.0 MB). Peak memory consumption was 195.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:20:38,109 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 203.81 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: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 759169.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.8 MB). Free memory was 1.1 GB in the beginning and 926.8 MB in the end (delta: 190.0 MB). Peak memory consumption was 195.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...