/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:57:40,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:57:40,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:57:40,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:57:40,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:57:40,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:57:40,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:57:40,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:57:40,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:57:40,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:57:40,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:57:40,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:57:40,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:57:40,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:57:40,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:57:40,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:57:40,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:57:40,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:57:40,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:57:40,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:57:40,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:57:40,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:57:40,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:57:40,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:57:40,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:57:40,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:57:40,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:57:40,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:57:40,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:57:40,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:57:40,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:57:40,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:57:40,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:57:40,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:57:40,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:57:40,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:57:40,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:57:40,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:57:40,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:57:40,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:57:40,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:57:40,436 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:57:40,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:57:40,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:57:40,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:57:40,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:57:40,451 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:57:40,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:57:40,451 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:57:40,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:57:40,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:57:40,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:57:40,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:57:40,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:57:40,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:57:40,453 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:57:40,453 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:57:40,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:57:40,453 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:57:40,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:57:40,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:57:40,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:57:40,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:57:40,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:57:40,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:57:40,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:57:40,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:57:40,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:57:40,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:57:40,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:57:40,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:57:40,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:57:40,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:57:40,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:57:40,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:57:40,773 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:57:40,774 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:57:40,774 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2019-11-23 21:57:40,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a631cfd8/51d72d845b5f44c6854bfc30ec024969/FLAG3cb303cab [2019-11-23 21:57:41,383 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:57:41,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2019-11-23 21:57:41,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a631cfd8/51d72d845b5f44c6854bfc30ec024969/FLAG3cb303cab [2019-11-23 21:57:41,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a631cfd8/51d72d845b5f44c6854bfc30ec024969 [2019-11-23 21:57:41,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:57:41,676 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:57:41,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:57:41,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:57:41,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:57:41,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:57:41" (1/1) ... [2019-11-23 21:57:41,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ceb8032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:41, skipping insertion in model container [2019-11-23 21:57:41,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:57:41" (1/1) ... [2019-11-23 21:57:41,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:57:41,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:57:42,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:57:42,220 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:57:42,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:57:42,355 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:57:42,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42 WrapperNode [2019-11-23 21:57:42,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:57:42,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:57:42,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:57:42,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:57:42,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:57:42,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:57:42,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:57:42,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:57:42,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:57:42,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:57:42,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:57:42,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:57:42,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-23 21:57:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:57:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:57:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:57:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:57:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:57:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 21:57:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:57:42,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:57:43,085 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:57:43,085 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-23 21:57:43,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:57:43 BoogieIcfgContainer [2019-11-23 21:57:43,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:57:43,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:57:43,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:57:43,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:57:43,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:57:41" (1/3) ... [2019-11-23 21:57:43,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f030b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:57:43, skipping insertion in model container [2019-11-23 21:57:43,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42" (2/3) ... [2019-11-23 21:57:43,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f030b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:57:43, skipping insertion in model container [2019-11-23 21:57:43,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:57:43" (3/3) ... [2019-11-23 21:57:43,096 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2019-11-23 21:57:43,107 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:57:43,115 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:57:43,129 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:57:43,160 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:57:43,161 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:57:43,161 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:57:43,161 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:57:43,161 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:57:43,162 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:57:43,162 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:57:43,162 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:57:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-23 21:57:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:57:43,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:43,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:43,192 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash -372423763, now seen corresponding path program 1 times [2019-11-23 21:57:43,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:43,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245801603] [2019-11-23 21:57:43,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:43,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245801603] [2019-11-23 21:57:43,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:43,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:57:43,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970193875] [2019-11-23 21:57:43,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:57:43,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:43,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:57:43,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:57:43,396 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2019-11-23 21:57:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:43,419 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2019-11-23 21:57:43,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:57:43,421 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-23 21:57:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:43,433 INFO L225 Difference]: With dead ends: 98 [2019-11-23 21:57:43,433 INFO L226 Difference]: Without dead ends: 43 [2019-11-23 21:57:43,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:57:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-23 21:57:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-23 21:57:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-23 21:57:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2019-11-23 21:57:43,475 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 16 [2019-11-23 21:57:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:43,476 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-11-23 21:57:43,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:57:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2019-11-23 21:57:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 21:57:43,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:43,477 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:43,477 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:43,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1965259271, now seen corresponding path program 1 times [2019-11-23 21:57:43,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:43,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126163351] [2019-11-23 21:57:43,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:43,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126163351] [2019-11-23 21:57:43,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:43,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:57:43,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209529526] [2019-11-23 21:57:43,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:57:43,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:43,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:57:43,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:57:43,555 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 3 states. [2019-11-23 21:57:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:43,591 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-11-23 21:57:43,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:57:43,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 21:57:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:43,594 INFO L225 Difference]: With dead ends: 71 [2019-11-23 21:57:43,594 INFO L226 Difference]: Without dead ends: 51 [2019-11-23 21:57:43,595 INFO L630 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 [2019-11-23 21:57:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-23 21:57:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-23 21:57:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-23 21:57:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-11-23 21:57:43,605 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 21 [2019-11-23 21:57:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:43,605 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-11-23 21:57:43,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:57:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-11-23 21:57:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 21:57:43,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:43,607 INFO L410 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] [2019-11-23 21:57:43,608 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1325693868, now seen corresponding path program 1 times [2019-11-23 21:57:43,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:43,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6099417] [2019-11-23 21:57:43,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:43,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6099417] [2019-11-23 21:57:43,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:43,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:57:43,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134334702] [2019-11-23 21:57:43,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:57:43,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:43,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:57:43,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:57:43,664 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 3 states. [2019-11-23 21:57:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:43,685 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-23 21:57:43,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:57:43,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 21:57:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:43,687 INFO L225 Difference]: With dead ends: 89 [2019-11-23 21:57:43,687 INFO L226 Difference]: Without dead ends: 53 [2019-11-23 21:57:43,688 INFO L630 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 [2019-11-23 21:57:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-23 21:57:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-23 21:57:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-23 21:57:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2019-11-23 21:57:43,696 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 27 [2019-11-23 21:57:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:43,696 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2019-11-23 21:57:43,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:57:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2019-11-23 21:57:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 21:57:43,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:43,698 INFO L410 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] [2019-11-23 21:57:43,698 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:43,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2143342318, now seen corresponding path program 1 times [2019-11-23 21:57:43,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:43,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875754434] [2019-11-23 21:57:43,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:43,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875754434] [2019-11-23 21:57:43,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:43,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:57:43,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945448105] [2019-11-23 21:57:43,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:57:43,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:43,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:57:43,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:43,804 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 5 states. [2019-11-23 21:57:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:43,978 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-11-23 21:57:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:57:43,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-23 21:57:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:43,984 INFO L225 Difference]: With dead ends: 78 [2019-11-23 21:57:43,984 INFO L226 Difference]: Without dead ends: 74 [2019-11-23 21:57:43,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:57:43,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-23 21:57:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2019-11-23 21:57:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-23 21:57:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2019-11-23 21:57:44,003 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 27 [2019-11-23 21:57:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,004 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2019-11-23 21:57:44,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:57:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2019-11-23 21:57:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:57:44,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,009 INFO L410 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] [2019-11-23 21:57:44,011 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1881014477, now seen corresponding path program 1 times [2019-11-23 21:57:44,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172175027] [2019-11-23 21:57:44,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:44,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172175027] [2019-11-23 21:57:44,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:57:44,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660696415] [2019-11-23 21:57:44,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:57:44,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:57:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:44,136 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand 5 states. [2019-11-23 21:57:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,308 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-11-23 21:57:44,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:57:44,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-23 21:57:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,310 INFO L225 Difference]: With dead ends: 80 [2019-11-23 21:57:44,310 INFO L226 Difference]: Without dead ends: 72 [2019-11-23 21:57:44,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:57:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-23 21:57:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2019-11-23 21:57:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-23 21:57:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2019-11-23 21:57:44,318 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 29 [2019-11-23 21:57:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,319 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2019-11-23 21:57:44,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:57:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2019-11-23 21:57:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 21:57:44,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,320 INFO L410 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] [2019-11-23 21:57:44,321 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1389249843, now seen corresponding path program 1 times [2019-11-23 21:57:44,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723183366] [2019-11-23 21:57:44,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:44,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723183366] [2019-11-23 21:57:44,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:57:44,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430595741] [2019-11-23 21:57:44,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:57:44,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:57:44,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:44,398 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand 5 states. [2019-11-23 21:57:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,517 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-11-23 21:57:44,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:57:44,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-23 21:57:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,519 INFO L225 Difference]: With dead ends: 80 [2019-11-23 21:57:44,519 INFO L226 Difference]: Without dead ends: 69 [2019-11-23 21:57:44,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:57:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-23 21:57:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2019-11-23 21:57:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-23 21:57:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-11-23 21:57:44,526 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 29 [2019-11-23 21:57:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,526 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-11-23 21:57:44,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:57:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-11-23 21:57:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 21:57:44,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,528 INFO L410 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] [2019-11-23 21:57:44,528 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,529 INFO L82 PathProgramCache]: Analyzing trace with hash 115063225, now seen corresponding path program 1 times [2019-11-23 21:57:44,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901733577] [2019-11-23 21:57:44,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:44,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901733577] [2019-11-23 21:57:44,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471484914] [2019-11-23 21:57:44,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 21:57:44,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:44,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:57:44,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:44,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:44,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:44,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:57:44,892 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:44,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:57:44,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:44,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:44,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:57:44,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:44,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:44,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:44,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-23 21:57:44,952 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:57:44,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:57:44,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:44,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:44,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:44,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-23 21:57:44,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:57:44,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:44,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:44,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:44,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-23 21:57:45,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:57:45,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:45,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:45,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:45,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-23 21:57:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:45,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:45,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-23 21:57:45,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334985176] [2019-11-23 21:57:45,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:57:45,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:45,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:57:45,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:57:45,073 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 10 states. [2019-11-23 21:57:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:45,432 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2019-11-23 21:57:45,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:57:45,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-23 21:57:45,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:45,435 INFO L225 Difference]: With dead ends: 82 [2019-11-23 21:57:45,435 INFO L226 Difference]: Without dead ends: 78 [2019-11-23 21:57:45,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:57:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-23 21:57:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2019-11-23 21:57:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-23 21:57:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2019-11-23 21:57:45,443 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2019-11-23 21:57:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:45,443 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2019-11-23 21:57:45,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:57:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2019-11-23 21:57:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 21:57:45,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:45,445 INFO L410 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] [2019-11-23 21:57:45,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:45,649 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash 978464889, now seen corresponding path program 1 times [2019-11-23 21:57:45,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:45,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612050170] [2019-11-23 21:57:45,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:45,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612050170] [2019-11-23 21:57:45,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262125216] [2019-11-23 21:57:45,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 21:57:45,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:45,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:57:45,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:45,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:45,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:45,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:57:45,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:45,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:57:45,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:45,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:45,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:57:45,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:45,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:45,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:45,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-23 21:57:45,907 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:57:45,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:57:45,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:45,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:45,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:45,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-23 21:57:45,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:57:45,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:45,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:45,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:45,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-23 21:57:46,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:57:46,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:46,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-23 21:57:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:46,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:46,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-23 21:57:46,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83224158] [2019-11-23 21:57:46,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:57:46,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:46,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:57:46,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:57:46,022 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 10 states. [2019-11-23 21:57:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:46,412 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-11-23 21:57:46,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:57:46,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-23 21:57:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:46,414 INFO L225 Difference]: With dead ends: 93 [2019-11-23 21:57:46,415 INFO L226 Difference]: Without dead ends: 87 [2019-11-23 21:57:46,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:57:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-23 21:57:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-11-23 21:57:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-23 21:57:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-23 21:57:46,423 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 31 [2019-11-23 21:57:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:46,424 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-23 21:57:46,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:57:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-23 21:57:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 21:57:46,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:46,425 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:46,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:46,628 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:46,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:46,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1044710476, now seen corresponding path program 1 times [2019-11-23 21:57:46,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:46,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972351006] [2019-11-23 21:57:46,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:46,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972351006] [2019-11-23 21:57:46,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986620180] [2019-11-23 21:57:46,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 21:57:46,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:46,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:57:46,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:46,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:57:47,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:57:47,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-23 21:57:47,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:57:47,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:57:47,068 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,080 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-23 21:57:47,103 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 2=[|v_#memory_$Pointer$.base_43|, |v_#memory_$Pointer$.offset_41|]} [2019-11-23 21:57:47,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 19 [2019-11-23 21:57:47,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,150 INFO L377 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 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-23 21:57:47,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,181 INFO L567 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-23 21:57:47,185 INFO L377 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 65 treesize of output 49 [2019-11-23 21:57:47,186 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,192 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-23 21:57:47,219 INFO L377 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 39 treesize of output 21 [2019-11-23 21:57:47,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,229 INFO L377 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 23 treesize of output 11 [2019-11-23 21:57:47,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,238 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-23 21:57:47,241 INFO L377 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 7 [2019-11-23 21:57:47,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-23 21:57:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:47,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:47,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-23 21:57:47,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341327977] [2019-11-23 21:57:47,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 21:57:47,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 21:57:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:57:47,250 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-23 21:57:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:47,867 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2019-11-23 21:57:47,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:57:47,868 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2019-11-23 21:57:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:47,869 INFO L225 Difference]: With dead ends: 95 [2019-11-23 21:57:47,869 INFO L226 Difference]: Without dead ends: 91 [2019-11-23 21:57:47,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:57:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-23 21:57:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-23 21:57:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-23 21:57:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2019-11-23 21:57:47,877 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 33 [2019-11-23 21:57:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:47,877 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2019-11-23 21:57:47,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 21:57:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2019-11-23 21:57:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:57:47,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:47,879 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:48,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:48,083 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1104259823, now seen corresponding path program 2 times [2019-11-23 21:57:48,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:48,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130321439] [2019-11-23 21:57:48,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:48,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130321439] [2019-11-23 21:57:48,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139639939] [2019-11-23 21:57:48,304 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:48,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:57:48,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:48,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 21:57:48,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:48,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:57:48,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:57:48,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:57:48,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-23 21:57:48,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:57:48,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:57:48,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,471 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-23 21:57:48,507 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_41|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2019-11-23 21:57:48,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 15 [2019-11-23 21:57:48,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,574 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,574 INFO L377 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 1 case distinctions, treesize of input 94 treesize of output 108 [2019-11-23 21:57:48,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,578 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:57:48,611 INFO L567 ElimStorePlain]: treesize reduction 147, result has 29.7 percent of original size [2019-11-23 21:57:48,616 INFO L377 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 51 treesize of output 41 [2019-11-23 21:57:48,616 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,627 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-23 21:57:48,663 INFO L377 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 31 treesize of output 19 [2019-11-23 21:57:48,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,674 INFO L377 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 19 treesize of output 11 [2019-11-23 21:57:48,675 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,681 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-23 21:57:48,705 INFO L377 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 7 [2019-11-23 21:57:48,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-23 21:57:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:48,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:48,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-23 21:57:48,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674763655] [2019-11-23 21:57:48,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:57:48,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:48,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:57:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:57:48,717 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand 11 states. [2019-11-23 21:57:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:49,244 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2019-11-23 21:57:49,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:57:49,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-23 21:57:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:49,246 INFO L225 Difference]: With dead ends: 97 [2019-11-23 21:57:49,246 INFO L226 Difference]: Without dead ends: 87 [2019-11-23 21:57:49,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:57:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-23 21:57:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2019-11-23 21:57:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-23 21:57:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2019-11-23 21:57:49,254 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2019-11-23 21:57:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:49,254 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2019-11-23 21:57:49,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:57:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2019-11-23 21:57:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:57:49,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:49,256 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:49,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:49,460 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:49,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:49,460 INFO L82 PathProgramCache]: Analyzing trace with hash -973955345, now seen corresponding path program 1 times [2019-11-23 21:57:49,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:49,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359430697] [2019-11-23 21:57:49,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:57:49,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359430697] [2019-11-23 21:57:49,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224281462] [2019-11-23 21:57:49,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:49,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 21:57:49,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:49,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:57:49,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:49,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:57:49,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:49,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:57:49,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:49,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:57:49,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:49,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-23 21:57:49,706 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:57:49,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:57:49,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:49,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-23 21:57:49,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:57:49,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:49,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:49,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-23 21:57:49,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:57:49,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:49,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:49,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-23 21:57:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:57:49,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:49,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-23 21:57:49,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939396857] [2019-11-23 21:57:49,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:57:49,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:49,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:57:49,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:57:49,773 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand 10 states. [2019-11-23 21:57:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:50,074 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2019-11-23 21:57:50,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:57:50,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-11-23 21:57:50,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:50,075 INFO L225 Difference]: With dead ends: 95 [2019-11-23 21:57:50,075 INFO L226 Difference]: Without dead ends: 82 [2019-11-23 21:57:50,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:57:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-23 21:57:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2019-11-23 21:57:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-23 21:57:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2019-11-23 21:57:50,090 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 35 [2019-11-23 21:57:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:50,090 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2019-11-23 21:57:50,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:57:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2019-11-23 21:57:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:57:50,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:50,095 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:50,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:50,301 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:50,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1696962272, now seen corresponding path program 2 times [2019-11-23 21:57:50,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:50,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635158225] [2019-11-23 21:57:50,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:50,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635158225] [2019-11-23 21:57:50,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308683833] [2019-11-23 21:57:50,459 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:50,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:57:50,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:50,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-23 21:57:50,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:50,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:57:50,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:57:50,560 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:57:50,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,603 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-23 21:57:50,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:57:50,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,631 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-23 21:57:50,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:50,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:57:50,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-23 21:57:50,719 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,719 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:57:50,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:57:50,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-23 21:57:50,814 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:57:50,814 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:57:50,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:50,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-23 21:57:50,878 INFO L377 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 26 treesize of output 28 [2019-11-23 21:57:50,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:50,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:50,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-23 21:57:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:50,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:50,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-23 21:57:50,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103326591] [2019-11-23 21:57:50,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 21:57:50,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 21:57:50,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:57:50,980 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand 18 states. [2019-11-23 21:57:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:51,683 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2019-11-23 21:57:51,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 21:57:51,684 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-11-23 21:57:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:51,685 INFO L225 Difference]: With dead ends: 114 [2019-11-23 21:57:51,686 INFO L226 Difference]: Without dead ends: 108 [2019-11-23 21:57:51,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-23 21:57:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-23 21:57:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 85. [2019-11-23 21:57:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-23 21:57:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 113 transitions. [2019-11-23 21:57:51,692 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 113 transitions. Word has length 35 [2019-11-23 21:57:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:51,693 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 113 transitions. [2019-11-23 21:57:51,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 21:57:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2019-11-23 21:57:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:57:51,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:51,694 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:51,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:51,897 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -674253393, now seen corresponding path program 1 times [2019-11-23 21:57:51,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:51,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892523557] [2019-11-23 21:57:51,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:52,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892523557] [2019-11-23 21:57:52,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319393997] [2019-11-23 21:57:52,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:52,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-23 21:57:52,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:52,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:57:52,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:57:52,216 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:57:52,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-23 21:57:52,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:57:52,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:57:52,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,277 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-23 21:57:52,332 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_50|], 2=[|v_#memory_$Pointer$.base_50|, |v_#memory_$Pointer$.offset_45|]} [2019-11-23 21:57:52,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 19 [2019-11-23 21:57:52,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,370 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,370 INFO L377 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 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-23 21:57:52,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:52,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:52,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:52,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:57:52,401 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-23 21:57:52,405 INFO L377 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 65 treesize of output 49 [2019-11-23 21:57:52,406 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,418 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-23 21:57:52,441 INFO L377 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 39 treesize of output 21 [2019-11-23 21:57:52,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,449 INFO L377 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 23 treesize of output 11 [2019-11-23 21:57:52,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,454 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-23 21:57:52,464 INFO L377 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 7 [2019-11-23 21:57:52,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:52,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:52,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-23 21:57:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:52,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:52,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-23 21:57:52,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447096478] [2019-11-23 21:57:52,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 21:57:52,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:52,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 21:57:52,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-23 21:57:52,471 INFO L87 Difference]: Start difference. First operand 85 states and 113 transitions. Second operand 15 states. [2019-11-23 21:57:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:52,978 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2019-11-23 21:57:52,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:57:52,979 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-11-23 21:57:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:52,979 INFO L225 Difference]: With dead ends: 105 [2019-11-23 21:57:52,979 INFO L226 Difference]: Without dead ends: 92 [2019-11-23 21:57:52,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:57:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-23 21:57:52,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2019-11-23 21:57:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-23 21:57:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2019-11-23 21:57:52,983 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 35 [2019-11-23 21:57:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:52,983 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2019-11-23 21:57:52,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 21:57:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2019-11-23 21:57:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 21:57:52,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:52,984 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:53,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:53,190 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1996664224, now seen corresponding path program 1 times [2019-11-23 21:57:53,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:53,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673405276] [2019-11-23 21:57:53,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:53,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673405276] [2019-11-23 21:57:53,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381272741] [2019-11-23 21:57:53,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:53,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-23 21:57:53,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:53,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:57:53,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:53,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:57:53,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:53,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:57:53,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,584 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-23 21:57:53,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 7 [2019-11-23 21:57:53,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:53,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2019-11-23 21:57:53,657 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:57:53,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:57:53,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:53,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2019-11-23 21:57:53,718 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:53,718 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:57:53,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:53,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:57:53,736 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:53,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2019-11-23 21:57:53,788 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:57:53,788 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:57:53,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:53,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:53,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2019-11-23 21:57:53,843 INFO L377 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 26 treesize of output 28 [2019-11-23 21:57:53,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:53,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:53,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-11-23 21:57:53,918 INFO L377 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 29 treesize of output 13 [2019-11-23 21:57:53,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:53,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:53,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-11-23 21:57:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:53,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:53,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-11-23 21:57:53,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203060571] [2019-11-23 21:57:53,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 21:57:53,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 21:57:53,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:57:53,949 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand 20 states. [2019-11-23 21:57:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:54,942 INFO L93 Difference]: Finished difference Result 128 states and 163 transitions. [2019-11-23 21:57:54,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 21:57:54,942 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2019-11-23 21:57:54,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:54,943 INFO L225 Difference]: With dead ends: 128 [2019-11-23 21:57:54,944 INFO L226 Difference]: Without dead ends: 120 [2019-11-23 21:57:54,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 21:57:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-23 21:57:54,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 91. [2019-11-23 21:57:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-23 21:57:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2019-11-23 21:57:54,950 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 35 [2019-11-23 21:57:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:54,951 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2019-11-23 21:57:54,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 21:57:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2019-11-23 21:57:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 21:57:54,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:54,952 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:55,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:55,156 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:55,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1258149093, now seen corresponding path program 3 times [2019-11-23 21:57:55,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:55,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870688261] [2019-11-23 21:57:55,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:55,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870688261] [2019-11-23 21:57:55,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738351512] [2019-11-23 21:57:55,460 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:55,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 21:57:55,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:55,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-23 21:57:55,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:55,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:57:55,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:57:55,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:57:55,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,626 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:57:55,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:57:55,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:57:55,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:57:55,696 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 21:57:55,798 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,798 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:57:55,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,830 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_56|], 2=[|v_#memory_$Pointer$.offset_47|, |v_#memory_$Pointer$.base_54|]} [2019-11-23 21:57:55,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 7 [2019-11-23 21:57:55,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-23 21:57:55,870 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:55,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-23 21:57:55,901 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:55,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:55,920 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:47 [2019-11-23 21:57:55,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 116 [2019-11-23 21:57:55,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-23 21:57:56,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,054 INFO L377 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 1 case distinctions, treesize of input 80 treesize of output 70 [2019-11-23 21:57:56,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,056 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,100 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.5 percent of original size [2019-11-23 21:57:56,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,101 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:83 [2019-11-23 21:57:56,144 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_58|], 5=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_49|]} [2019-11-23 21:57:56,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-11-23 21:57:56,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,200 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2019-11-23 21:57:56,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,248 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 167 [2019-11-23 21:57:56,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:56,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:56,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2019-11-23 21:57:56,366 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 37 [2019-11-23 21:57:56,366 INFO L567 ElimStorePlain]: treesize reduction 826, result has 13.0 percent of original size [2019-11-23 21:57:56,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:57:56,390 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 134 [2019-11-23 21:57:56,392 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,406 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:60 [2019-11-23 21:57:56,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,507 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2019-11-23 21:57:56,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,509 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:56,545 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-23 21:57:56,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:57:56,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:56,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-11-23 21:57:56,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-23 21:57:56,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:56,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:56,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-23 21:57:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:56,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:56,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2019-11-23 21:57:56,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105389213] [2019-11-23 21:57:56,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 21:57:56,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:56,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 21:57:56,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:57:56,627 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand 20 states. [2019-11-23 21:57:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:57,684 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-23 21:57:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:57:57,684 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-11-23 21:57:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:57,685 INFO L225 Difference]: With dead ends: 114 [2019-11-23 21:57:57,685 INFO L226 Difference]: Without dead ends: 110 [2019-11-23 21:57:57,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 21:57:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-23 21:57:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2019-11-23 21:57:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-23 21:57:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2019-11-23 21:57:57,692 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 37 [2019-11-23 21:57:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:57,692 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2019-11-23 21:57:57,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 21:57:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2019-11-23 21:57:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 21:57:57,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:57,693 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:57,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:57,896 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:57,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:57,897 INFO L82 PathProgramCache]: Analyzing trace with hash -207071077, now seen corresponding path program 1 times [2019-11-23 21:57:57,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:57,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392063104] [2019-11-23 21:57:57,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:58,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392063104] [2019-11-23 21:57:58,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947198353] [2019-11-23 21:57:58,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:58,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 21:57:58,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:58,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:57:58,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:58,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:57:58,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:58,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:57:58,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,198 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-23 21:57:58,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 7 [2019-11-23 21:57:58,204 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:58,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2019-11-23 21:57:58,254 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:57:58,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:57:58,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:58,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2019-11-23 21:57:58,297 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:58,298 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:57:58,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:58,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:57:58,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:58,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,324 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2019-11-23 21:57:58,359 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:57:58,360 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:57:58,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:58,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:58,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2019-11-23 21:57:58,422 INFO L377 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 26 treesize of output 28 [2019-11-23 21:57:58,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:58,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:58,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-11-23 21:57:58,469 INFO L377 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 29 treesize of output 13 [2019-11-23 21:57:58,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:58,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:58,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-11-23 21:57:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:58,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:58,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-11-23 21:57:58,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456178933] [2019-11-23 21:57:58,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 21:57:58,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:58,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 21:57:58,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:57:58,498 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand 20 states. [2019-11-23 21:57:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:59,637 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2019-11-23 21:57:59,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:57:59,638 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-11-23 21:57:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:59,639 INFO L225 Difference]: With dead ends: 152 [2019-11-23 21:57:59,639 INFO L226 Difference]: Without dead ends: 144 [2019-11-23 21:57:59,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2019-11-23 21:57:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-23 21:57:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 114. [2019-11-23 21:57:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-23 21:57:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 148 transitions. [2019-11-23 21:57:59,648 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 148 transitions. Word has length 37 [2019-11-23 21:57:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:59,648 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 148 transitions. [2019-11-23 21:57:59,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 21:57:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 148 transitions. [2019-11-23 21:57:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 21:57:59,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:59,649 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:59,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:59,853 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:59,853 INFO L82 PathProgramCache]: Analyzing trace with hash 817631899, now seen corresponding path program 2 times [2019-11-23 21:57:59,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:59,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694723052] [2019-11-23 21:57:59,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:00,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694723052] [2019-11-23 21:58:00,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289536035] [2019-11-23 21:58:00,113 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:00,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:58:00,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:00,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-23 21:58:00,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:00,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:00,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:00,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-23 21:58:00,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-23 21:58:00,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:00,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:00,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,288 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-11-23 21:58:00,314 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_64|], 2=[|v_#memory_$Pointer$.base_60|, |v_#memory_$Pointer$.offset_51|]} [2019-11-23 21:58:00,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 7 [2019-11-23 21:58:00,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:00,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-11-23 21:58:00,349 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-23 21:58:00,372 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,385 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:35 [2019-11-23 21:58:00,443 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_65|], 1=[|v_#memory_$Pointer$.base_61|, |v_#memory_$Pointer$.offset_52|]} [2019-11-23 21:58:00,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-23 21:58:00,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,478 INFO L377 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 1 case distinctions, treesize of input 69 treesize of output 63 [2019-11-23 21:58:00,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,514 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.6 percent of original size [2019-11-23 21:58:00,519 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-23 21:58:00,519 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,536 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:106, output treesize:52 [2019-11-23 21:58:00,573 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_66|, |v_#memory_$Pointer$.base_62|], 5=[|v_#memory_$Pointer$.offset_53|]} [2019-11-23 21:58:00,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 58 [2019-11-23 21:58:00,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,645 INFO L567 ElimStorePlain]: treesize reduction 20, result has 86.3 percent of original size [2019-11-23 21:58:00,670 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,670 INFO L377 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 1 case distinctions, treesize of input 116 treesize of output 118 [2019-11-23 21:58:00,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:00,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:00,676 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:00,749 INFO L567 ElimStorePlain]: treesize reduction 40, result has 64.9 percent of original size [2019-11-23 21:58:00,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,792 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 98 [2019-11-23 21:58:00,793 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:00,816 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:122, output treesize:56 [2019-11-23 21:58:00,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:00,956 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, v_prenex_2], 1=[|#memory_$Pointer$.offset|, v_prenex_3]} [2019-11-23 21:58:00,961 INFO L377 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 66 treesize of output 50 [2019-11-23 21:58:00,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,019 INFO L567 ElimStorePlain]: treesize reduction 8, result has 92.5 percent of original size [2019-11-23 21:58:01,025 INFO L377 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 51 treesize of output 39 [2019-11-23 21:58:01,025 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,058 INFO L377 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 47 treesize of output 35 [2019-11-23 21:58:01,058 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:01,088 INFO L377 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 36 treesize of output 24 [2019-11-23 21:58:01,088 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-23 21:58:01,110 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:126, output treesize:48 [2019-11-23 21:58:01,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:01,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,323 INFO L377 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 22 treesize of output 18 [2019-11-23 21:58:01,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-23 21:58:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:01,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:01,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2019-11-23 21:58:01,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290067215] [2019-11-23 21:58:01,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 21:58:01,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:01,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 21:58:01,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-11-23 21:58:01,358 INFO L87 Difference]: Start difference. First operand 114 states and 148 transitions. Second operand 23 states. [2019-11-23 21:58:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:03,210 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2019-11-23 21:58:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:58:03,210 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2019-11-23 21:58:03,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:03,212 INFO L225 Difference]: With dead ends: 142 [2019-11-23 21:58:03,212 INFO L226 Difference]: Without dead ends: 136 [2019-11-23 21:58:03,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 21:58:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-23 21:58:03,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2019-11-23 21:58:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-23 21:58:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2019-11-23 21:58:03,223 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 37 [2019-11-23 21:58:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:03,224 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2019-11-23 21:58:03,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 21:58:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2019-11-23 21:58:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 21:58:03,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:03,225 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:03,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:03,429 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:03,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2146788202, now seen corresponding path program 4 times [2019-11-23 21:58:03,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:03,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996962529] [2019-11-23 21:58:03,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:03,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996962529] [2019-11-23 21:58:03,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715154530] [2019-11-23 21:58:03,927 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:04,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:58:04,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:04,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-23 21:58:04,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:04,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:04,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:58:04,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:04,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,140 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 21:58:04,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 21:58:04,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:58:04,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:58:04,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2019-11-23 21:58:04,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,262 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-23 21:58:04,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:04,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2019-11-23 21:58:04,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,330 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-23 21:58:04,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2019-11-23 21:58:04,330 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,357 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.7 percent of original size [2019-11-23 21:58:04,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,357 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:92, output treesize:37 [2019-11-23 21:58:04,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-11-23 21:58:04,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,437 INFO L377 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 1 case distinctions, treesize of input 83 treesize of output 79 [2019-11-23 21:58:04,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:04,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:04,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:04,439 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-23 21:58:04,494 INFO L567 ElimStorePlain]: treesize reduction 81, result has 51.5 percent of original size [2019-11-23 21:58:04,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,495 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:93 [2019-11-23 21:58:04,537 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_67|], 6=[|v_#memory_$Pointer$.offset_57|, |v_#memory_$Pointer$.base_66|]} [2019-11-23 21:58:04,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2019-11-23 21:58:04,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 125 [2019-11-23 21:58:04,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,621 INFO L377 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 108 [2019-11-23 21:58:04,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:04,623 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,660 INFO L567 ElimStorePlain]: treesize reduction 80, result has 51.2 percent of original size [2019-11-23 21:58:04,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,661 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:238, output treesize:84 [2019-11-23 21:58:04,785 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:04,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 87 [2019-11-23 21:58:04,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:04,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:04,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:04,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:04,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:04,811 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:04,857 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.6 percent of original size [2019-11-23 21:58:04,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2019-11-23 21:58:04,864 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,873 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:126, output treesize:11 [2019-11-23 21:58:04,904 INFO L377 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 7 [2019-11-23 21:58:04,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-23 21:58:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:04,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:04,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-11-23 21:58:04,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410216820] [2019-11-23 21:58:04,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 21:58:04,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:04,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 21:58:04,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-11-23 21:58:04,917 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand 23 states. [2019-11-23 21:58:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:06,388 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2019-11-23 21:58:06,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 21:58:06,389 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-23 21:58:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:06,390 INFO L225 Difference]: With dead ends: 146 [2019-11-23 21:58:06,390 INFO L226 Difference]: Without dead ends: 140 [2019-11-23 21:58:06,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 21:58:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-23 21:58:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2019-11-23 21:58:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-23 21:58:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2019-11-23 21:58:06,398 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 39 [2019-11-23 21:58:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:06,398 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2019-11-23 21:58:06,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 21:58:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2019-11-23 21:58:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 21:58:06,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:06,399 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:06,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:06,603 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:06,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:06,604 INFO L82 PathProgramCache]: Analyzing trace with hash -785426937, now seen corresponding path program 2 times [2019-11-23 21:58:06,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:06,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348143843] [2019-11-23 21:58:06,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:06,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348143843] [2019-11-23 21:58:06,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750583949] [2019-11-23 21:58:06,802 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:06,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:58:06,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:06,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-23 21:58:06,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:06,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:06,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:06,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:06,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:06,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:06,918 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:06,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:06,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:06,949 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-23 21:58:06,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:06,953 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:06,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:06,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:06,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-23 21:58:06,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:06,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:06,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:07,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-23 21:58:07,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:07,054 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:58:07,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:07,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:07,068 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:07,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-23 21:58:07,114 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:58:07,114 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:58:07,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:07,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:07,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-23 21:58:07,160 INFO L377 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 26 treesize of output 28 [2019-11-23 21:58:07,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:07,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:07,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-11-23 21:58:07,212 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:58:07,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-11-23 21:58:07,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:07,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:07,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-11-23 21:58:07,317 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:07,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 102 [2019-11-23 21:58:07,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,384 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-11-23 21:58:07,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:07,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-11-23 21:58:07,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:07,700 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-11-23 21:58:07,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:07,844 INFO L377 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 29 treesize of output 13 [2019-11-23 21:58:07,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:07,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:07,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-23 21:58:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:07,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:07,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2019-11-23 21:58:07,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907690552] [2019-11-23 21:58:07,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 21:58:07,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:07,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 21:58:07,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-11-23 21:58:07,892 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 23 states. [2019-11-23 21:58:09,453 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-23 21:58:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:09,512 INFO L93 Difference]: Finished difference Result 173 states and 219 transitions. [2019-11-23 21:58:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:58:09,513 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-23 21:58:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:09,514 INFO L225 Difference]: With dead ends: 173 [2019-11-23 21:58:09,514 INFO L226 Difference]: Without dead ends: 163 [2019-11-23 21:58:09,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 21:58:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-23 21:58:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 120. [2019-11-23 21:58:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-23 21:58:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2019-11-23 21:58:09,530 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 155 transitions. Word has length 39 [2019-11-23 21:58:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:09,530 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 155 transitions. [2019-11-23 21:58:09,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 21:58:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 155 transitions. [2019-11-23 21:58:09,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 21:58:09,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:09,532 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:09,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:09,743 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1430480047, now seen corresponding path program 5 times [2019-11-23 21:58:09,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:09,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723972773] [2019-11-23 21:58:09,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:10,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723972773] [2019-11-23 21:58:10,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268879267] [2019-11-23 21:58:10,171 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:10,236 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-23 21:58:10,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:10,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-23 21:58:10,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:10,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:10,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:58:10,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:10,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,332 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 21:58:10,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 21:58:10,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:58:10,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:58:10,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,405 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2019-11-23 21:58:10,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,479 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-23 21:58:10,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:10,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2019-11-23 21:58:10,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,536 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-23 21:58:10,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2019-11-23 21:58:10,537 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,558 INFO L567 ElimStorePlain]: treesize reduction 10, result has 77.3 percent of original size [2019-11-23 21:58:10,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,559 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:89, output treesize:34 [2019-11-23 21:58:10,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,619 INFO L377 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 1 case distinctions, treesize of input 93 treesize of output 83 [2019-11-23 21:58:10,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:10,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:10,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 21:58:10,677 INFO L567 ElimStorePlain]: treesize reduction 91, result has 51.3 percent of original size [2019-11-23 21:58:10,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-11-23 21:58:10,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,701 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:106, output treesize:80 [2019-11-23 21:58:10,746 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_75|], 6=[|v_#memory_$Pointer$.base_72|, |v_#memory_$Pointer$.offset_62|]} [2019-11-23 21:58:10,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2019-11-23 21:58:10,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,836 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 202 treesize of output 175 [2019-11-23 21:58:10,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:10,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:10,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:10,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:10,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:10,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:10,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:10,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:10,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:10,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:10,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:10,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:10,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:10,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:58:10,934 INFO L567 ElimStorePlain]: treesize reduction 1640, result has 8.2 percent of original size [2019-11-23 21:58:10,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 77 [2019-11-23 21:58:10,938 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:10,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:10,950 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:225, output treesize:81 [2019-11-23 21:58:11,053 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:11,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:11,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 84 [2019-11-23 21:58:11,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:11,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:11,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:11,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:11,082 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:11,123 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-11-23 21:58:11,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:11,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2019-11-23 21:58:11,132 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:11,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:11,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:11,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:7 [2019-11-23 21:58:11,144 INFO L377 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 7 [2019-11-23 21:58:11,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:11,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:11,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:11,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-23 21:58:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:11,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:11,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2019-11-23 21:58:11,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984347479] [2019-11-23 21:58:11,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 21:58:11,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:11,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 21:58:11,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:58:11,157 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand 22 states. [2019-11-23 21:58:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:12,471 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2019-11-23 21:58:12,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 21:58:12,471 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-11-23 21:58:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:12,472 INFO L225 Difference]: With dead ends: 138 [2019-11-23 21:58:12,473 INFO L226 Difference]: Without dead ends: 124 [2019-11-23 21:58:12,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2019-11-23 21:58:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-23 21:58:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 100. [2019-11-23 21:58:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-23 21:58:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2019-11-23 21:58:12,479 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 41 [2019-11-23 21:58:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:12,480 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2019-11-23 21:58:12,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 21:58:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2019-11-23 21:58:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 21:58:12,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:12,481 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:12,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:12,684 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash -410760879, now seen corresponding path program 2 times [2019-11-23 21:58:12,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:12,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453692657] [2019-11-23 21:58:12,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 21:58:12,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453692657] [2019-11-23 21:58:12,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213230118] [2019-11-23 21:58:12,801 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:12,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:58:12,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:12,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-23 21:58:12,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:12,872 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:12,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:12,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:12,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,938 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-23 21:58:12,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:12,943 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:12,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:12,955 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-23 21:58:12,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:12,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:12,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:13,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-23 21:58:13,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:13,037 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:58:13,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:13,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:13,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:13,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-23 21:58:13,105 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:58:13,105 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:58:13,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:13,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:13,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-23 21:58:13,149 INFO L377 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 26 treesize of output 28 [2019-11-23 21:58:13,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:13,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:13,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-23 21:58:13,196 INFO L377 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 29 treesize of output 13 [2019-11-23 21:58:13,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:13,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:13,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-23 21:58:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-23 21:58:13,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:13,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-11-23 21:58:13,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504294594] [2019-11-23 21:58:13,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 21:58:13,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 21:58:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:58:13,223 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand 16 states. [2019-11-23 21:58:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:13,861 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2019-11-23 21:58:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 21:58:13,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-11-23 21:58:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:13,863 INFO L225 Difference]: With dead ends: 127 [2019-11-23 21:58:13,863 INFO L226 Difference]: Without dead ends: 112 [2019-11-23 21:58:13,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2019-11-23 21:58:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-23 21:58:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2019-11-23 21:58:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-23 21:58:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2019-11-23 21:58:13,871 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 41 [2019-11-23 21:58:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:13,871 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2019-11-23 21:58:13,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 21:58:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2019-11-23 21:58:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 21:58:13,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:13,872 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:14,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:14,076 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1220890370, now seen corresponding path program 6 times [2019-11-23 21:58:14,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:14,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870556159] [2019-11-23 21:58:14,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:14,369 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2019-11-23 21:58:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:14,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870556159] [2019-11-23 21:58:14,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482043887] [2019-11-23 21:58:14,664 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:14,758 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-23 21:58:14,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:14,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-23 21:58:14,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:14,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:14,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:14,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:14,800 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:14,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:14,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,824 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:58:14,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:58:14,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:14,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:14,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:14,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:14,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 21:58:14,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:14,886 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:58:14,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:14,913 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_81|], 2=[|v_#memory_$Pointer$.offset_64|, |v_#memory_$Pointer$.base_76|]} [2019-11-23 21:58:14,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:58:14,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:14,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-23 21:58:14,951 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:14,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:58:14,974 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:14,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:14,988 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:44 [2019-11-23 21:58:15,014 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_82|], 3=[|v_#memory_$Pointer$.offset_65|, |v_#memory_$Pointer$.base_77|]} [2019-11-23 21:58:15,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:15,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:15,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:15,087 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:15,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 101 [2019-11-23 21:58:15,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,189 INFO L567 ElimStorePlain]: treesize reduction 142, result has 35.2 percent of original size [2019-11-23 21:58:15,193 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:15,197 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:15,211 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:15,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 49 [2019-11-23 21:58:15,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,213 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,305 INFO L567 ElimStorePlain]: treesize reduction 29, result has 68.5 percent of original size [2019-11-23 21:58:15,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,307 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:124, output treesize:61 [2019-11-23 21:58:15,361 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_83|, |v_#memory_$Pointer$.offset_66|], 5=[|v_#memory_$Pointer$.base_78|]} [2019-11-23 21:58:15,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:15,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 21:58:15,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:15,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:15,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:58:15,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:15,487 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-23 21:58:15,487 INFO L377 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 66 treesize of output 60 [2019-11-23 21:58:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,493 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:15,532 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.6 percent of original size [2019-11-23 21:58:15,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,533 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:55 [2019-11-23 21:58:15,576 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_67|], 5=[|v_#memory_$Pointer$.base_79|], 6=[|v_#memory_int_84|]} [2019-11-23 21:58:15,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-11-23 21:58:15,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:15,648 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:15,649 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 153 [2019-11-23 21:58:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,653 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:58:15,740 INFO L567 ElimStorePlain]: treesize reduction 439, result has 26.6 percent of original size [2019-11-23 21:58:15,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:15,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 33 [2019-11-23 21:58:15,747 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:15,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:15,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:15,777 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:183, output treesize:99 [2019-11-23 21:58:15,825 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_80|], 6=[|v_#memory_$Pointer$.offset_68|, |v_#memory_int_85|]} [2019-11-23 21:58:15,862 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:15,863 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 195 [2019-11-23 21:58:15,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:15,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:15,894 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:15,978 INFO L567 ElimStorePlain]: treesize reduction 100, result has 50.0 percent of original size [2019-11-23 21:58:16,018 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:16,019 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 110 [2019-11-23 21:58:16,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:16,086 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-11-23 21:58:16,121 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:16,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 21:58:16,122 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:16,208 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.2 percent of original size [2019-11-23 21:58:16,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:16,212 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:193, output treesize:131 [2019-11-23 21:58:16,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,686 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-23 21:58:16,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:58:16,700 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_14], 1=[|#memory_$Pointer$.base|, v_prenex_10, |#memory_$Pointer$.offset|, v_prenex_13, v_prenex_17], 2=[v_prenex_11, v_prenex_18]} [2019-11-23 21:58:16,707 INFO L377 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 82 treesize of output 74 [2019-11-23 21:58:16,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:16,899 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2019-11-23 21:58:16,901 INFO L567 ElimStorePlain]: treesize reduction 24, result has 93.4 percent of original size [2019-11-23 21:58:16,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:16,913 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 57 [2019-11-23 21:58:16,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:16,915 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:17,084 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-11-23 21:58:17,085 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.7 percent of original size [2019-11-23 21:58:17,098 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:17,098 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 67 [2019-11-23 21:58:17,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:17,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:17,099 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:17,276 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 110 [2019-11-23 21:58:17,277 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.1 percent of original size [2019-11-23 21:58:17,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:17,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2019-11-23 21:58:17,286 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:17,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:17,372 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:17,372 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2019-11-23 21:58:17,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:17,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:17,374 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:17,524 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2019-11-23 21:58:17,524 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.3 percent of original size [2019-11-23 21:58:17,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:17,535 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 74 [2019-11-23 21:58:17,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:17,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:17,537 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:17,703 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-11-23 21:58:17,703 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.9 percent of original size [2019-11-23 21:58:17,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2019-11-23 21:58:17,719 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:17,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:17,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-11-23 21:58:17,796 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:17,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:17,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 8 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2019-11-23 21:58:17,860 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 15 variables, input treesize:372, output treesize:143 [2019-11-23 21:58:18,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:18,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:18,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2019-11-23 21:58:18,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:18,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:18,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:18,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-11-23 21:58:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:18,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:18,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 25 [2019-11-23 21:58:18,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797687501] [2019-11-23 21:58:18,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 21:58:18,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 21:58:18,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2019-11-23 21:58:18,200 INFO L87 Difference]: Start difference. First operand 100 states and 128 transitions. Second operand 25 states. [2019-11-23 21:58:19,785 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-11-23 21:58:19,960 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 73 [2019-11-23 21:58:20,146 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2019-11-23 21:58:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:20,709 INFO L93 Difference]: Finished difference Result 138 states and 171 transitions. [2019-11-23 21:58:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 21:58:20,712 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2019-11-23 21:58:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:20,713 INFO L225 Difference]: With dead ends: 138 [2019-11-23 21:58:20,714 INFO L226 Difference]: Without dead ends: 132 [2019-11-23 21:58:20,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=312, Invalid=1758, Unknown=0, NotChecked=0, Total=2070 [2019-11-23 21:58:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-23 21:58:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113. [2019-11-23 21:58:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-23 21:58:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2019-11-23 21:58:20,722 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 41 [2019-11-23 21:58:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:20,722 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2019-11-23 21:58:20,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 21:58:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2019-11-23 21:58:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 21:58:20,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:20,723 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:20,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:20,927 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash -714780655, now seen corresponding path program 1 times [2019-11-23 21:58:20,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:20,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679986313] [2019-11-23 21:58:20,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:21,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679986313] [2019-11-23 21:58:21,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054807651] [2019-11-23 21:58:21,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:21,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-23 21:58:21,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:21,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:21,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:58:21,416 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:21,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,440 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 21:58:21,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 21:58:21,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:58:21,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:58:21,504 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2019-11-23 21:58:21,563 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,563 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-23 21:58:21,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,593 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_86|], 2=[|v_#memory_$Pointer$.offset_70|, |v_#memory_$Pointer$.base_82|]} [2019-11-23 21:58:21,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 7 [2019-11-23 21:58:21,599 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:21,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2019-11-23 21:58:21,630 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,679 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-23 21:58:21,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2019-11-23 21:58:21,680 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,716 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-11-23 21:58:21,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,717 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:44 [2019-11-23 21:58:21,772 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_87|], 2=[|v_#memory_$Pointer$.offset_71|, |v_#memory_$Pointer$.base_83|]} [2019-11-23 21:58:21,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 17 [2019-11-23 21:58:21,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-11-23 21:58:21,811 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:21,857 INFO L377 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 1 case distinctions, treesize of input 96 treesize of output 86 [2019-11-23 21:58:21,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:21,858 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,904 INFO L567 ElimStorePlain]: treesize reduction 26, result has 79.2 percent of original size [2019-11-23 21:58:21,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:21,905 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:152, output treesize:106 [2019-11-23 21:58:21,950 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_88|], 6=[|v_#memory_$Pointer$.base_84|, |v_#memory_$Pointer$.offset_72|]} [2019-11-23 21:58:21,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2019-11-23 21:58:21,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:22,009 INFO L567 ElimStorePlain]: treesize reduction 20, result has 91.6 percent of original size [2019-11-23 21:58:22,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:22,062 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 185 [2019-11-23 21:58:22,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:22,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:22,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:22,065 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-23 21:58:22,130 INFO L567 ElimStorePlain]: treesize reduction 404, result has 27.3 percent of original size [2019-11-23 21:58:22,155 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:22,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 156 [2019-11-23 21:58:22,157 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:22,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:22,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:22,170 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:77 [2019-11-23 21:58:22,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:22,221 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 50 [2019-11-23 21:58:22,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:22,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:22,223 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:22,254 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.4 percent of original size [2019-11-23 21:58:22,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-11-23 21:58:22,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:22,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:22,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:22,268 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:18 [2019-11-23 21:58:22,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:22,310 INFO L377 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 22 treesize of output 18 [2019-11-23 21:58:22,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:22,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:22,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:22,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-23 21:58:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:58:22,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:22,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-11-23 21:58:22,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033759233] [2019-11-23 21:58:22,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-23 21:58:22,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:22,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-23 21:58:22,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-11-23 21:58:22,342 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. Second operand 23 states. [2019-11-23 21:58:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:23,940 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2019-11-23 21:58:23,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:58:23,941 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2019-11-23 21:58:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:23,942 INFO L225 Difference]: With dead ends: 142 [2019-11-23 21:58:23,942 INFO L226 Difference]: Without dead ends: 120 [2019-11-23 21:58:23,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=219, Invalid=1263, Unknown=0, NotChecked=0, Total=1482 [2019-11-23 21:58:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-23 21:58:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2019-11-23 21:58:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-23 21:58:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2019-11-23 21:58:23,950 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 41 [2019-11-23 21:58:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:23,950 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2019-11-23 21:58:23,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-23 21:58:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2019-11-23 21:58:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 21:58:23,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:23,951 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:24,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:24,154 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:24,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:24,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2102626686, now seen corresponding path program 2 times [2019-11-23 21:58:24,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:24,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542795229] [2019-11-23 21:58:24,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:24,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542795229] [2019-11-23 21:58:24,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997347189] [2019-11-23 21:58:24,568 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:24,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:58:24,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:24,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-23 21:58:24,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:24,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:24,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:24,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:24,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:24,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:24,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:24,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:24,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:24,699 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 21:58:24,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:24,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 21:58:24,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:24,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:24,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:24,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:24,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:24,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:24,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:24,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-23 21:58:24,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:24,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 89 [2019-11-23 21:58:24,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:24,937 INFO L567 ElimStorePlain]: treesize reduction 40, result has 71.0 percent of original size [2019-11-23 21:58:24,938 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_89|], 2=[|v_#memory_$Pointer$.base_86|, |v_#memory_$Pointer$.offset_74|]} [2019-11-23 21:58:24,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 7 [2019-11-23 21:58:24,944 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:24,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:25,002 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:58:25,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2019-11-23 21:58:25,003 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,056 INFO L567 ElimStorePlain]: treesize reduction 8, result has 89.3 percent of original size [2019-11-23 21:58:25,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:58:25,061 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:25,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,084 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:52 [2019-11-23 21:58:25,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:25,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-11-23 21:58:25,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:25,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2019-11-23 21:58:25,182 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:25,234 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:25,235 INFO L377 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 1 case distinctions, treesize of input 100 treesize of output 110 [2019-11-23 21:58:25,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,236 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,292 INFO L567 ElimStorePlain]: treesize reduction 26, result has 80.7 percent of original size [2019-11-23 21:58:25,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,293 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:164, output treesize:117 [2019-11-23 21:58:25,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:25,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-23 21:58:25,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:25,400 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_91|, |v_#memory_$Pointer$.offset_76|], 6=[|v_#memory_$Pointer$.base_88|]} [2019-11-23 21:58:25,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:25,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 21:58:25,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:25,485 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:58:25,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 86 [2019-11-23 21:58:25,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,488 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:25,555 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.0 percent of original size [2019-11-23 21:58:25,620 INFO L343 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2019-11-23 21:58:25,621 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 82 [2019-11-23 21:58:25,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:25,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:25,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,625 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:25,714 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-11-23 21:58:25,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,715 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:166, output treesize:82 [2019-11-23 21:58:25,772 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_77|], 6=[|v_#memory_$Pointer$.base_89|, |v_#memory_int_92|]} [2019-11-23 21:58:25,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:25,792 INFO L377 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 1 case distinctions, treesize of input 284 treesize of output 252 [2019-11-23 21:58:25,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:25,902 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-23 21:58:25,903 INFO L567 ElimStorePlain]: treesize reduction 32, result has 90.0 percent of original size [2019-11-23 21:58:25,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:25,955 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 282 treesize of output 212 [2019-11-23 21:58:25,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:25,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:25,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:25,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:25,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:25,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:25,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:25,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:25,964 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:58:26,127 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-11-23 21:58:26,128 INFO L567 ElimStorePlain]: treesize reduction 4204, result has 6.1 percent of original size [2019-11-23 21:58:26,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:26,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 43 [2019-11-23 21:58:26,135 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:26,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:26,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:26,170 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:307, output treesize:247 [2019-11-23 21:58:26,271 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_93|, |v_#memory_$Pointer$.offset_78|], 12=[|v_#memory_$Pointer$.base_90|]} [2019-11-23 21:58:26,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 90 [2019-11-23 21:58:26,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:26,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:26,363 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:26,364 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 467 treesize of output 410 [2019-11-23 21:58:26,366 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:26,455 INFO L567 ElimStorePlain]: treesize reduction 168, result has 64.3 percent of original size [2019-11-23 21:58:26,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:26,525 INFO L377 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 300 treesize of output 240 [2019-11-23 21:58:26,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:26,540 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:26,746 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-11-23 21:58:26,747 INFO L567 ElimStorePlain]: treesize reduction 6962, result has 3.2 percent of original size [2019-11-23 21:58:26,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:26,748 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:502, output treesize:228 [2019-11-23 21:58:26,870 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-23 21:58:26,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:26,877 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 191 [2019-11-23 21:58:26,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:26,936 INFO L567 ElimStorePlain]: treesize reduction 44, result has 78.4 percent of original size [2019-11-23 21:58:26,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:26,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 95 [2019-11-23 21:58:26,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:26,965 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:27,025 INFO L567 ElimStorePlain]: treesize reduction 44, result has 52.7 percent of original size [2019-11-23 21:58:27,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:27,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:246, output treesize:49 [2019-11-23 21:58:27,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:27,078 INFO L377 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 1 case distinctions, treesize of input 36 treesize of output 24 [2019-11-23 21:58:27,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:27,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:27,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:27,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:56, output treesize:3 [2019-11-23 21:58:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:27,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:27,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2019-11-23 21:58:27,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939850852] [2019-11-23 21:58:27,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 21:58:27,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:27,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 21:58:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2019-11-23 21:58:27,124 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand 27 states. [2019-11-23 21:58:28,457 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-11-23 21:58:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:29,789 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2019-11-23 21:58:29,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 21:58:29,790 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2019-11-23 21:58:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:29,791 INFO L225 Difference]: With dead ends: 152 [2019-11-23 21:58:29,791 INFO L226 Difference]: Without dead ends: 144 [2019-11-23 21:58:29,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=324, Invalid=2028, Unknown=0, NotChecked=0, Total=2352 [2019-11-23 21:58:29,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-23 21:58:29,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 119. [2019-11-23 21:58:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-23 21:58:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2019-11-23 21:58:29,799 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 41 [2019-11-23 21:58:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:29,800 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2019-11-23 21:58:29,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 21:58:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2019-11-23 21:58:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 21:58:29,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:29,800 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:30,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:30,001 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash 798253757, now seen corresponding path program 7 times [2019-11-23 21:58:30,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:30,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505152385] [2019-11-23 21:58:30,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:30,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505152385] [2019-11-23 21:58:30,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914224256] [2019-11-23 21:58:30,595 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:30,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-23 21:58:30,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:30,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:30,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:30,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:30,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:30,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-23 21:58:30,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:30,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:30,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:30,759 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-23 21:58:30,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:30,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-23 21:58:30,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:58:30,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:30,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:30,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-23 21:58:30,811 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:30,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:30,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:30,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-23 21:58:30,928 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:30,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 99 [2019-11-23 21:58:30,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:30,985 INFO L567 ElimStorePlain]: treesize reduction 46, result has 67.1 percent of original size [2019-11-23 21:58:30,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:30,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-23 21:58:30,992 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:31,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,037 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-23 21:58:31,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2019-11-23 21:58:31,038 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:31,073 INFO L567 ElimStorePlain]: treesize reduction 10, result has 82.1 percent of original size [2019-11-23 21:58:31,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:31,074 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:46 [2019-11-23 21:58:31,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-11-23 21:58:31,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:31,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,187 INFO L377 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 1 case distinctions, treesize of input 126 treesize of output 132 [2019-11-23 21:58:31,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,189 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-23 21:58:31,270 INFO L567 ElimStorePlain]: treesize reduction 132, result has 49.6 percent of original size [2019-11-23 21:58:31,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:31,271 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:150, output treesize:142 [2019-11-23 21:58:31,345 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 61 [2019-11-23 21:58:31,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:31,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,381 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_94|], 6=[|v_#memory_$Pointer$.offset_82|, |v_#memory_$Pointer$.base_94|]} [2019-11-23 21:58:31,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 7 [2019-11-23 21:58:31,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:31,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,474 INFO L343 Elim1Store]: treesize reduction 56, result has 45.6 percent of original size [2019-11-23 21:58:31,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 124 [2019-11-23 21:58:31,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,479 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:31,544 INFO L567 ElimStorePlain]: treesize reduction 26, result has 84.3 percent of original size [2019-11-23 21:58:31,610 INFO L343 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-23 21:58:31,611 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 90 [2019-11-23 21:58:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,614 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:31,673 INFO L567 ElimStorePlain]: treesize reduction 36, result has 65.4 percent of original size [2019-11-23 21:58:31,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:31,674 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:188, output treesize:92 [2019-11-23 21:58:31,729 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_95|], 6=[|v_#memory_$Pointer$.base_95|, |v_#memory_$Pointer$.offset_83|]} [2019-11-23 21:58:31,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:31,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 47 [2019-11-23 21:58:31,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:31,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,826 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:31,827 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 315 treesize of output 240 [2019-11-23 21:58:31,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:31,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:31,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2019-11-23 21:58:32,087 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-11-23 21:58:32,087 INFO L567 ElimStorePlain]: treesize reduction 3587, result has 7.6 percent of original size [2019-11-23 21:58:32,130 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:32,131 INFO L377 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 242 [2019-11-23 21:58:32,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,137 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-23 21:58:32,225 INFO L567 ElimStorePlain]: treesize reduction 781, result has 26.0 percent of original size [2019-11-23 21:58:32,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:32,226 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:428, output treesize:311 [2019-11-23 21:58:32,286 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_96|], 6=[|v_#memory_$Pointer$.offset_84|], 12=[|v_#memory_$Pointer$.base_96|]} [2019-11-23 21:58:32,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 96 [2019-11-23 21:58:32,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:32,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:32,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:32,375 INFO L377 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 587 treesize of output 429 [2019-11-23 21:58:32,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:32,446 INFO L567 ElimStorePlain]: treesize reduction 240, result has 65.5 percent of original size [2019-11-23 21:58:32,545 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:32,545 INFO L377 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 456 treesize of output 289 [2019-11-23 21:58:32,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:32,574 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 23 xjuncts. [2019-11-23 21:58:32,822 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 41 [2019-11-23 21:58:32,823 INFO L567 ElimStorePlain]: treesize reduction 18114, result has 1.7 percent of original size [2019-11-23 21:58:32,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:32,824 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:643, output treesize:315 [2019-11-23 21:58:32,973 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-23 21:58:32,981 INFO L377 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 347 treesize of output 190 [2019-11-23 21:58:32,982 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:33,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:33,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:33,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 92 [2019-11-23 21:58:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:33,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:33,033 INFO L496 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:33,262 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2019-11-23 21:58:33,263 INFO L567 ElimStorePlain]: treesize reduction 12, result has 94.1 percent of original size [2019-11-23 21:58:33,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:58:33,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:33,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:33,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:33,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:33,267 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:357, output treesize:105 [2019-11-23 21:58:33,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-23 21:58:33,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:33,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:33,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:33,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-23 21:58:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:33,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:33,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2019-11-23 21:58:33,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728647650] [2019-11-23 21:58:33,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-23 21:58:33,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-23 21:58:33,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-11-23 21:58:33,387 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand 28 states. [2019-11-23 21:58:34,860 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-11-23 21:58:35,248 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-11-23 21:58:35,482 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-11-23 21:58:35,857 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2019-11-23 21:58:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:36,126 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2019-11-23 21:58:36,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 21:58:36,126 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 43 [2019-11-23 21:58:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:36,128 INFO L225 Difference]: With dead ends: 154 [2019-11-23 21:58:36,128 INFO L226 Difference]: Without dead ends: 150 [2019-11-23 21:58:36,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=254, Invalid=1726, Unknown=0, NotChecked=0, Total=1980 [2019-11-23 21:58:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-23 21:58:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2019-11-23 21:58:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-23 21:58:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 163 transitions. [2019-11-23 21:58:36,137 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 163 transitions. Word has length 43 [2019-11-23 21:58:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:36,138 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 163 transitions. [2019-11-23 21:58:36,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-23 21:58:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 163 transitions. [2019-11-23 21:58:36,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 21:58:36,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:36,139 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:36,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:36,341 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1390956206, now seen corresponding path program 3 times [2019-11-23 21:58:36,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:36,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780778908] [2019-11-23 21:58:36,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:58:36,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780778908] [2019-11-23 21:58:36,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57405256] [2019-11-23 21:58:36,608 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:36,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 21:58:36,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:36,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-23 21:58:36,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:37,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:37,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:37,044 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:37,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,077 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-23 21:58:37,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:37,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,105 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-23 21:58:37,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:37,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:37,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-23 21:58:37,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,258 INFO L377 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2019-11-23 21:58:37,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,303 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.1 percent of original size [2019-11-23 21:58:37,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:37,309 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:37,324 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2019-11-23 21:58:37,380 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:58:37,380 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-23 21:58:37,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:37,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:35 [2019-11-23 21:58:37,455 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,455 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:58:37,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,504 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,504 INFO L377 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 21:58:37,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,550 INFO L567 ElimStorePlain]: treesize reduction 40, result has 50.0 percent of original size [2019-11-23 21:58:37,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:37,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:40 [2019-11-23 21:58:37,628 INFO L343 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2019-11-23 21:58:37,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 59 [2019-11-23 21:58:37,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:37,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:37,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:45 [2019-11-23 21:58:37,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:37,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:37,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:37,745 INFO L377 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 44 treesize of output 46 [2019-11-23 21:58:37,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,781 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 100 [2019-11-23 21:58:37,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,883 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-11-23 21:58:37,883 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.6 percent of original size [2019-11-23 21:58:37,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-23 21:58:37,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:96, output treesize:88 [2019-11-23 21:58:37,968 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-23 21:58:37,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-11-23 21:58:37,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:37,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:37,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:37,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-11-23 21:58:38,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:38,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 102 [2019-11-23 21:58:38,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:38,152 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-11-23 21:58:38,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:38,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-11-23 21:58:38,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:38,569 INFO L377 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 29 treesize of output 13 [2019-11-23 21:58:38,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:38,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:38,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:38,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-23 21:58:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:38,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:38,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2019-11-23 21:58:38,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040699516] [2019-11-23 21:58:38,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 21:58:38,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 21:58:38,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2019-11-23 21:58:38,589 INFO L87 Difference]: Start difference. First operand 130 states and 163 transitions. Second operand 27 states. [2019-11-23 21:58:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:39,818 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2019-11-23 21:58:39,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:58:39,818 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2019-11-23 21:58:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:39,820 INFO L225 Difference]: With dead ends: 150 [2019-11-23 21:58:39,820 INFO L226 Difference]: Without dead ends: 146 [2019-11-23 21:58:39,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=287, Invalid=1353, Unknown=0, NotChecked=0, Total=1640 [2019-11-23 21:58:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-23 21:58:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2019-11-23 21:58:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-23 21:58:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 163 transitions. [2019-11-23 21:58:39,830 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 163 transitions. Word has length 43 [2019-11-23 21:58:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:39,830 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 163 transitions. [2019-11-23 21:58:39,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 21:58:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 163 transitions. [2019-11-23 21:58:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 21:58:39,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:39,831 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:40,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:40,036 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1641234179, now seen corresponding path program 1 times [2019-11-23 21:58:40,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:40,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913025386] [2019-11-23 21:58:40,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:40,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913025386] [2019-11-23 21:58:40,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840931318] [2019-11-23 21:58:40,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:40,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-23 21:58:40,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:40,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:40,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:40,554 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,555 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:40,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,586 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:58:40,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:58:40,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:40,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:40,616 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,633 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 21:58:40,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,655 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:58:40,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,684 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_106|], 2=[|v_#memory_$Pointer$.base_100|, |v_#memory_$Pointer$.offset_88|]} [2019-11-23 21:58:40,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:58:40,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:58:40,719 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-23 21:58:40,747 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,763 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:40 [2019-11-23 21:58:40,791 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_107|], 3=[|v_#memory_$Pointer$.base_101|, |v_#memory_$Pointer$.offset_89|]} [2019-11-23 21:58:40,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:40,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:40,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:40,843 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:40,857 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 49 [2019-11-23 21:58:40,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:40,859 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:40,922 INFO L567 ElimStorePlain]: treesize reduction 29, result has 75.8 percent of original size [2019-11-23 21:58:40,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:40,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 101 [2019-11-23 21:58:40,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:40,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:40,952 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:41,033 INFO L567 ElimStorePlain]: treesize reduction 155, result has 30.2 percent of original size [2019-11-23 21:58:41,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:41,034 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:124, output treesize:83 [2019-11-23 21:58:41,065 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_90|, |v_#memory_int_108|], 6=[|v_#memory_$Pointer$.base_102|]} [2019-11-23 21:58:41,089 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:58:41,089 INFO L377 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 1 case distinctions, treesize of input 95 treesize of output 75 [2019-11-23 21:58:41,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:41,140 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.8 percent of original size [2019-11-23 21:58:41,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:41,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 21:58:41,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:41,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:41,222 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-23 21:58:41,222 INFO L377 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 66 treesize of output 60 [2019-11-23 21:58:41,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,225 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:41,269 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.6 percent of original size [2019-11-23 21:58:41,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:41,270 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:55 [2019-11-23 21:58:41,311 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_91|], 5=[|v_#memory_$Pointer$.base_103|], 6=[|v_#memory_int_109|]} [2019-11-23 21:58:41,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2019-11-23 21:58:41,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:41,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:41,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:41,388 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 153 [2019-11-23 21:58:41,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,397 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-23 21:58:41,515 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-11-23 21:58:41,516 INFO L567 ElimStorePlain]: treesize reduction 1346, result has 10.6 percent of original size [2019-11-23 21:58:41,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:41,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 33 [2019-11-23 21:58:41,522 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:41,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:41,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:41,545 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:183, output treesize:99 [2019-11-23 21:58:41,595 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_104|], 6=[|v_#memory_$Pointer$.offset_92|, |v_#memory_int_110|]} [2019-11-23 21:58:41,679 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:41,679 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 195 [2019-11-23 21:58:41,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:41,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:41,711 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:41,814 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-11-23 21:58:41,815 INFO L567 ElimStorePlain]: treesize reduction 100, result has 50.0 percent of original size [2019-11-23 21:58:41,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:41,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 110 [2019-11-23 21:58:41,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:41,917 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.2 percent of original size [2019-11-23 21:58:41,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:41,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 21:58:41,954 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:42,042 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.2 percent of original size [2019-11-23 21:58:42,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:42,046 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:193, output treesize:131 [2019-11-23 21:58:42,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,339 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-23 21:58:42,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-23 21:58:42,344 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_46], 1=[|#memory_$Pointer$.base|, v_prenex_41, |#memory_$Pointer$.offset|, v_prenex_45, v_prenex_37], 2=[v_prenex_42, v_prenex_38]} [2019-11-23 21:58:42,350 INFO L377 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 82 treesize of output 74 [2019-11-23 21:58:42,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:42,538 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2019-11-23 21:58:42,539 INFO L567 ElimStorePlain]: treesize reduction 24, result has 93.4 percent of original size [2019-11-23 21:58:42,550 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:42,551 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 57 [2019-11-23 21:58:42,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,553 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:42,718 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-11-23 21:58:42,719 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.7 percent of original size [2019-11-23 21:58:42,730 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:42,730 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 74 [2019-11-23 21:58:42,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:42,732 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:42,907 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2019-11-23 21:58:42,908 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.5 percent of original size [2019-11-23 21:58:42,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:42,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2019-11-23 21:58:42,917 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:42,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:43,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:43,006 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2019-11-23 21:58:43,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:43,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:43,008 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:43,163 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-11-23 21:58:43,164 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.3 percent of original size [2019-11-23 21:58:43,174 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:43,175 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 67 [2019-11-23 21:58:43,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:43,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:43,177 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:43,325 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2019-11-23 21:58:43,325 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.8 percent of original size [2019-11-23 21:58:43,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-11-23 21:58:43,332 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:43,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:43,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2019-11-23 21:58:43,408 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:43,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:43,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 8 dim-2 vars, End of recursive call: 11 dim-0 vars, and 4 xjuncts. [2019-11-23 21:58:43,468 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 15 variables, input treesize:372, output treesize:143 [2019-11-23 21:58:43,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:43,710 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:43,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2019-11-23 21:58:43,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:43,724 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-23 21:58:43,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:43,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-11-23 21:58:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:43,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:43,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 25 [2019-11-23 21:58:43,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848765150] [2019-11-23 21:58:43,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 21:58:43,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:43,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 21:58:43,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-11-23 21:58:43,737 INFO L87 Difference]: Start difference. First operand 130 states and 163 transitions. Second operand 25 states. [2019-11-23 21:58:45,183 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-11-23 21:58:45,592 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-23 21:58:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:45,835 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2019-11-23 21:58:45,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 21:58:45,835 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 43 [2019-11-23 21:58:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:45,836 INFO L225 Difference]: With dead ends: 155 [2019-11-23 21:58:45,836 INFO L226 Difference]: Without dead ends: 147 [2019-11-23 21:58:45,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=325, Invalid=1837, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 21:58:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-23 21:58:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2019-11-23 21:58:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-23 21:58:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2019-11-23 21:58:45,848 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 43 [2019-11-23 21:58:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:45,848 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2019-11-23 21:58:45,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 21:58:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2019-11-23 21:58:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 21:58:45,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:45,849 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:46,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:46,053 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:46,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:46,053 INFO L82 PathProgramCache]: Analyzing trace with hash -616531203, now seen corresponding path program 3 times [2019-11-23 21:58:46,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:46,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730678180] [2019-11-23 21:58:46,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:46,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730678180] [2019-11-23 21:58:46,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144255029] [2019-11-23 21:58:46,659 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:46,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 21:58:46,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:46,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 83 conjunts are in the unsatisfiable core [2019-11-23 21:58:46,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:46,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:46,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:46,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:46,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:46,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:46,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:46,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:46,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:46,861 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:58:46,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:46,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:58:46,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:46,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:46,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:46,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:46,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:46,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:46,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:46,912 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 21:58:46,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:46,933 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-23 21:58:46,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:46,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:46,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:58:46,961 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:46,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:46,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:58:46,985 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,001 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:73, output treesize:36 [2019-11-23 21:58:47,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,052 INFO L377 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 1 case distinctions, treesize of input 77 treesize of output 67 [2019-11-23 21:58:47,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,088 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-11-23 21:58:47,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:47,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-23 21:58:47,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,113 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:72 [2019-11-23 21:58:47,149 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_111|], 5=[|v_#memory_$Pointer$.base_108|, |v_#memory_$Pointer$.offset_96|]} [2019-11-23 21:58:47,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 7 [2019-11-23 21:58:47,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,239 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-23 21:58:47,240 INFO L377 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 77 treesize of output 67 [2019-11-23 21:58:47,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,243 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:47,304 INFO L567 ElimStorePlain]: treesize reduction 24, result has 75.0 percent of original size [2019-11-23 21:58:47,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:47,310 INFO L377 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 37 treesize of output 24 [2019-11-23 21:58:47,310 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,333 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:116, output treesize:66 [2019-11-23 21:58:47,384 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_112|], 5=[|v_#memory_$Pointer$.base_109|, |v_#memory_$Pointer$.offset_97|]} [2019-11-23 21:58:47,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:47,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 27 [2019-11-23 21:58:47,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,459 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 149 [2019-11-23 21:58:47,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:58:47,545 INFO L567 ElimStorePlain]: treesize reduction 499, result has 24.3 percent of original size [2019-11-23 21:58:47,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:47,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 94 [2019-11-23 21:58:47,551 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,575 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:231, output treesize:123 [2019-11-23 21:58:47,628 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_113|], 5=[|v_#memory_$Pointer$.base_110|], 11=[|v_#memory_$Pointer$.offset_98|]} [2019-11-23 21:58:47,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 104 [2019-11-23 21:58:47,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,723 INFO L567 ElimStorePlain]: treesize reduction 36, result has 87.7 percent of original size [2019-11-23 21:58:47,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,768 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 231 [2019-11-23 21:58:47,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:47,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,804 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:47,894 INFO L567 ElimStorePlain]: treesize reduction 124, result has 49.2 percent of original size [2019-11-23 21:58:47,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:47,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 95 treesize of output 152 [2019-11-23 21:58:47,954 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:47,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:47,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:47,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:47,979 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:249, output treesize:99 [2019-11-23 21:58:47,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:48,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:48,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:48,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:48,329 INFO L392 ElimStorePlain]: Different costs {24=[|#memory_$Pointer$.base|], 41=[|#memory_$Pointer$.offset|]} [2019-11-23 21:58:48,333 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:48,336 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:48,340 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:48,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 89 [2019-11-23 21:58:48,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:48,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:48,342 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:48,345 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:58:48,360 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-23 21:58:48,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 85 [2019-11-23 21:58:48,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:48,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:48,362 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:48,463 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-23 21:58:48,464 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.0 percent of original size [2019-11-23 21:58:48,485 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:48,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2019-11-23 21:58:48,486 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:48,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:48,511 INFO L343 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2019-11-23 21:58:48,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 59 [2019-11-23 21:58:48,513 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:48,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:48,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-23 21:58:48,543 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:274, output treesize:74 [2019-11-23 21:58:48,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:48,795 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:48,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-23 21:58:48,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:48,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:48,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:48,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-23 21:58:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:48,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:48,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2019-11-23 21:58:48,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755983291] [2019-11-23 21:58:48,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 21:58:48,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:48,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 21:58:48,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2019-11-23 21:58:48,855 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand 29 states. [2019-11-23 21:58:50,447 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-11-23 21:58:50,704 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-11-23 21:58:51,164 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-11-23 21:58:51,686 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 120 [2019-11-23 21:58:52,150 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 121 [2019-11-23 21:58:52,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:58:52,514 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2019-11-23 21:58:52,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:58:52,514 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 43 [2019-11-23 21:58:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:58:52,516 INFO L225 Difference]: With dead ends: 155 [2019-11-23 21:58:52,516 INFO L226 Difference]: Without dead ends: 149 [2019-11-23 21:58:52,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=250, Invalid=1912, Unknown=0, NotChecked=0, Total=2162 [2019-11-23 21:58:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-23 21:58:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2019-11-23 21:58:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-23 21:58:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 171 transitions. [2019-11-23 21:58:52,526 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 171 transitions. Word has length 43 [2019-11-23 21:58:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:58:52,526 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 171 transitions. [2019-11-23 21:58:52,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 21:58:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2019-11-23 21:58:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 21:58:52,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:58:52,527 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:58:52,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:52,731 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:58:52,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:58:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1628605512, now seen corresponding path program 8 times [2019-11-23 21:58:52,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:58:52,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964684351] [2019-11-23 21:58:52,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:58:53,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964684351] [2019-11-23 21:58:53,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975818345] [2019-11-23 21:58:53,457 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:53,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:58:53,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:53,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 77 conjunts are in the unsatisfiable core [2019-11-23 21:58:53,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:53,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:58:53,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:53,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:53,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,588 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-23 21:58:53,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-23 21:58:53,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:53,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:58:53,657 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,671 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-23 21:58:53,762 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 89 [2019-11-23 21:58:53,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,833 INFO L567 ElimStorePlain]: treesize reduction 40, result has 68.5 percent of original size [2019-11-23 21:58:53,859 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-23 21:58:53,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2019-11-23 21:58:53,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,907 INFO L567 ElimStorePlain]: treesize reduction 8, result has 88.2 percent of original size [2019-11-23 21:58:53,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-23 21:58:53,912 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:53,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:53,931 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:45 [2019-11-23 21:58:53,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2019-11-23 21:58:53,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:54,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:54,032 INFO L377 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 1 case distinctions, treesize of input 102 treesize of output 112 [2019-11-23 21:58:54,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,086 INFO L567 ElimStorePlain]: treesize reduction 26, result has 81.0 percent of original size [2019-11-23 21:58:54,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,087 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:119 [2019-11-23 21:58:54,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:54,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2019-11-23 21:58:54,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:54,268 INFO L343 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2019-11-23 21:58:54,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 106 [2019-11-23 21:58:54,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,272 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:54,333 INFO L567 ElimStorePlain]: treesize reduction 22, result has 84.6 percent of original size [2019-11-23 21:58:54,392 INFO L343 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2019-11-23 21:58:54,392 INFO L377 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 84 [2019-11-23 21:58:54,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:54,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:54,396 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:54,456 INFO L567 ElimStorePlain]: treesize reduction 32, result has 66.3 percent of original size [2019-11-23 21:58:54,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,457 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:157, output treesize:77 [2019-11-23 21:58:54,549 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:54,550 INFO L377 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 243 treesize of output 226 [2019-11-23 21:58:54,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:54,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:54,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:54,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:54,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-23 21:58:54,676 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-11-23 21:58:54,676 INFO L567 ElimStorePlain]: treesize reduction 1982, result has 11.1 percent of original size [2019-11-23 21:58:54,727 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:54,727 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 210 [2019-11-23 21:58:54,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:54,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,802 INFO L567 ElimStorePlain]: treesize reduction 152, result has 60.2 percent of original size [2019-11-23 21:58:54,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,803 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:266, output treesize:295 [2019-11-23 21:58:54,871 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_114|], 12=[|v_#memory_$Pointer$.base_116|, |v_#memory_$Pointer$.offset_104|]} [2019-11-23 21:58:54,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 75 [2019-11-23 21:58:54,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:54,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:55,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:55,011 INFO L377 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 8 new quantified variables, introduced 6 case distinctions, treesize of input 663 treesize of output 409 [2019-11-23 21:58:55,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,025 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-23 21:58:55,221 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2019-11-23 21:58:55,221 INFO L567 ElimStorePlain]: treesize reduction 12939, result has 3.6 percent of original size [2019-11-23 21:58:55,300 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:55,301 INFO L377 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 8 new quantified variables, introduced 5 case distinctions, treesize of input 470 treesize of output 402 [2019-11-23 21:58:55,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:58:55,304 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:55,378 INFO L567 ElimStorePlain]: treesize reduction 440, result has 37.3 percent of original size [2019-11-23 21:58:55,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:55,378 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:704, output treesize:262 [2019-11-23 21:58:55,744 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:55,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 333 treesize of output 142 [2019-11-23 21:58:55,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:58:55,752 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:55,806 INFO L567 ElimStorePlain]: treesize reduction 76, result has 49.0 percent of original size [2019-11-23 21:58:55,809 INFO L377 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 39 treesize of output 17 [2019-11-23 21:58:55,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:55,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:55,824 INFO L496 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. [2019-11-23 21:58:55,825 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:340, output treesize:18 [2019-11-23 21:58:55,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:55,878 INFO L377 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 22 treesize of output 18 [2019-11-23 21:58:55,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:55,886 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-23 21:58:55,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:55,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-23 21:58:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:58:55,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:58:55,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2019-11-23 21:58:55,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460821953] [2019-11-23 21:58:55,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-23 21:58:55,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:58:55,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-23 21:58:55,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2019-11-23 21:58:55,901 INFO L87 Difference]: Start difference. First operand 137 states and 171 transitions. Second operand 29 states. [2019-11-23 21:58:59,714 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-11-23 21:59:03,123 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-23 21:59:03,321 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-11-23 21:59:03,561 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2019-11-23 21:59:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:59:04,820 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2019-11-23 21:59:04,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 21:59:04,820 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2019-11-23 21:59:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:59:04,822 INFO L225 Difference]: With dead ends: 171 [2019-11-23 21:59:04,822 INFO L226 Difference]: Without dead ends: 163 [2019-11-23 21:59:04,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=278, Invalid=2172, Unknown=0, NotChecked=0, Total=2450 [2019-11-23 21:59:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-23 21:59:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2019-11-23 21:59:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 21:59:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 179 transitions. [2019-11-23 21:59:04,836 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 179 transitions. Word has length 45 [2019-11-23 21:59:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:59:04,836 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 179 transitions. [2019-11-23 21:59:04,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-23 21:59:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2019-11-23 21:59:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 21:59:04,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:59:04,837 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2019-11-23 21:59:05,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:05,041 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:59:05,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:59:05,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1022764905, now seen corresponding path program 9 times [2019-11-23 21:59:05,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:59:05,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275788205] [2019-11-23 21:59:05,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:59:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:59:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:59:05,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275788205] [2019-11-23 21:59:05,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887644005] [2019-11-23 21:59:05,500 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:59:05,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 21:59:05,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:59:05,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 97 conjunts are in the unsatisfiable core [2019-11-23 21:59:05,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:59:05,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2019-11-23 21:59:05,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:05,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:05,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:05,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:59:05,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:05,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:59:05,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:05,757 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:59:05,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:05,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:59:05,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:59:05,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:05,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:05,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-23 21:59:05,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:05,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:05,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:05,854 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-23 21:59:05,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:05,907 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-23 21:59:05,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:05,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:05,940 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_115|], 2=[|v_#memory_$Pointer$.base_118|, |v_#memory_$Pointer$.offset_106|]} [2019-11-23 21:59:05,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 7 [2019-11-23 21:59:05,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:05,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:05,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:05,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-23 21:59:05,983 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:06,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-23 21:59:06,011 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:06,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,030 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:43 [2019-11-23 21:59:06,071 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_116|], 1=[|v_#memory_$Pointer$.base_119|, |v_#memory_$Pointer$.offset_107|]} [2019-11-23 21:59:06,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-23 21:59:06,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:06,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:06,134 INFO L377 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 1 case distinctions, treesize of input 77 treesize of output 67 [2019-11-23 21:59:06,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,135 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,177 INFO L567 ElimStorePlain]: treesize reduction 24, result has 75.8 percent of original size [2019-11-23 21:59:06,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:06,182 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-23 21:59:06,182 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:06,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,203 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:118, output treesize:72 [2019-11-23 21:59:06,255 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_117|], 5=[|v_#memory_$Pointer$.base_120|, |v_#memory_$Pointer$.offset_108|]} [2019-11-23 21:59:06,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:06,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 21:59:06,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:06,347 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-23 21:59:06,348 INFO L377 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 77 treesize of output 67 [2019-11-23 21:59:06,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,351 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:06,408 INFO L567 ElimStorePlain]: treesize reduction 24, result has 75.0 percent of original size [2019-11-23 21:59:06,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:06,413 INFO L377 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 30 treesize of output 21 [2019-11-23 21:59:06,413 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:06,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,432 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:116, output treesize:66 [2019-11-23 21:59:06,483 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_121|, |v_#memory_$Pointer$.offset_109|], 6=[|v_#memory_int_118|]} [2019-11-23 21:59:06,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:06,524 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 164 [2019-11-23 21:59:06,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:06,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:06,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:06,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:06,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-23 21:59:06,732 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-11-23 21:59:06,732 INFO L567 ElimStorePlain]: treesize reduction 1530, result has 10.6 percent of original size [2019-11-23 21:59:06,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:06,744 INFO L377 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 48 treesize of output 42 [2019-11-23 21:59:06,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:06,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:06,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 33 [2019-11-23 21:59:06,780 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:06,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:06,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:06,808 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:194, output treesize:110 [2019-11-23 21:59:06,858 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_122|], 6=[|v_#memory_int_119|], 11=[|v_#memory_$Pointer$.offset_110|]} [2019-11-23 21:59:06,914 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-23 21:59:06,914 INFO L377 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 115 treesize of output 89 [2019-11-23 21:59:06,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:06,919 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:07,005 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.8 percent of original size [2019-11-23 21:59:07,012 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 21:59:07,043 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:07,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-23 21:59:07,044 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:07,136 INFO L567 ElimStorePlain]: treesize reduction 40, result has 70.8 percent of original size [2019-11-23 21:59:07,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:07,214 INFO L343 Elim1Store]: treesize reduction 64, result has 43.9 percent of original size [2019-11-23 21:59:07,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 62 [2019-11-23 21:59:07,215 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:07,298 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.3 percent of original size [2019-11-23 21:59:07,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:07,300 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:154, output treesize:124 [2019-11-23 21:59:07,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,417 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_123|], 13=[|v_#memory_$Pointer$.offset_111|], 15=[|v_#memory_int_120|]} [2019-11-23 21:59:07,476 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:07,476 INFO L377 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 151 treesize of output 160 [2019-11-23 21:59:07,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,484 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:07,518 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:07,519 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 154 [2019-11-23 21:59:07,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:07,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:07,872 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-11-23 21:59:07,872 INFO L567 ElimStorePlain]: treesize reduction 738, result has 31.0 percent of original size [2019-11-23 21:59:07,960 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:07,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 196 [2019-11-23 21:59:07,962 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:07,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:59:07,977 INFO L377 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 202 treesize of output 196 [2019-11-23 21:59:07,977 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:08,229 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 99 [2019-11-23 21:59:08,229 INFO L567 ElimStorePlain]: treesize reduction 62, result has 83.6 percent of original size [2019-11-23 21:59:08,255 INFO L377 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 190 treesize of output 160 [2019-11-23 21:59:08,256 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:08,316 INFO L343 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2019-11-23 21:59:08,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 147 [2019-11-23 21:59:08,318 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:08,522 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-11-23 21:59:08,522 INFO L567 ElimStorePlain]: treesize reduction 32, result has 89.4 percent of original size [2019-11-23 21:59:08,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-23 21:59:08,528 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:366, output treesize:248 [2019-11-23 21:59:08,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,837 INFO L392 ElimStorePlain]: Different costs {50=[|v_#memory_$Pointer$.base_124|], 110=[|v_#memory_int_121|], 124=[|v_#memory_$Pointer$.offset_112|]} [2019-11-23 21:59:08,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:08,920 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 175 [2019-11-23 21:59:08,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:08,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:08,993 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 205 [2019-11-23 21:59:08,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:08,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:08,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:08,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,030 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:09,248 INFO L237 Elim1Store]: Index analysis took 180 ms [2019-11-23 21:59:09,318 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:09,318 INFO L377 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 268 [2019-11-23 21:59:09,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:59:09,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:59:09,674 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:09,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 134 [2019-11-23 21:59:09,842 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.