/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/array-examples/standard_partition_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:31:51,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:31:51,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:31:51,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:31:51,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:31:51,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:31:51,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:31:51,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:31:51,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:31:51,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:31:51,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:31:51,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:31:51,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:31:51,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:31:51,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:31:51,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:31:51,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:31:51,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:31:51,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:31:51,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:31:51,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:31:51,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:31:51,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:31:51,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:31:51,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:31:51,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:31:51,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:31:51,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:31:51,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:31:51,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:31:51,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:31:51,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:31:51,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:31:51,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:31:51,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:31:51,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:31:51,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:31:51,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:31:51,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:31:51,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:31:51,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:31:51,636 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 20:31:51,663 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:31:51,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:31:51,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:31:51,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:31:51,666 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:31:51,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:31:51,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:31:51,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:31:51,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:31:51,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:31:51,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:31:51,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:31:51,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:31:51,670 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:31:51,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:31:51,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:31:51,670 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:31:51,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:31:51,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:31:51,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:31:51,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:31:51,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:31:51,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:31:51,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:31:51,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:31:51,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:31:51,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:31:51,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:31:51,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:31:51,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:31:51,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:31:52,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:31:52,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:31:52,009 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:31:52,009 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:31:52,010 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_ground-1.i [2019-11-23 20:31:52,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d83873f/106aaa603e184ac1b88fc466677a0e66/FLAG03aec3a7d [2019-11-23 20:31:52,544 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:31:52,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_ground-1.i [2019-11-23 20:31:52,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d83873f/106aaa603e184ac1b88fc466677a0e66/FLAG03aec3a7d [2019-11-23 20:31:52,900 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29d83873f/106aaa603e184ac1b88fc466677a0e66 [2019-11-23 20:31:52,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:31:52,911 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:31:52,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:31:52,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:31:52,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:31:52,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:31:52" (1/1) ... [2019-11-23 20:31:52,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2f3eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:52, skipping insertion in model container [2019-11-23 20:31:52,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:31:52" (1/1) ... [2019-11-23 20:31:52,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:31:52,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:31:53,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:31:53,131 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:31:53,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:31:53,177 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:31:53,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53 WrapperNode [2019-11-23 20:31:53,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:31:53,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:31:53,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:31:53,179 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:31:53,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (1/1) ... [2019-11-23 20:31:53,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (1/1) ... [2019-11-23 20:31:53,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:31:53,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:31:53,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:31:53,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:31:53,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (1/1) ... [2019-11-23 20:31:53,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (1/1) ... [2019-11-23 20:31:53,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (1/1) ... [2019-11-23 20:31:53,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (1/1) ... [2019-11-23 20:31:53,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (1/1) ... [2019-11-23 20:31:53,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (1/1) ... [2019-11-23 20:31:53,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (1/1) ... [2019-11-23 20:31:53,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:31:53,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:31:53,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:31:53,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:31:53,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (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 20:31:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:31:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:31:53,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:31:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:31:53,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 20:31:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 20:31:53,706 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:31:53,706 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-23 20:31:53,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:31:53 BoogieIcfgContainer [2019-11-23 20:31:53,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:31:53,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:31:53,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:31:53,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:31:53,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:31:52" (1/3) ... [2019-11-23 20:31:53,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519e2733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:31:53, skipping insertion in model container [2019-11-23 20:31:53,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:31:53" (2/3) ... [2019-11-23 20:31:53,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519e2733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:31:53, skipping insertion in model container [2019-11-23 20:31:53,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:31:53" (3/3) ... [2019-11-23 20:31:53,729 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_partition_ground-1.i [2019-11-23 20:31:53,750 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:31:53,758 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-23 20:31:53,768 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-23 20:31:53,790 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:31:53,790 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:31:53,790 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:31:53,790 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:31:53,790 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:31:53,791 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:31:53,791 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:31:53,791 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:31:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-23 20:31:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 20:31:53,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:31:53,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:31:53,812 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:31:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:31:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash 232427437, now seen corresponding path program 1 times [2019-11-23 20:31:53,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:31:53,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033579622] [2019-11-23 20:31:53,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:31:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:53,944 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 20:31:53,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033579622] [2019-11-23 20:31:53,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:31:53,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:31:53,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584501860] [2019-11-23 20:31:53,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 20:31:53,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:31:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 20:31:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:31:53,962 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-11-23 20:31:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:31:53,977 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2019-11-23 20:31:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 20:31:53,978 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-23 20:31:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:31:53,986 INFO L225 Difference]: With dead ends: 49 [2019-11-23 20:31:53,986 INFO L226 Difference]: Without dead ends: 23 [2019-11-23 20:31:53,989 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 20:31:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-23 20:31:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-23 20:31:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-23 20:31:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-11-23 20:31:54,024 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 9 [2019-11-23 20:31:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:31:54,024 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-11-23 20:31:54,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 20:31:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-11-23 20:31:54,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 20:31:54,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:31:54,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:31:54,026 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:31:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:31:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash -950337193, now seen corresponding path program 1 times [2019-11-23 20:31:54,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:31:54,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604084977] [2019-11-23 20:31:54,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:31:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:54,080 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 20:31:54,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604084977] [2019-11-23 20:31:54,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:31:54,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:31:54,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21053879] [2019-11-23 20:31:54,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:31:54,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:31:54,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:31:54,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:31:54,088 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 3 states. [2019-11-23 20:31:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:31:54,152 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2019-11-23 20:31:54,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:31:54,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-23 20:31:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:31:54,153 INFO L225 Difference]: With dead ends: 47 [2019-11-23 20:31:54,154 INFO L226 Difference]: Without dead ends: 29 [2019-11-23 20:31:54,155 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 20:31:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-23 20:31:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-11-23 20:31:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-23 20:31:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-11-23 20:31:54,161 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 9 [2019-11-23 20:31:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:31:54,162 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-23 20:31:54,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:31:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-11-23 20:31:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 20:31:54,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:31:54,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:31:54,163 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:31:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:31:54,164 INFO L82 PathProgramCache]: Analyzing trace with hash 166796571, now seen corresponding path program 1 times [2019-11-23 20:31:54,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:31:54,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677602232] [2019-11-23 20:31:54,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:31:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:31:54,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677602232] [2019-11-23 20:31:54,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492437587] [2019-11-23 20:31:54,262 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 20:31:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:54,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:31:54,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:31:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:31:54,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:31:54,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-23 20:31:54,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562504446] [2019-11-23 20:31:54,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:31:54,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:31:54,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:31:54,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:31:54,398 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 5 states. [2019-11-23 20:31:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:31:54,469 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-11-23 20:31:54,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:31:54,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-23 20:31:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:31:54,471 INFO L225 Difference]: With dead ends: 54 [2019-11-23 20:31:54,471 INFO L226 Difference]: Without dead ends: 35 [2019-11-23 20:31:54,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:31:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-23 20:31:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-23 20:31:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-23 20:31:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-23 20:31:54,479 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 15 [2019-11-23 20:31:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:31:54,479 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-23 20:31:54,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:31:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-11-23 20:31:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 20:31:54,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:31:54,481 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:31:54,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:31:54,688 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:31:54,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:31:54,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1231666793, now seen corresponding path program 2 times [2019-11-23 20:31:54,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:31:54,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912526486] [2019-11-23 20:31:54,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:31:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:31:54,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912526486] [2019-11-23 20:31:54,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649450975] [2019-11-23 20:31:54,782 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 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 20:31:54,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-23 20:31:54,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:31:54,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:31:54,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:31:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 20:31:54,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:31:54,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-23 20:31:54,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862018070] [2019-11-23 20:31:54,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:31:54,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:31:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:31:54,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:31:54,866 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 4 states. [2019-11-23 20:31:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:31:54,893 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2019-11-23 20:31:54,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:31:54,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-23 20:31:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:31:54,895 INFO L225 Difference]: With dead ends: 66 [2019-11-23 20:31:54,895 INFO L226 Difference]: Without dead ends: 53 [2019-11-23 20:31:54,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:31:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-23 20:31:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2019-11-23 20:31:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-23 20:31:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2019-11-23 20:31:54,904 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 21 [2019-11-23 20:31:54,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:31:54,904 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-23 20:31:54,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:31:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2019-11-23 20:31:54,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 20:31:54,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:31:54,906 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:31:55,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:31:55,109 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:31:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:31:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash 48196885, now seen corresponding path program 1 times [2019-11-23 20:31:55,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:31:55,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333938837] [2019-11-23 20:31:55,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:31:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:31:55,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333938837] [2019-11-23 20:31:55,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181589751] [2019-11-23 20:31:55,193 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 20:31:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:55,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:31:55,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:31:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 20:31:55,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:31:55,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-23 20:31:55,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222164940] [2019-11-23 20:31:55,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:31:55,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:31:55,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:31:55,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:31:55,276 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand 6 states. [2019-11-23 20:31:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:31:55,364 INFO L93 Difference]: Finished difference Result 98 states and 129 transitions. [2019-11-23 20:31:55,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:31:55,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-23 20:31:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:31:55,367 INFO L225 Difference]: With dead ends: 98 [2019-11-23 20:31:55,367 INFO L226 Difference]: Without dead ends: 66 [2019-11-23 20:31:55,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:31:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-23 20:31:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2019-11-23 20:31:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-23 20:31:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2019-11-23 20:31:55,376 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 21 [2019-11-23 20:31:55,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:31:55,377 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-11-23 20:31:55,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:31:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2019-11-23 20:31:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 20:31:55,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:31:55,378 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:31:55,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:31:55,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:31:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:31:55,582 INFO L82 PathProgramCache]: Analyzing trace with hash -491835875, now seen corresponding path program 2 times [2019-11-23 20:31:55,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:31:55,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604462903] [2019-11-23 20:31:55,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:31:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:31:55,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604462903] [2019-11-23 20:31:55,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777935354] [2019-11-23 20:31:55,686 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 20:31:55,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:31:55,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:31:55,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 20:31:55,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:31:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:31:55,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:31:55,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-23 20:31:55,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857616311] [2019-11-23 20:31:55,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 20:31:55,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:31:55,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 20:31:55,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:31:55,774 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand 7 states. [2019-11-23 20:31:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:31:55,889 INFO L93 Difference]: Finished difference Result 116 states and 153 transitions. [2019-11-23 20:31:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 20:31:55,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-23 20:31:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:31:55,893 INFO L225 Difference]: With dead ends: 116 [2019-11-23 20:31:55,893 INFO L226 Difference]: Without dead ends: 78 [2019-11-23 20:31:55,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:31:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-23 20:31:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2019-11-23 20:31:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-23 20:31:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2019-11-23 20:31:55,910 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 27 [2019-11-23 20:31:55,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:31:55,910 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2019-11-23 20:31:55,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 20:31:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2019-11-23 20:31:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 20:31:55,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:31:55,913 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:31:56,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:31:56,116 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:31:56,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:31:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1359435477, now seen corresponding path program 3 times [2019-11-23 20:31:56,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:31:56,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244837703] [2019-11-23 20:31:56,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:31:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 20:31:56,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244837703] [2019-11-23 20:31:56,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65498313] [2019-11-23 20:31:56,248 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 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 20:31:56,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 20:31:56,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:31:56,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 20:31:56,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:31:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-23 20:31:56,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:31:56,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-23 20:31:56,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685972060] [2019-11-23 20:31:56,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 20:31:56,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:31:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 20:31:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:31:56,360 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand 8 states. [2019-11-23 20:31:56,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:31:56,433 INFO L93 Difference]: Finished difference Result 134 states and 177 transitions. [2019-11-23 20:31:56,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:31:56,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-11-23 20:31:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:31:56,436 INFO L225 Difference]: With dead ends: 134 [2019-11-23 20:31:56,437 INFO L226 Difference]: Without dead ends: 90 [2019-11-23 20:31:56,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:31:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-23 20:31:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2019-11-23 20:31:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-23 20:31:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2019-11-23 20:31:56,453 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 33 [2019-11-23 20:31:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:31:56,454 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2019-11-23 20:31:56,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 20:31:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2019-11-23 20:31:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-23 20:31:56,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:31:56,458 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:31:56,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:31:56,659 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:31:56,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:31:56,660 INFO L82 PathProgramCache]: Analyzing trace with hash 128035293, now seen corresponding path program 4 times [2019-11-23 20:31:56,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:31:56,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236683031] [2019-11-23 20:31:56,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:31:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 20:31:56,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236683031] [2019-11-23 20:31:56,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808188404] [2019-11-23 20:31:56,787 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 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 20:31:56,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:31:56,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:31:56,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 20:31:56,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:31:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 20:31:56,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:31:56,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-11-23 20:31:56,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456115433] [2019-11-23 20:31:56,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 20:31:56,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:31:56,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 20:31:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:31:56,889 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand 9 states. [2019-11-23 20:31:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:31:56,973 INFO L93 Difference]: Finished difference Result 152 states and 201 transitions. [2019-11-23 20:31:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 20:31:56,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-11-23 20:31:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:31:56,975 INFO L225 Difference]: With dead ends: 152 [2019-11-23 20:31:56,975 INFO L226 Difference]: Without dead ends: 102 [2019-11-23 20:31:56,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:31:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-23 20:31:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2019-11-23 20:31:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-23 20:31:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 122 transitions. [2019-11-23 20:31:56,986 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 122 transitions. Word has length 39 [2019-11-23 20:31:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:31:56,986 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 122 transitions. [2019-11-23 20:31:56,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 20:31:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 122 transitions. [2019-11-23 20:31:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 20:31:56,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:31:56,989 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:31:57,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:31:57,193 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:31:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:31:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1662394219, now seen corresponding path program 5 times [2019-11-23 20:31:57,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:31:57,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875404763] [2019-11-23 20:31:57,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:31:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-23 20:31:57,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875404763] [2019-11-23 20:31:57,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081531508] [2019-11-23 20:31:57,323 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 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 20:31:57,485 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-23 20:31:57,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:31:57,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 20:31:57,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:31:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-23 20:31:57,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:31:57,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-23 20:31:57,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95751848] [2019-11-23 20:31:57,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 20:31:57,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:31:57,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 20:31:57,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-23 20:31:57,508 INFO L87 Difference]: Start difference. First operand 94 states and 122 transitions. Second operand 10 states. [2019-11-23 20:31:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:31:57,607 INFO L93 Difference]: Finished difference Result 170 states and 225 transitions. [2019-11-23 20:31:57,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 20:31:57,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-23 20:31:57,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:31:57,609 INFO L225 Difference]: With dead ends: 170 [2019-11-23 20:31:57,609 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 20:31:57,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-23 20:31:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 20:31:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2019-11-23 20:31:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-23 20:31:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2019-11-23 20:31:57,619 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 45 [2019-11-23 20:31:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:31:57,619 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2019-11-23 20:31:57,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 20:31:57,620 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2019-11-23 20:31:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 20:31:57,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:31:57,621 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:31:57,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:31:57,834 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:31:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:31:57,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1210402205, now seen corresponding path program 6 times [2019-11-23 20:31:57,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:31:57,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215025943] [2019-11-23 20:31:57,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:31:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:31:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-23 20:31:57,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215025943] [2019-11-23 20:31:57,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492530658] [2019-11-23 20:31:57,939 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 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 20:31:58,081 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-23 20:31:58,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:31:58,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-23 20:31:58,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:31:58,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:31:58,143 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 23 treesize of output 27 [2019-11-23 20:31:58,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:58,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:31:58,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:31:58,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2019-11-23 20:31:58,265 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 15 treesize of output 11 [2019-11-23 20:31:58,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:58,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:31:58,287 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 20:31:58,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-11-23 20:31:58,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:58,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 27 treesize of output 26 [2019-11-23 20:31:58,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:58,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:31:58,412 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 20:31:58,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:33 [2019-11-23 20:31:58,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:31:58,467 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 27 treesize of output 56 [2019-11-23 20:31:58,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:31:58,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:58,522 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.0 percent of original size [2019-11-23 20:31:58,523 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 20:31:58,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:43 [2019-11-23 20:31:58,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:31:58,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:31:58,669 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 48 treesize of output 77 [2019-11-23 20:31:58,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:31:58,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:58,690 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 42 treesize of output 38 [2019-11-23 20:31:58,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:58,802 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-11-23 20:31:58,804 INFO L567 ElimStorePlain]: treesize reduction 20, result has 82.3 percent of original size [2019-11-23 20:31:58,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-23 20:31:58,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:71 [2019-11-23 20:31:58,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:31:58,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:31:58,888 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:31:58,888 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 56 treesize of output 72 [2019-11-23 20:31:58,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:58,898 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 50 treesize of output 49 [2019-11-23 20:31:58,899 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:58,905 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 50 treesize of output 49 [2019-11-23 20:31:58,907 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:59,042 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-11-23 20:31:59,043 INFO L567 ElimStorePlain]: treesize reduction 28, result has 83.8 percent of original size [2019-11-23 20:31:59,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-23 20:31:59,046 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:157, output treesize:145 [2019-11-23 20:31:59,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:31:59,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 20:31:59,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 63 [2019-11-23 20:31:59,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:59,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:31:59,553 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 20:31:59,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:82, output treesize:78 [2019-11-23 20:31:59,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 82 [2019-11-23 20:31:59,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:59,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:31:59,777 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 20:31:59,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:91 [2019-11-23 20:31:59,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:31:59,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 102 [2019-11-23 20:31:59,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:31:59,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:31:59,983 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 20:31:59,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:103, output treesize:99 [2019-11-23 20:32:00,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:32:00,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:32:00,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:32:00,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:32:00,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:32:00,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 13 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 21 [2019-11-23 20:32:00,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:32:00,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:32:00,140 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 20:32:00,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:87, output treesize:9 [2019-11-23 20:32:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 40 proven. 85 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 20:32:00,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:32:00,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24] total 32 [2019-11-23 20:32:00,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847625935] [2019-11-23 20:32:00,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-23 20:32:00,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:32:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-23 20:32:00,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2019-11-23 20:32:00,200 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand 32 states. [2019-11-23 20:32:00,748 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-23 20:32:01,227 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-11-23 20:32:18,968 WARN L192 SmtUtils]: Spent 17.66 s on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-11-23 20:32:19,204 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-11-23 20:32:37,629 WARN L192 SmtUtils]: Spent 18.12 s on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-11-23 20:32:56,891 WARN L192 SmtUtils]: Spent 18.13 s on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-11-23 20:33:13,706 WARN L192 SmtUtils]: Spent 16.48 s on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-11-23 20:33:15,457 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2019-11-23 20:33:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:23,861 INFO L93 Difference]: Finished difference Result 352 states and 461 transitions. [2019-11-23 20:33:23,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-23 20:33:23,863 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2019-11-23 20:33:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:23,868 INFO L225 Difference]: With dead ends: 352 [2019-11-23 20:33:23,868 INFO L226 Difference]: Without dead ends: 290 [2019-11-23 20:33:23,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1349 ImplicationChecksByTransitivity, 81.2s TimeCoverageRelationStatistics Valid=718, Invalid=3572, Unknown=0, NotChecked=0, Total=4290 [2019-11-23 20:33:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-23 20:33:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 164. [2019-11-23 20:33:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-23 20:33:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 214 transitions. [2019-11-23 20:33:23,910 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 214 transitions. Word has length 51 [2019-11-23 20:33:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:23,911 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 214 transitions. [2019-11-23 20:33:23,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-23 20:33:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2019-11-23 20:33:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 20:33:23,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:23,917 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:24,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:24,118 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:24,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash -109326889, now seen corresponding path program 1 times [2019-11-23 20:33:24,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:24,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791315632] [2019-11-23 20:33:24,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-23 20:33:24,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791315632] [2019-11-23 20:33:24,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92730518] [2019-11-23 20:33:24,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 20:33:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:24,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 20:33:24,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-23 20:33:24,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:24,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-23 20:33:24,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657225633] [2019-11-23 20:33:24,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:33:24,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:33:24,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:33:24,337 INFO L87 Difference]: Start difference. First operand 164 states and 214 transitions. Second operand 12 states. [2019-11-23 20:33:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:24,475 INFO L93 Difference]: Finished difference Result 290 states and 383 transitions. [2019-11-23 20:33:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 20:33:24,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-11-23 20:33:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:24,477 INFO L225 Difference]: With dead ends: 290 [2019-11-23 20:33:24,478 INFO L226 Difference]: Without dead ends: 192 [2019-11-23 20:33:24,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:33:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-23 20:33:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2019-11-23 20:33:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-23 20:33:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2019-11-23 20:33:24,491 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 57 [2019-11-23 20:33:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:24,491 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2019-11-23 20:33:24,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:33:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2019-11-23 20:33:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 20:33:24,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:24,493 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:24,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:24,697 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:24,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 470120091, now seen corresponding path program 2 times [2019-11-23 20:33:24,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:24,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513606929] [2019-11-23 20:33:24,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-23 20:33:24,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513606929] [2019-11-23 20:33:24,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35797251] [2019-11-23 20:33:24,824 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 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 20:33:24,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:33:24,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:24,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 20:33:24,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-23 20:33:24,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:33:24,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-23 20:33:24,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584557271] [2019-11-23 20:33:24,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:33:24,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:33:24,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:33:24,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:33:24,911 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand 13 states. [2019-11-23 20:33:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:33:25,025 INFO L93 Difference]: Finished difference Result 311 states and 411 transitions. [2019-11-23 20:33:25,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:33:25,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-11-23 20:33:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:33:25,027 INFO L225 Difference]: With dead ends: 311 [2019-11-23 20:33:25,027 INFO L226 Difference]: Without dead ends: 207 [2019-11-23 20:33:25,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:33:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-23 20:33:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2019-11-23 20:33:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-23 20:33:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 254 transitions. [2019-11-23 20:33:25,039 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 254 transitions. Word has length 63 [2019-11-23 20:33:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:33:25,039 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 254 transitions. [2019-11-23 20:33:25,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:33:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2019-11-23 20:33:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-23 20:33:25,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:33:25,040 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:33:25,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:33:25,243 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:33:25,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:33:25,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2025811479, now seen corresponding path program 3 times [2019-11-23 20:33:25,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:33:25,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080756050] [2019-11-23 20:33:25,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:33:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:33:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-23 20:33:25,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080756050] [2019-11-23 20:33:25,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687318603] [2019-11-23 20:33:25,366 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 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 20:33:26,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-23 20:33:26,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:33:26,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:33:26,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:33:26,193 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:26,193 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 23 treesize of output 27 [2019-11-23 20:33:26,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:26,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:26,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:33:26,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2019-11-23 20:33:26,281 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 31 treesize of output 22 [2019-11-23 20:33:26,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:26,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:26,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 20:33:26,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2019-11-23 20:33:26,346 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:26,347 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 46 treesize of output 59 [2019-11-23 20:33:26,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:26,382 INFO L567 ElimStorePlain]: treesize reduction 32, result has 65.2 percent of original size [2019-11-23 20:33:26,383 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 20:33:26,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:60 [2019-11-23 20:33:26,466 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:26,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 140 [2019-11-23 20:33:26,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:26,531 INFO L567 ElimStorePlain]: treesize reduction 112, result has 42.6 percent of original size [2019-11-23 20:33:26,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:26,534 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 20:33:26,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:83 [2019-11-23 20:33:26,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:26,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:26,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 140 [2019-11-23 20:33:26,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:26,683 INFO L567 ElimStorePlain]: treesize reduction 120, result has 42.0 percent of original size [2019-11-23 20:33:26,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:26,685 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 20:33:26,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:87 [2019-11-23 20:33:26,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:26,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:26,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 140 [2019-11-23 20:33:26,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:26,842 INFO L567 ElimStorePlain]: treesize reduction 120, result has 42.0 percent of original size [2019-11-23 20:33:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:26,845 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 20:33:26,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:87 [2019-11-23 20:33:26,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:26,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:26,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 140 [2019-11-23 20:33:26,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:27,012 INFO L567 ElimStorePlain]: treesize reduction 120, result has 42.0 percent of original size [2019-11-23 20:33:27,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:27,014 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 20:33:27,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:87 [2019-11-23 20:33:27,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:27,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:27,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 140 [2019-11-23 20:33:27,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:27,147 INFO L567 ElimStorePlain]: treesize reduction 112, result has 42.6 percent of original size [2019-11-23 20:33:27,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:27,149 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 20:33:27,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:83 [2019-11-23 20:33:27,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:27,234 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:27,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 140 [2019-11-23 20:33:27,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:27,302 INFO L567 ElimStorePlain]: treesize reduction 120, result has 42.0 percent of original size [2019-11-23 20:33:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:27,304 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 20:33:27,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:87 [2019-11-23 20:33:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:27,380 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:27,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 140 [2019-11-23 20:33:27,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:27,450 INFO L567 ElimStorePlain]: treesize reduction 120, result has 42.0 percent of original size [2019-11-23 20:33:27,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:27,452 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 20:33:27,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:87 [2019-11-23 20:33:27,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:27,528 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:33:27,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 134 [2019-11-23 20:33:27,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:33:27,590 INFO L567 ElimStorePlain]: treesize reduction 110, result has 40.9 percent of original size [2019-11-23 20:33:27,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:27,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-23 20:33:27,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:78, output treesize:76 [2019-11-23 20:33:27,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:33:29,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms