./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:59:22,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:59:22,745 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:59:22,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:59:22,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:59:22,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:59:22,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:59:22,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:59:22,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:59:22,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:59:22,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:59:22,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:59:22,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:59:22,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:59:22,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:59:22,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:59:22,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:59:22,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:59:22,759 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:59:22,759 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:59:22,760 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:59:22,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:59:22,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:59:22,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:59:22,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:59:22,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:59:22,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:59:22,763 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:59:22,763 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:59:22,764 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:59:22,764 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:59:22,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:59:22,765 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:59:22,765 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:59:22,765 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:59:22,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:59:22,766 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:59:22,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:59:22,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:59:22,773 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:59:22,773 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:59:22,773 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:59:22,773 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:59:22,773 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:59:22,773 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:59:22,773 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:59:22,774 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:59:22,774 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:59:22,774 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:59:22,774 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:59:22,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:59:22,774 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:59:22,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:59:22,774 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:59:22,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:59:22,775 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:59:22,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:59:22,775 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:59:22,775 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:59:22,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:59:22,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:59:22,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:59:22,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:59:22,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:59:22,775 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:59:22,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:59:22,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:59:22,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:59:22,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:59:22,776 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:59:22,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:59:22,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:59:22,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:59:22,776 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-12-09 00:59:22,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:59:22,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:59:22,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:59:22,805 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:59:22,805 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:59:22,806 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-12-09 00:59:22,848 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/data/7256ae9dd/b8b8b849e19c4306af3a323e5df215e1/FLAG391ff1c6f [2018-12-09 00:59:23,206 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:59:23,206 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-12-09 00:59:23,212 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/data/7256ae9dd/b8b8b849e19c4306af3a323e5df215e1/FLAG391ff1c6f [2018-12-09 00:59:23,610 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/data/7256ae9dd/b8b8b849e19c4306af3a323e5df215e1 [2018-12-09 00:59:23,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:59:23,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:59:23,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:59:23,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:59:23,617 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:59:23,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c0bf60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23, skipping insertion in model container [2018-12-09 00:59:23,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:59:23,648 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:59:23,793 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:59:23,798 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:59:23,862 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:59:23,891 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:59:23,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23 WrapperNode [2018-12-09 00:59:23,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:59:23,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:59:23,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:59:23,892 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:59:23,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:59:23,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:59:23,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:59:23,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:59:23,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (1/1) ... [2018-12-09 00:59:23,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:59:23,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:59:23,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:59:23,934 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:59:23,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:59:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:59:23,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:59:23,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:59:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:59:23,967 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:59:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 00:59:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 00:59:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:59:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:59:23,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:59:24,207 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:59:24,207 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-12-09 00:59:24,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:24 BoogieIcfgContainer [2018-12-09 00:59:24,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:59:24,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:59:24,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:59:24,210 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:59:24,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:59:23" (1/3) ... [2018-12-09 00:59:24,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a40300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:59:24, skipping insertion in model container [2018-12-09 00:59:24,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:59:23" (2/3) ... [2018-12-09 00:59:24,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a40300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:59:24, skipping insertion in model container [2018-12-09 00:59:24,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:24" (3/3) ... [2018-12-09 00:59:24,212 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-12-09 00:59:24,218 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:59:24,223 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-12-09 00:59:24,232 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-12-09 00:59:24,251 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:59:24,251 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:59:24,251 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:59:24,251 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:59:24,251 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:59:24,251 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:59:24,251 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:59:24,251 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:59:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-12-09 00:59:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 00:59:24,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:24,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:24,267 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:24,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash 11196085, now seen corresponding path program 1 times [2018-12-09 00:59:24,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:24,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:24,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:24,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:24,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:59:24,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:24,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:59:24,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:59:24,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,368 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2018-12-09 00:59:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:24,403 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2018-12-09 00:59:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:59:24,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-09 00:59:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:24,409 INFO L225 Difference]: With dead ends: 188 [2018-12-09 00:59:24,410 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 00:59:24,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 00:59:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-12-09 00:59:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 00:59:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-12-09 00:59:24,434 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 8 [2018-12-09 00:59:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:24,434 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-12-09 00:59:24,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:59:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-12-09 00:59:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 00:59:24,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:24,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:24,435 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:24,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1909121887, now seen corresponding path program 1 times [2018-12-09 00:59:24,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:24,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:24,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:24,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:24,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:59:24,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:24,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:59:24,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:59:24,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,458 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 3 states. [2018-12-09 00:59:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:24,469 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-12-09 00:59:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:59:24,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-09 00:59:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:24,470 INFO L225 Difference]: With dead ends: 85 [2018-12-09 00:59:24,470 INFO L226 Difference]: Without dead ends: 83 [2018-12-09 00:59:24,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-09 00:59:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-09 00:59:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 00:59:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-12-09 00:59:24,475 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-12-09 00:59:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:24,475 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-12-09 00:59:24,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:59:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-12-09 00:59:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 00:59:24,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:24,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:24,476 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:24,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1909123809, now seen corresponding path program 1 times [2018-12-09 00:59:24,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:24,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:24,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:24,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:24,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:24,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:24,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:24,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:24,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:24,510 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 4 states. [2018-12-09 00:59:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:24,547 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-12-09 00:59:24,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:59:24,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-09 00:59:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:24,548 INFO L225 Difference]: With dead ends: 84 [2018-12-09 00:59:24,548 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 00:59:24,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 00:59:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-12-09 00:59:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 00:59:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-12-09 00:59:24,552 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 14 [2018-12-09 00:59:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:24,552 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-12-09 00:59:24,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-12-09 00:59:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 00:59:24,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:24,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:24,553 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:24,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:24,553 INFO L82 PathProgramCache]: Analyzing trace with hash -44725957, now seen corresponding path program 1 times [2018-12-09 00:59:24,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:24,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:24,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:59:24,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:24,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:59:24,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:59:24,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,583 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2018-12-09 00:59:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:24,628 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-12-09 00:59:24,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:59:24,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 00:59:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:24,629 INFO L225 Difference]: With dead ends: 83 [2018-12-09 00:59:24,629 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 00:59:24,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 00:59:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-12-09 00:59:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 00:59:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-09 00:59:24,633 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 19 [2018-12-09 00:59:24,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:24,633 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-09 00:59:24,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:59:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-09 00:59:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 00:59:24,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:24,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:24,634 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:24,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1386500464, now seen corresponding path program 1 times [2018-12-09 00:59:24,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:24,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:24,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:24,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:24,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:24,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:24,658 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 4 states. [2018-12-09 00:59:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:24,701 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2018-12-09 00:59:24,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:59:24,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 00:59:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:24,702 INFO L225 Difference]: With dead ends: 136 [2018-12-09 00:59:24,702 INFO L226 Difference]: Without dead ends: 116 [2018-12-09 00:59:24,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-09 00:59:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2018-12-09 00:59:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 00:59:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-12-09 00:59:24,706 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2018-12-09 00:59:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:24,706 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-12-09 00:59:24,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-12-09 00:59:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:59:24,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:24,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:24,707 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:24,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash 725856891, now seen corresponding path program 1 times [2018-12-09 00:59:24,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:24,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:24,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:24,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:24,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:59:24,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:24,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:59:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:59:24,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,724 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 3 states. [2018-12-09 00:59:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:24,731 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2018-12-09 00:59:24,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:59:24,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 00:59:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:24,732 INFO L225 Difference]: With dead ends: 141 [2018-12-09 00:59:24,732 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 00:59:24,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 00:59:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2018-12-09 00:59:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 00:59:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-12-09 00:59:24,736 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2018-12-09 00:59:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:24,736 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-12-09 00:59:24,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:59:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-12-09 00:59:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:59:24,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:24,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:24,737 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:24,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1026716690, now seen corresponding path program 1 times [2018-12-09 00:59:24,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:24,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:24,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:24,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:24,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:59:24,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:24,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:59:24,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:59:24,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,755 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 3 states. [2018-12-09 00:59:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:24,764 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-12-09 00:59:24,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:59:24,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 00:59:24,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:24,765 INFO L225 Difference]: With dead ends: 78 [2018-12-09 00:59:24,765 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 00:59:24,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 00:59:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-09 00:59:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 00:59:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-12-09 00:59:24,771 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 25 [2018-12-09 00:59:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:24,771 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-12-09 00:59:24,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:59:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-12-09 00:59:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:59:24,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:24,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:24,773 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:24,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:24,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1611661129, now seen corresponding path program 1 times [2018-12-09 00:59:24,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:24,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:24,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:24,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:24,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:59:24,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:24,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:59:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:59:24,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,799 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2018-12-09 00:59:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:24,805 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2018-12-09 00:59:24,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:59:24,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 00:59:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:24,806 INFO L225 Difference]: With dead ends: 79 [2018-12-09 00:59:24,806 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 00:59:24,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 00:59:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-09 00:59:24,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 00:59:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-12-09 00:59:24,811 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 27 [2018-12-09 00:59:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:24,811 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-12-09 00:59:24,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:59:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2018-12-09 00:59:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:59:24,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:24,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:24,812 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:24,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:24,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1611663051, now seen corresponding path program 1 times [2018-12-09 00:59:24,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:24,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:24,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:24,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:24,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:24,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:24,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:24,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:24,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:24,848 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 4 states. [2018-12-09 00:59:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:24,883 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-12-09 00:59:24,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:59:24,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-09 00:59:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:24,884 INFO L225 Difference]: With dead ends: 78 [2018-12-09 00:59:24,884 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 00:59:24,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 00:59:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-09 00:59:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 00:59:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2018-12-09 00:59:24,888 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 27 [2018-12-09 00:59:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:24,889 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2018-12-09 00:59:24,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-12-09 00:59:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:59:24,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:24,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:24,890 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:24,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:24,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1836072976, now seen corresponding path program 1 times [2018-12-09 00:59:24,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:24,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:24,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:24,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:24,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:24,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:24,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:24,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:24,930 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2018-12-09 00:59:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:24,997 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-12-09 00:59:24,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:59:24,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-12-09 00:59:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:24,998 INFO L225 Difference]: With dead ends: 190 [2018-12-09 00:59:24,998 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 00:59:24,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 00:59:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2018-12-09 00:59:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 00:59:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-12-09 00:59:25,003 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 28 [2018-12-09 00:59:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:25,004 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-12-09 00:59:25,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-12-09 00:59:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:59:25,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:25,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:25,005 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:25,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash 870546418, now seen corresponding path program 1 times [2018-12-09 00:59:25,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:25,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:25,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:25,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:25,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:25,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:59:25,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:25,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:59:25,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:59:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:59:25,068 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2018-12-09 00:59:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:25,189 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2018-12-09 00:59:25,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:59:25,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 00:59:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:25,190 INFO L225 Difference]: With dead ends: 182 [2018-12-09 00:59:25,190 INFO L226 Difference]: Without dead ends: 139 [2018-12-09 00:59:25,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:59:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-09 00:59:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2018-12-09 00:59:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 00:59:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-12-09 00:59:25,194 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 28 [2018-12-09 00:59:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:25,194 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-12-09 00:59:25,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:59:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-12-09 00:59:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:59:25,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:25,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:25,195 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:25,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash 769950578, now seen corresponding path program 1 times [2018-12-09 00:59:25,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:25,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:25,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:25,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:25,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:59:25,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:25,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:59:25,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:59:25,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:25,343 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 7 states. [2018-12-09 00:59:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:25,616 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2018-12-09 00:59:25,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:59:25,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-12-09 00:59:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:25,618 INFO L225 Difference]: With dead ends: 241 [2018-12-09 00:59:25,618 INFO L226 Difference]: Without dead ends: 239 [2018-12-09 00:59:25,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:59:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-09 00:59:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 98. [2018-12-09 00:59:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 00:59:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-12-09 00:59:25,626 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 28 [2018-12-09 00:59:25,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:25,626 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-12-09 00:59:25,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:59:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-12-09 00:59:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 00:59:25,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:25,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:25,628 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:25,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1506132002, now seen corresponding path program 1 times [2018-12-09 00:59:25,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:25,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:25,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:25,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:59:25,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:25,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:59:25,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:25,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:59:25,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:59:25,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:25,662 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2018-12-09 00:59:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:25,737 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2018-12-09 00:59:25,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:59:25,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-09 00:59:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:25,738 INFO L225 Difference]: With dead ends: 145 [2018-12-09 00:59:25,738 INFO L226 Difference]: Without dead ends: 127 [2018-12-09 00:59:25,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:59:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-09 00:59:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-12-09 00:59:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-09 00:59:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2018-12-09 00:59:25,743 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 30 [2018-12-09 00:59:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:25,743 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2018-12-09 00:59:25,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:59:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2018-12-09 00:59:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 00:59:25,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:25,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:25,744 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:25,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:25,745 INFO L82 PathProgramCache]: Analyzing trace with hash -677189726, now seen corresponding path program 1 times [2018-12-09 00:59:25,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:25,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:25,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:25,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:25,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:59:25,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:25,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:59:25,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:25,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:59:25,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:59:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:25,759 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 3 states. [2018-12-09 00:59:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:25,785 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2018-12-09 00:59:25,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:59:25,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 00:59:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:25,786 INFO L225 Difference]: With dead ends: 119 [2018-12-09 00:59:25,786 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 00:59:25,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 00:59:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-09 00:59:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-09 00:59:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2018-12-09 00:59:25,793 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 30 [2018-12-09 00:59:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:25,793 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2018-12-09 00:59:25,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:59:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2018-12-09 00:59:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:59:25,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:25,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:25,794 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:25,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:25,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1818543518, now seen corresponding path program 1 times [2018-12-09 00:59:25,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:25,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:25,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:25,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:25,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:25,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:59:25,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:25,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:59:25,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:59:25,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:25,950 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 7 states. [2018-12-09 00:59:26,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:26,180 INFO L93 Difference]: Finished difference Result 277 states and 322 transitions. [2018-12-09 00:59:26,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:59:26,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-12-09 00:59:26,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:26,181 INFO L225 Difference]: With dead ends: 277 [2018-12-09 00:59:26,181 INFO L226 Difference]: Without dead ends: 275 [2018-12-09 00:59:26,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:59:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-09 00:59:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 120. [2018-12-09 00:59:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-09 00:59:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2018-12-09 00:59:26,188 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 31 [2018-12-09 00:59:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:26,188 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2018-12-09 00:59:26,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:59:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2018-12-09 00:59:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:59:26,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:26,189 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:26,190 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:26,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash -828341282, now seen corresponding path program 1 times [2018-12-09 00:59:26,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:26,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:26,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:26,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:26,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:26,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:26,250 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-12-09 00:59:26,251 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [15], [19], [24], [27], [33], [38], [46], [50], [55], [60], [63], [135], [145], [149], [161], [168], [170], [173], [185], [189], [196], [199], [200], [248], [252], [257], [336], [337], [338] [2018-12-09 00:59:26,271 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:26,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:26,391 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:59:26,392 INFO L272 AbstractInterpreter]: Visited 32 different actions 44 times. Merged at 12 different actions 12 times. Never widened. Performed 290 root evaluator evaluations with a maximum evaluation depth of 3. Performed 290 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-12-09 00:59:26,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:26,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:59:26,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:26,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/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-12-09 00:59:26,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:26,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:59:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:26,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:26,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:59:26,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-09 00:59:26,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:59:26,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:59:26,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-12-09 00:59:26,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 00:59:26,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:26,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 00:59:26,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-09 00:59:26,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:26,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 00:59:26,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-12-09 00:59:26,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 00:59:26,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:26,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 00:59:26,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:26,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:26,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-12-09 00:59:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:26,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:59:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:26,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:59:26,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2018-12-09 00:59:26,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:59:26,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:59:26,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:59:26,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:59:26,610 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 8 states. [2018-12-09 00:59:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:26,764 INFO L93 Difference]: Finished difference Result 224 states and 260 transitions. [2018-12-09 00:59:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:59:26,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-12-09 00:59:26,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:26,765 INFO L225 Difference]: With dead ends: 224 [2018-12-09 00:59:26,765 INFO L226 Difference]: Without dead ends: 162 [2018-12-09 00:59:26,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:59:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-09 00:59:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2018-12-09 00:59:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 00:59:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2018-12-09 00:59:26,774 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 33 [2018-12-09 00:59:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:26,774 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2018-12-09 00:59:26,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:59:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2018-12-09 00:59:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:59:26,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:26,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:26,775 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:26,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:26,775 INFO L82 PathProgramCache]: Analyzing trace with hash -693545280, now seen corresponding path program 1 times [2018-12-09 00:59:26,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:26,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:26,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:26,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:26,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:26,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:59:26,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:26,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:59:26,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:59:26,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:59:26,873 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 6 states. [2018-12-09 00:59:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:26,968 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2018-12-09 00:59:26,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:59:26,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-12-09 00:59:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:26,969 INFO L225 Difference]: With dead ends: 165 [2018-12-09 00:59:26,969 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 00:59:26,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:59:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 00:59:26,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2018-12-09 00:59:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 00:59:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2018-12-09 00:59:26,974 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 33 [2018-12-09 00:59:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:26,975 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2018-12-09 00:59:26,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:59:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2018-12-09 00:59:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:59:26,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:26,975 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:26,975 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:26,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:26,976 INFO L82 PathProgramCache]: Analyzing trace with hash 928343854, now seen corresponding path program 1 times [2018-12-09 00:59:26,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:26,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:26,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:26,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:26,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:27,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:27,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:27,044 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-09 00:59:27,044 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [15], [19], [24], [27], [33], [38], [46], [50], [55], [60], [63], [135], [145], [149], [159], [161], [168], [248], [252], [257], [268], [271], [281], [285], [292], [295], [296], [328], [330], [336], [337], [338] [2018-12-09 00:59:27,046 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:27,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:27,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:59:27,120 INFO L272 AbstractInterpreter]: Visited 35 different actions 50 times. Merged at 14 different actions 14 times. Never widened. Performed 352 root evaluator evaluations with a maximum evaluation depth of 3. Performed 352 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 38 variables. [2018-12-09 00:59:27,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:27,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:59:27,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:27,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/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-12-09 00:59:27,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:27,135 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:59:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:27,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:27,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 00:59:27,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 00:59:27,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 00:59:27,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 00:59:27,217 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-12-09 00:59:27,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 00:59:27,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:27,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 00:59:27,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,234 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-12-09 00:59:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:27,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:59:27,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2018-12-09 00:59:27,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-12-09 00:59:27,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 21 [2018-12-09 00:59:27,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,300 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 12 [2018-12-09 00:59:27,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:59:27,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:59:27,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:25 [2018-12-09 00:59:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:27,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:59:27,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2018-12-09 00:59:27,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:59:27,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:59:27,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:59:27,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:59:27,361 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 10 states. [2018-12-09 00:59:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:27,530 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2018-12-09 00:59:27,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:59:27,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-09 00:59:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:27,532 INFO L225 Difference]: With dead ends: 225 [2018-12-09 00:59:27,532 INFO L226 Difference]: Without dead ends: 194 [2018-12-09 00:59:27,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:59:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-09 00:59:27,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 138. [2018-12-09 00:59:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-09 00:59:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 165 transitions. [2018-12-09 00:59:27,538 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 165 transitions. Word has length 36 [2018-12-09 00:59:27,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:27,538 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 165 transitions. [2018-12-09 00:59:27,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:59:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 165 transitions. [2018-12-09 00:59:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:59:27,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:27,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:27,539 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:27,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:27,539 INFO L82 PathProgramCache]: Analyzing trace with hash 36989377, now seen corresponding path program 1 times [2018-12-09 00:59:27,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:27,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:27,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:27,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:27,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:27,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:27,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:59:27,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:27,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:59:27,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:59:27,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:27,551 INFO L87 Difference]: Start difference. First operand 138 states and 165 transitions. Second operand 3 states. [2018-12-09 00:59:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:27,564 INFO L93 Difference]: Finished difference Result 297 states and 364 transitions. [2018-12-09 00:59:27,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:59:27,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 00:59:27,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:27,565 INFO L225 Difference]: With dead ends: 297 [2018-12-09 00:59:27,565 INFO L226 Difference]: Without dead ends: 215 [2018-12-09 00:59:27,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:59:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-09 00:59:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 175. [2018-12-09 00:59:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-09 00:59:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2018-12-09 00:59:27,572 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 36 [2018-12-09 00:59:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:27,572 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2018-12-09 00:59:27,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:59:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2018-12-09 00:59:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:59:27,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:27,573 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:27,573 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:27,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:27,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1278661403, now seen corresponding path program 1 times [2018-12-09 00:59:27,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:27,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:27,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:27,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:27,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:27,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:59:27,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:59:27,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:59:27,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:59:27,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:59:27,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:59:27,593 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand 4 states. [2018-12-09 00:59:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:27,637 INFO L93 Difference]: Finished difference Result 291 states and 353 transitions. [2018-12-09 00:59:27,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:59:27,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-12-09 00:59:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:27,638 INFO L225 Difference]: With dead ends: 291 [2018-12-09 00:59:27,638 INFO L226 Difference]: Without dead ends: 182 [2018-12-09 00:59:27,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:59:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-09 00:59:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2018-12-09 00:59:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-09 00:59:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2018-12-09 00:59:27,645 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 40 [2018-12-09 00:59:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:27,645 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2018-12-09 00:59:27,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:59:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2018-12-09 00:59:27,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:59:27,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:27,646 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:27,646 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:27,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:27,646 INFO L82 PathProgramCache]: Analyzing trace with hash 257593049, now seen corresponding path program 1 times [2018-12-09 00:59:27,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:27,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:27,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:27,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:27,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:27,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:27,823 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-09 00:59:27,823 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [15], [19], [24], [27], [33], [38], [46], [50], [55], [60], [63], [65], [75], [79], [92], [96], [101], [104], [110], [115], [123], [127], [135], [145], [149], [161], [170], [173], [185], [189], [196], [199], [200], [336], [337], [338] [2018-12-09 00:59:27,824 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:27,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:27,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:59:27,874 INFO L272 AbstractInterpreter]: Visited 39 different actions 43 times. Merged at 3 different actions 3 times. Never widened. Performed 343 root evaluator evaluations with a maximum evaluation depth of 3. Performed 343 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-09 00:59:27,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:27,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:59:27,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:27,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/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-12-09 00:59:27,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:27,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:59:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:27,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:27,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 00:59:27,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 00:59:27,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 00:59:27,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 00:59:27,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 00:59:27,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 00:59:27,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:27,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-09 00:59:27,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:27,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:27,996 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-12-09 00:59:27,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-09 00:59:28,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:28,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 00:59:28,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 00:59:28,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 8 treesize of output 7 [2018-12-09 00:59:28,029 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-09 00:59:28,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:28,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 00:59:28,056 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-12-09 00:59:28,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-09 00:59:28,068 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,072 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,075 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,083 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:86, output treesize:51 [2018-12-09 00:59:28,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-12-09 00:59:28,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:28,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-12-09 00:59:28,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,141 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 42 treesize of output 37 [2018-12-09 00:59:28,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:28,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-12-09 00:59:28,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:59:28,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2018-12-09 00:59:28,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 54 [2018-12-09 00:59:28,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2018-12-09 00:59:28,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:59:28,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:28,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-09 00:59:28,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:59:28,252 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 31 treesize of output 27 [2018-12-09 00:59:28,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:28,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-09 00:59:28,255 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,258 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-12-09 00:59:28,259 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,263 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2018-12-09 00:59:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:28,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:59:28,578 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:28,579 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:111, output treesize:1 [2018-12-09 00:59:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:28,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:59:28,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 22 [2018-12-09 00:59:28,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:59:28,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 00:59:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:59:28,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=360, Unknown=1, NotChecked=0, Total=462 [2018-12-09 00:59:28,600 INFO L87 Difference]: Start difference. First operand 177 states and 213 transitions. Second operand 17 states. [2018-12-09 00:59:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:59:29,745 INFO L93 Difference]: Finished difference Result 479 states and 565 transitions. [2018-12-09 00:59:29,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 00:59:29,745 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-09 00:59:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:59:29,746 INFO L225 Difference]: With dead ends: 479 [2018-12-09 00:59:29,746 INFO L226 Difference]: Without dead ends: 387 [2018-12-09 00:59:29,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=989, Unknown=2, NotChecked=0, Total=1332 [2018-12-09 00:59:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-09 00:59:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 213. [2018-12-09 00:59:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-09 00:59:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 254 transitions. [2018-12-09 00:59:29,759 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 254 transitions. Word has length 40 [2018-12-09 00:59:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:59:29,760 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 254 transitions. [2018-12-09 00:59:29,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 00:59:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 254 transitions. [2018-12-09 00:59:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:59:29,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:59:29,760 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:59:29,761 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:59:29,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:29,761 INFO L82 PathProgramCache]: Analyzing trace with hash -427010471, now seen corresponding path program 1 times [2018-12-09 00:59:29,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:59:29,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:29,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:29,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:59:29,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:59:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:30,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:30,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:59:30,009 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-09 00:59:30,009 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [15], [19], [24], [29], [33], [36], [46], [50], [55], [60], [63], [65], [75], [79], [92], [96], [101], [104], [110], [115], [123], [127], [135], [145], [149], [161], [170], [173], [185], [189], [196], [199], [200], [336], [337], [338] [2018-12-09 00:59:30,010 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:59:30,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:59:30,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:59:30,038 INFO L272 AbstractInterpreter]: Visited 39 different actions 43 times. Merged at 3 different actions 3 times. Never widened. Performed 307 root evaluator evaluations with a maximum evaluation depth of 3. Performed 307 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 48 variables. [2018-12-09 00:59:30,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:59:30,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:59:30,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:59:30,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/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-12-09 00:59:30,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:59:30,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:59:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:59:30,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:59:30,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 00:59:30,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 00:59:30,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 00:59:30,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 273 [2018-12-09 00:59:30,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 00:59:30,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 244 [2018-12-09 00:59:30,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-09 00:59:30,181 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,192 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:30,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 241 [2018-12-09 00:59:30,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 83 [2018-12-09 00:59:30,202 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,211 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,219 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 116 [2018-12-09 00:59:30,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 00:59:30,292 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2018-12-09 00:59:30,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-09 00:59:30,317 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2018-12-09 00:59:30,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-12-09 00:59:30,334 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,341 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,347 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,352 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,363 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:362, output treesize:99 [2018-12-09 00:59:30,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,416 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 22 treesize of output 25 [2018-12-09 00:59:30,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,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, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 96 [2018-12-09 00:59:30,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 108 [2018-12-09 00:59:30,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,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, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 105 [2018-12-09 00:59:30,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:59:30,481 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,493 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2018-12-09 00:59:30,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,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 35 treesize of output 44 [2018-12-09 00:59:30,531 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 75 treesize of output 100 [2018-12-09 00:59:30,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 00:59:30,549 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,558 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,565 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,578 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:161, output treesize:122 [2018-12-09 00:59:30,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 157 [2018-12-09 00:59:30,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select 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 35 [2018-12-09 00:59:30,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 94 treesize of output 113 [2018-12-09 00:59:30,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2018-12-09 00:59:30,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:30,684 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:162, output treesize:138 [2018-12-09 00:59:30,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:30,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 127 [2018-12-09 00:59:30,800 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 106 [2018-12-09 00:59:30,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 54 dim-0 vars, End of recursive call: 54 dim-0 vars, and 15 xjuncts. [2018-12-09 00:59:31,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 103 [2018-12-09 00:59:31,152 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:31,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2018-12-09 00:59:31,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:31,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 107 [2018-12-09 00:59:31,166 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:31,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 89 [2018-12-09 00:59:31,182 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:31,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 99 [2018-12-09 00:59:31,188 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:31,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,195 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 93 [2018-12-09 00:59:31,196 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:31,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 107 [2018-12-09 00:59:31,204 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:31,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,212 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 103 [2018-12-09 00:59:31,212 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:31,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2018-12-09 00:59:31,215 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:31,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 99 [2018-12-09 00:59:31,220 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:31,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,227 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 103 [2018-12-09 00:59:31,228 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:31,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,237 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 103 [2018-12-09 00:59:31,238 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:31,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2018-12-09 00:59:31,241 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:31,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,252 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 107 [2018-12-09 00:59:31,253 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:31,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:31,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 99 [2018-12-09 00:59:31,262 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 73 [2018-12-09 00:59:32,897 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2018-12-09 00:59:32,899 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:32,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 81 [2018-12-09 00:59:32,905 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,911 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 85 [2018-12-09 00:59:32,911 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-12-09 00:59:32,913 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:32,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2018-12-09 00:59:32,914 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:32,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 81 [2018-12-09 00:59:32,920 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,926 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 85 [2018-12-09 00:59:32,927 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-12-09 00:59:32,929 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:32,932 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-12-09 00:59:32,932 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:32,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 87 [2018-12-09 00:59:32,939 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,947 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 91 [2018-12-09 00:59:32,948 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2018-12-09 00:59:32,950 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:32,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 87 [2018-12-09 00:59:32,956 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 73 [2018-12-09 00:59:32,963 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 81 [2018-12-09 00:59:32,969 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,974 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 91 [2018-12-09 00:59:32,975 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,980 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 91 [2018-12-09 00:59:32,981 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,986 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 85 [2018-12-09 00:59:32,987 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:32,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-12-09 00:59:32,990 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:32,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2018-12-09 00:59:32,992 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:32,997 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 91 [2018-12-09 00:59:32,998 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:33,003 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 85 [2018-12-09 00:59:33,004 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:33,006 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2018-12-09 00:59:33,007 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:33,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 87 [2018-12-09 00:59:33,013 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:34,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 62 dim-0 vars, and 31 xjuncts. [2018-12-09 00:59:34,995 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-12-09 00:59:34,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:34,997 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,005 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,008 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,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, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2018-12-09 00:59:35,013 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,013 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 00:59:35,024 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,029 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,033 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 75 treesize of output 71 [2018-12-09 00:59:35,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,036 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,046 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,051 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,054 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 75 treesize of output 67 [2018-12-09 00:59:35,055 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,056 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 00:59:35,066 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,070 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,073 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 75 treesize of output 71 [2018-12-09 00:59:35,075 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-09 00:59:35,075 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 00:59:35,085 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,090 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,093 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 67 [2018-12-09 00:59:35,094 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,095 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 00:59:35,107 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,114 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,117 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-12-09 00:59:35,118 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,119 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 00:59:35,128 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,131 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,134 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-12-09 00:59:35,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,136 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,143 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,147 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,153 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 75 treesize of output 71 [2018-12-09 00:59:35,155 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,156 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 00:59:35,166 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,170 INFO L267 ElimStorePlain]: Start of recursive call 68: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,173 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 75 treesize of output 71 [2018-12-09 00:59:35,175 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,176 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 00:59:35,186 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,191 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,194 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 75 treesize of output 71 [2018-12-09 00:59:35,196 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,196 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 00:59:35,208 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,213 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,216 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-12-09 00:59:35,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,217 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,226 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,230 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,233 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 75 treesize of output 67 [2018-12-09 00:59:35,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,235 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,244 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,248 INFO L267 ElimStorePlain]: Start of recursive call 80: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,251 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 67 [2018-12-09 00:59:35,252 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,253 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 00:59:35,263 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,267 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-12-09 00:59:35,272 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-09 00:59:35,272 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 00:59:35,283 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,289 INFO L267 ElimStorePlain]: Start of recursive call 86: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,292 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 75 treesize of output 71 [2018-12-09 00:59:35,293 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,294 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 00:59:35,304 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,309 INFO L267 ElimStorePlain]: Start of recursive call 89: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,312 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-12-09 00:59:35,314 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-09 00:59:35,314 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 00:59:35,325 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,329 INFO L267 ElimStorePlain]: Start of recursive call 92: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,332 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 75 treesize of output 67 [2018-12-09 00:59:35,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,333 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,344 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,348 INFO L267 ElimStorePlain]: Start of recursive call 95: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,351 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 75 treesize of output 71 [2018-12-09 00:59:35,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,353 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,363 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,368 INFO L267 ElimStorePlain]: Start of recursive call 98: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,371 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 75 treesize of output 67 [2018-12-09 00:59:35,373 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,373 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 00:59:35,383 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,388 INFO L267 ElimStorePlain]: Start of recursive call 101: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,391 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-12-09 00:59:35,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,393 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,401 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,406 INFO L267 ElimStorePlain]: Start of recursive call 104: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,409 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 75 treesize of output 63 [2018-12-09 00:59:35,411 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,412 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 00:59:35,421 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,426 INFO L267 ElimStorePlain]: Start of recursive call 107: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,430 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-12-09 00:59:35,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,432 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,440 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,444 INFO L267 ElimStorePlain]: Start of recursive call 110: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,446 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-12-09 00:59:35,448 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,449 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 00:59:35,458 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,462 INFO L267 ElimStorePlain]: Start of recursive call 113: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 75 [2018-12-09 00:59:35,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,468 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,478 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,486 INFO L267 ElimStorePlain]: Start of recursive call 116: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,489 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 55 [2018-12-09 00:59:35,491 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-09 00:59:35,492 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 00:59:35,499 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,503 INFO L267 ElimStorePlain]: Start of recursive call 119: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,509 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-12-09 00:59:35,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,511 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,518 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,523 INFO L267 ElimStorePlain]: Start of recursive call 122: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,525 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 75 treesize of output 71 [2018-12-09 00:59:35,528 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:59:35,529 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 00:59:35,541 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,545 INFO L267 ElimStorePlain]: Start of recursive call 125: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,548 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-12-09 00:59:35,550 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-09 00:59:35,550 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 00:59:35,559 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,565 INFO L267 ElimStorePlain]: Start of recursive call 128: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,569 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 75 treesize of output 71 [2018-12-09 00:59:35,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-09 00:59:35,570 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:59:35,580 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,584 INFO L267 ElimStorePlain]: Start of recursive call 131: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,587 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 75 treesize of output 67 [2018-12-09 00:59:35,589 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:35,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-09 00:59:35,590 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 00:59:35,599 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,604 INFO L267 ElimStorePlain]: Start of recursive call 134: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:35,811 INFO L202 ElimStorePlain]: Needed 136 recursive calls to eliminate 3 variables, input treesize:155, output treesize:7 [2018-12-09 00:59:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:59:35,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:59:38,283 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 2134 treesize of output 1345 [2018-12-09 00:59:38,393 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2018-12-09 00:59:38,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-12-09 00:59:38,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:38,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, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1137 treesize of output 987 [2018-12-09 00:59:38,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1021 treesize of output 1020 [2018-12-09 00:59:38,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:38,641 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,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 964 treesize of output 1016 [2018-12-09 00:59:38,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:38,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:38,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1011 treesize of output 598 [2018-12-09 00:59:38,778 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,781 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,801 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 2 case distinctions, treesize of input 594 treesize of output 520 [2018-12-09 00:59:38,801 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:38,854 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 433 treesize of output 413 [2018-12-09 00:59:38,918 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,919 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,919 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,919 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:38,927 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,927 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 208 [2018-12-09 00:59:38,928 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:38,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:38,950 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,952 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,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, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 415 [2018-12-09 00:59:38,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-12-09 00:59: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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-12-09 00:59:38,960 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:38,968 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:38,982 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,982 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,983 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 387 [2018-12-09 00:59:38,987 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:38,989 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,990 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:38,992 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,010 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 368 treesize of output 1298 [2018-12-09 00:59:39,011 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 00:59:39,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 00:59:39,033 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,034 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,036 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,039 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,042 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 465 treesize of output 447 [2018-12-09 00:59:39,103 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:39,105 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 99 [2018-12-09 00:59:39,105 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,131 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,131 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,132 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,133 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,137 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,142 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,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, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 435 [2018-12-09 00:59:39,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-12-09 00:59:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-12-09 00:59:39,159 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,174 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,190 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,191 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,191 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,192 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,192 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,193 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 407 [2018-12-09 00:59:39,198 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,212 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 19 treesize of output 46 [2018-12-09 00:59:39,213 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,226 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 308 treesize of output 3 [2018-12-09 00:59:39,226 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,231 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,232 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:39,233 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,233 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 56 treesize of output 93 [2018-12-09 00:59:39,234 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,239 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,240 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,244 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,254 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:59:39,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1020 treesize of output 614 [2018-12-09 00:59:39,438 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 601 treesize of output 603 [2018-12-09 00:59:39,449 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,451 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,474 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 2 case distinctions, treesize of input 594 treesize of output 520 [2018-12-09 00:59:39,474 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-12-09 00:59:39,519 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 00:59:39,723 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,724 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 614 treesize of output 584 [2018-12-09 00:59:39,791 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,795 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,795 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,796 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 557 treesize of output 624 [2018-12-09 00:59:39,811 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:39,813 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,814 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 617 treesize of output 664 [2018-12-09 00:59:39,814 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,906 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 577 treesize of output 617 [2018-12-09 00:59:39,907 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,950 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:59:39,973 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,974 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,974 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,975 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:59:39,977 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,978 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,985 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,986 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:39,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 598 treesize of output 632 [2018-12-09 00:59:39,992 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:40,000 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:40,000 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:40,002 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:40,004 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:59:40,075 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 538 treesize of output 470 [2018-12-09 00:59:40,075 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 01:00:54,271 WARN L180 SmtUtils]: Spent 1.23 m on a formula simplification. DAG size of input: 3218 DAG size of output: 2014 [2018-12-09 01:00:54,276 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:00:54,277 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:00:54,278 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:00:54,279 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:00:54,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 376 treesize of output 399 [2018-12-09 01:00:54,290 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-12-09 01:00:59,163 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:00:59,163 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:00:59,164 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:00:59,165 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:00:59,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 357 treesize of output 387 [2018-12-09 01:00:59,175 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-12-09 01:01:09,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:09,102 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:09,102 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:09,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 371 [2018-12-09 01:01:09,103 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 01:01:11,015 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:11,015 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:11,016 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:11,016 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:11,016 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:11,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 385 [2018-12-09 01:01:11,017 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 01:01:16,850 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:16,850 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:16,851 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:16,851 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:16,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:01:16,852 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:16,852 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:16,853 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:16,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 353 treesize of output 397 [2018-12-09 01:01:16,853 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 01:01:18,641 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:18,641 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:18,642 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:18,643 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:18,643 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:18,643 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:18,644 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:18,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 359 treesize of output 404 [2018-12-09 01:01:18,653 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-12-09 01:01:22,456 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:22,457 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:22,457 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:22,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:01:22,460 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:22,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 375 [2018-12-09 01:01:22,461 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-09 01:01:26,024 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:26,025 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:26,026 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:26,026 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:26,027 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:26,027 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:26,027 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:26,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 371 treesize of output 411 [2018-12-09 01:01:26,037 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-12-09 01:01:29,750 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:29,751 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:29,751 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:29,752 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:29,753 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:29,753 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:29,753 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:29,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 359 treesize of output 404 [2018-12-09 01:01:29,763 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-12-09 01:01:33,537 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:33,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:01:33,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:33,543 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:33,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 376 [2018-12-09 01:01:33,545 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 01:01:42,718 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:42,718 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:42,719 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:42,720 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:42,723 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:42,723 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:42,724 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:42,724 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:42,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 421 [2018-12-09 01:01:42,725 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 01:01:46,203 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:46,203 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:46,204 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:46,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 353 treesize of output 374 [2018-12-09 01:01:46,205 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-09 01:01:49,673 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:49,674 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:49,675 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:49,676 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:49,676 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:49,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 385 [2018-12-09 01:01:49,677 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-09 01:01:54,949 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:54,949 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:54,950 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:54,950 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:54,951 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:54,952 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:54,952 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:54,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 359 treesize of output 404 [2018-12-09 01:01:54,961 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-12-09 01:01:58,628 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:58,628 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:58,631 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:01:58,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 373 treesize of output 404 [2018-12-09 01:01:58,644 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-12-09 01:02:05,816 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:05,817 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:05,817 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:05,818 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:05,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 391 [2018-12-09 01:02:05,821 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:07,575 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:07,575 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:07,576 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:07,576 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:07,584 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:07,586 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:07,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 405 [2018-12-09 01:02:07,589 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:09,381 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:09,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:09,382 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:09,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 357 [2018-12-09 01:02:09,383 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:10,979 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:10,980 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:10,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:10,981 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:10,981 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:10,981 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:10,982 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:10,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 353 treesize of output 394 [2018-12-09 01:02:10,982 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:27,153 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:27,155 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:27,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:27,156 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:27,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 355 treesize of output 378 [2018-12-09 01:02:27,173 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-12-09 01:02:38,032 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:38,033 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:38,034 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:38,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 364 [2018-12-09 01:02:38,034 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:38,460 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:38,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:38,461 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:38,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 353 [2018-12-09 01:02:38,462 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,034 INFO L267 ElimStorePlain]: Start of recursive call 34: 122 dim-0 vars, 92 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:02:39,074 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,075 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,076 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,078 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,079 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 393 treesize of output 422 [2018-12-09 01:02:39,084 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,093 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2018-12-09 01:02:39,094 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:02:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 3 [2018-12-09 01:02:39,117 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,127 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-12-09 01:02:39,128 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,134 INFO L267 ElimStorePlain]: Start of recursive call 57: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,136 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,136 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,136 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,138 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,139 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 426 [2018-12-09 01:02:39,172 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 315 treesize of output 644 [2018-12-09 01:02:39,173 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,190 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-12-09 01:02:39,191 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,201 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,201 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,202 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:39,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-12-09 01:02:39,203 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,210 INFO L267 ElimStorePlain]: Start of recursive call 61: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,221 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:02:39,231 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:02:39,375 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 469 treesize of output 447 [2018-12-09 01:02:39,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:39,430 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,431 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 99 [2018-12-09 01:02:39,431 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,451 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,451 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,452 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,452 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,454 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,455 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,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, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 435 [2018-12-09 01:02:39,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-12-09 01:02:39,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-12-09 01:02:39,461 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,467 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,481 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,481 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,481 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 407 [2018-12-09 01:02:39,508 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 315 treesize of output 644 [2018-12-09 01:02:39,509 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,519 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,519 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:39,520 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,520 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 56 treesize of output 93 [2018-12-09 01:02:39,521 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 01:02:39,528 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,529 INFO L267 ElimStorePlain]: Start of recursive call 70: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,530 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,535 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,537 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 437 treesize of output 413 [2018-12-09 01:02:39,588 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,589 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,590 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,590 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,590 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:39,595 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,596 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 212 [2018-12-09 01:02:39,596 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-12-09 01:02:39,618 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,619 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,620 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:39,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, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 92 [2018-12-09 01:02:39,620 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,625 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,629 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:39,680 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 01:02:39,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 01:02:39,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 01:02:39,923 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 2134 treesize of output 1505 [2018-12-09 01:02:40,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-12-09 01:02:40,022 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1297 treesize of output 1211 [2018-12-09 01:02:40,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1245 treesize of output 1244 [2018-12-09 01:02:40,099 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,212 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,213 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1188 treesize of output 1249 [2018-12-09 01:02:40,214 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:40,344 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1235 treesize of output 1071 [2018-12-09 01:02:40,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:40,350 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 1067 treesize of output 775 [2018-12-09 01:02:40,351 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,374 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 691 treesize of output 689 [2018-12-09 01:02:40,423 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:40,424 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 99 [2018-12-09 01:02:40,424 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 664 treesize of output 662 [2018-12-09 01:02:40,437 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,438 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:40,440 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 658 treesize of output 695 [2018-12-09 01:02:40,440 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,447 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,449 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,458 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,551 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1244 treesize of output 1088 [2018-12-09 01:02:40,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:40,585 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 1071 treesize of output 779 [2018-12-09 01:02:40,585 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,698 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,700 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,701 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1059 treesize of output 1032 [2018-12-09 01:02:40,758 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,761 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,762 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,763 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1011 treesize of output 1094 [2018-12-09 01:02:40,779 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 1079 treesize of output 1119 [2018-12-09 01:02:40,780 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,859 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:40,863 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,864 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 1061 treesize of output 1147 [2018-12-09 01:02:40,864 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,915 INFO L267 ElimStorePlain]: Start of recursive call 92: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:40,954 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,956 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,957 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1048 treesize of output 1016 [2018-12-09 01:02:40,972 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,987 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,988 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:40,988 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:41,096 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 961 treesize of output 693 [2018-12-09 01:02:41,975 WARN L180 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 345 DAG size of output: 158 [2018-12-09 01:02:41,977 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:41,978 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:41,978 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:41,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:41,981 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:41,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 646 treesize of output 646 [2018-12-09 01:02:41,982 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:42,102 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,102 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,103 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,103 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,103 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,103 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 637 treesize of output 637 [2018-12-09 01:02:42,104 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:42,218 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,220 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,220 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:42,222 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 641 treesize of output 637 [2018-12-09 01:02:42,223 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:42,374 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,375 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,379 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 636 treesize of output 631 [2018-12-09 01:02:42,381 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:42,644 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,645 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,646 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,647 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:42,650 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,651 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,652 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 639 treesize of output 648 [2018-12-09 01:02:42,654 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:42,942 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,943 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:42,946 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:42,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 628 treesize of output 627 [2018-12-09 01:02:42,947 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:43,124 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,125 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,126 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,127 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 635 treesize of output 626 [2018-12-09 01:02:43,127 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:43,254 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,255 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,256 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 624 treesize of output 618 [2018-12-09 01:02:43,256 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:43,312 INFO L267 ElimStorePlain]: Start of recursive call 96: 6 dim-0 vars, 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:02:43,372 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-12-09 01:02:43,373 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:43,402 INFO L267 ElimStorePlain]: Start of recursive call 95: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:02:43,425 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:02:43,480 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 737 treesize of output 731 [2018-12-09 01:02:43,521 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,521 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:43,524 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,524 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 58 treesize of output 178 [2018-12-09 01:02:43,524 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:43,546 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,548 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 670 treesize of output 667 [2018-12-09 01:02:43,550 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,550 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,550 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 49 treesize of output 47 [2018-12-09 01:02:43,551 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:43,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 615 treesize of output 619 [2018-12-09 01:02:43,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:02:43,582 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:43,584 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:43,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 616 treesize of output 611 [2018-12-09 01:02:43,586 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:02:43,593 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:43,595 INFO L267 ElimStorePlain]: Start of recursive call 108: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:43,604 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:43,686 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:02:43,795 INFO L267 ElimStorePlain]: Start of recursive call 80: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:02:43,846 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:02:44,002 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 63 treesize of output 54 [2018-12-09 01:02:44,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-12-09 01:02:44,024 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 01:02:44,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 6 [2018-12-09 01:02:44,035 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,037 INFO L267 ElimStorePlain]: Start of recursive call 115: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,043 INFO L267 ElimStorePlain]: Start of recursive call 113: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,045 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 64 treesize of output 55 [2018-12-09 01:02:44,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-12-09 01:02:44,071 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,080 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-09 01:02:44,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-12-09 01:02:44,082 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,084 INFO L267 ElimStorePlain]: Start of recursive call 119: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,090 INFO L267 ElimStorePlain]: Start of recursive call 117: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,247 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 629 treesize of output 320 [2018-12-09 01:02:44,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 01:02:44,283 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,294 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 103 [2018-12-09 01:02:44,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-12-09 01:02:44,301 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-12-09 01:02:44,301 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,306 INFO L267 ElimStorePlain]: Start of recursive call 124: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,318 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 80 [2018-12-09 01:02:44,365 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2018-12-09 01:02:44,366 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,379 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,380 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,380 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,384 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,385 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2018-12-09 01:02:44,389 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,402 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 37 [2018-12-09 01:02:44,403 INFO L267 ElimStorePlain]: Start of recursive call 129: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:02:44,413 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-12-09 01:02:44,414 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,419 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 7 treesize of output 3 [2018-12-09 01:02:44,419 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,425 INFO L267 ElimStorePlain]: Start of recursive call 128: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,427 INFO L267 ElimStorePlain]: Start of recursive call 126: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,429 INFO L267 ElimStorePlain]: Start of recursive call 123: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,434 INFO L267 ElimStorePlain]: Start of recursive call 121: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,437 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 667 treesize of output 338 [2018-12-09 01:02:44,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 01:02:44,494 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:44,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 180 [2018-12-09 01:02:44,550 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 128 [2018-12-09 01:02:44,550 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,562 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:02:44,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 100 [2018-12-09 01:02:44,598 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 01:02:44,598 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,600 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,600 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,601 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-09 01:02:44,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 47 treesize of output 55 [2018-12-09 01:02:44,608 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,612 INFO L267 ElimStorePlain]: Start of recursive call 138: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,617 INFO L267 ElimStorePlain]: Start of recursive call 136: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-09 01:02:44,624 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-12-09 01:02:44,624 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,627 INFO L267 ElimStorePlain]: Start of recursive call 140: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,630 INFO L267 ElimStorePlain]: Start of recursive call 134: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,635 INFO L267 ElimStorePlain]: Start of recursive call 132: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,638 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 633 treesize of output 324 [2018-12-09 01:02:44,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-12-09 01:02:44,675 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,686 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 105 [2018-12-09 01:02:44,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 treesize of output 24 [2018-12-09 01:02:44,693 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,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 24 treesize of output 36 [2018-12-09 01:02:44,693 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,697 INFO L267 ElimStorePlain]: Start of recursive call 145: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,705 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 82 [2018-12-09 01:02:44,748 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2018-12-09 01:02:44,749 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,758 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,758 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,759 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,760 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,761 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 60 treesize of output 60 [2018-12-09 01:02:44,766 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 15 treesize of output 23 [2018-12-09 01:02:44,767 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,774 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:02:44,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2018-12-09 01:02:44,775 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-09 01:02:44,780 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,782 INFO L267 ElimStorePlain]: Start of recursive call 149: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,784 INFO L267 ElimStorePlain]: Start of recursive call 147: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,787 INFO L267 ElimStorePlain]: Start of recursive call 144: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,793 INFO L267 ElimStorePlain]: Start of recursive call 142: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:02:44,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-12-09 01:02:44,852 INFO L202 ElimStorePlain]: Needed 152 recursive calls to eliminate 8 variables, input treesize:4269, output treesize:196 [2018-12-09 01:02:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:02:47,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:02:47,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2018-12-09 01:02:47,078 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:02:47,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 01:02:47,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 01:02:47,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=419, Unknown=3, NotChecked=0, Total=506 [2018-12-09 01:02:47,079 INFO L87 Difference]: Start difference. First operand 213 states and 254 transitions. Second operand 17 states. [2018-12-09 01:02:48,022 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 103 [2018-12-09 01:02:49,774 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2018-12-09 01:02:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:02:50,016 INFO L93 Difference]: Finished difference Result 778 states and 904 transitions. [2018-12-09 01:02:50,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 01:02:50,016 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-09 01:02:50,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:02:50,018 INFO L225 Difference]: With dead ends: 778 [2018-12-09 01:02:50,018 INFO L226 Difference]: Without dead ends: 776 [2018-12-09 01:02:50,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=731, Invalid=2128, Unknown=3, NotChecked=0, Total=2862 [2018-12-09 01:02:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-12-09 01:02:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 249. [2018-12-09 01:02:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-09 01:02:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 296 transitions. [2018-12-09 01:02:50,033 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 296 transitions. Word has length 40 [2018-12-09 01:02:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:02:50,033 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 296 transitions. [2018-12-09 01:02:50,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 01:02:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 296 transitions. [2018-12-09 01:02:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 01:02:50,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:02:50,034 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:02:50,034 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:02:50,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:02:50,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1953426060, now seen corresponding path program 1 times [2018-12-09 01:02:50,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:02:50,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:02:50,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:02:50,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:02:50,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:02:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:02:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:02:50,056 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:02:50,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:02:50 BoogieIcfgContainer [2018-12-09 01:02:50,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:02:50,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:02:50,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:02:50,080 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:02:50,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:59:24" (3/4) ... [2018-12-09 01:02:50,082 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 01:02:50,110 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_97d04f21-848f-469f-aab1-48ae4b60209b/bin-2019/utaipan/witness.graphml [2018-12-09 01:02:50,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:02:50,110 INFO L168 Benchmark]: Toolchain (without parser) took 206498.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 947.0 MB in the beginning and 925.7 MB in the end (delta: 21.3 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:02:50,111 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:02:50,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:02:50,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.06 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-12-09 01:02:50,111 INFO L168 Benchmark]: Boogie Preprocessor took 23.16 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-12-09 01:02:50,111 INFO L168 Benchmark]: RCFGBuilder took 273.66 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: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:02:50,111 INFO L168 Benchmark]: TraceAbstraction took 205871.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.5 MB). Free memory was 1.1 GB in the beginning and 932.9 MB in the end (delta: 140.1 MB). Peak memory consumption was 162.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:02:50,111 INFO L168 Benchmark]: Witness Printer took 30.61 ms. Allocated memory is still 1.2 GB. Free memory was 932.9 MB in the beginning and 925.7 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:02:50,112 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.06 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 23.16 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. * RCFGBuilder took 273.66 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: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 205871.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.5 MB). Free memory was 1.1 GB in the beginning and 932.9 MB in the end (delta: 140.1 MB). Peak memory consumption was 162.6 MB. Max. memory is 11.5 GB. * Witness Printer took 30.61 ms. Allocated memory is still 1.2 GB. Free memory was 932.9 MB in the beginning and 925.7 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={12:0}, list->inner={15:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={15:0}, len=0, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={15:0}, len=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={15:0}, inner->inner={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={12:0}, inner={15:0}, inner->next={0:0}, len=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={12:0}, inner={11:1}, len=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1025] EXPR inner->inner VAL [end={12:0}, inner={11:1}, inner->inner={13:10}, len=2, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={12:0}, inner={11:1}, len=2, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 13 error locations. UNSAFE Result, 205.8s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1769 SDtfs, 3589 SDslu, 3915 SDs, 0 SdLazy, 2283 SolverSat, 356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 301 SyntacticMatches, 20 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 1362 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 199.2s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 879 ConstructedInterpolants, 33 QuantifiedInterpolants, 604974 SizeOfPredicates, 53 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 12/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...