java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_partition_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:26:32,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:26:32,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:26:32,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:26:32,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:26:32,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:26:32,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:26:32,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:26:32,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:26:32,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:26:32,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:26:32,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:26:32,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:26:32,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:26:32,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:26:32,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:26:32,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:26:32,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:26:32,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:26:32,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:26:32,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:26:32,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:26:32,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:26:32,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:26:32,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:26:32,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:26:32,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:26:32,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:26:32,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:26:32,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:26:32,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:26:32,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:26:32,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:26:32,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:26:32,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:26:32,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:26:32,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:26:32,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:26:32,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:26:32,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:26:32,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:26:32,673 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-10-01 23:26:32,703 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:26:32,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:26:32,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:26:32,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:26:32,706 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:26:32,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:26:32,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:26:32,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:26:32,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:26:32,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:26:32,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:26:32,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:26:32,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:26:32,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:26:32,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:26:32,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:26:32,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:26:32,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:26:32,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:26:32,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:26:32,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:26:32,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:26:32,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:26:32,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:26:32,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:26:32,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:26:32,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:26:32,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:26:32,713 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:26:32,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:26:32,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:26:32,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:26:32,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:26:32,771 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:26:32,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_ground-2.i [2019-10-01 23:26:32,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c005b43/95c46e9a9f5e4be4990b8c85794b21e8/FLAG1668fcdfe [2019-10-01 23:26:33,278 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:26:33,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_ground-2.i [2019-10-01 23:26:33,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c005b43/95c46e9a9f5e4be4990b8c85794b21e8/FLAG1668fcdfe [2019-10-01 23:26:33,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c005b43/95c46e9a9f5e4be4990b8c85794b21e8 [2019-10-01 23:26:33,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:26:33,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:26:33,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:26:33,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:26:33,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:26:33,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:26:33" (1/1) ... [2019-10-01 23:26:33,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7639f8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:33, skipping insertion in model container [2019-10-01 23:26:33,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:26:33" (1/1) ... [2019-10-01 23:26:33,711 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:26:33,731 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:26:33,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:26:33,919 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:26:33,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:26:34,035 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:26:34,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:34 WrapperNode [2019-10-01 23:26:34,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:26:34,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:26:34,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:26:34,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:26:34,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:34" (1/1) ... [2019-10-01 23:26:34,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:34" (1/1) ... [2019-10-01 23:26:34,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:34" (1/1) ... [2019-10-01 23:26:34,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:34" (1/1) ... [2019-10-01 23:26:34,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:34" (1/1) ... [2019-10-01 23:26:34,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:34" (1/1) ... [2019-10-01 23:26:34,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:34" (1/1) ... [2019-10-01 23:26:34,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:26:34,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:26:34,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:26:34,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:26:34,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:34" (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-10-01 23:26:34,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:26:34,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:26:34,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:26:34,138 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:26:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:26:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:26:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:26:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:26:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:26:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:26:34,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:26:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:26:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:26:34,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:26:34,454 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:26:34,454 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-01 23:26:34,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:26:34 BoogieIcfgContainer [2019-10-01 23:26:34,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:26:34,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:26:34,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:26:34,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:26:34,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:26:33" (1/3) ... [2019-10-01 23:26:34,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9dd651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:26:34, skipping insertion in model container [2019-10-01 23:26:34,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:34" (2/3) ... [2019-10-01 23:26:34,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9dd651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:26:34, skipping insertion in model container [2019-10-01 23:26:34,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:26:34" (3/3) ... [2019-10-01 23:26:34,471 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_partition_ground-2.i [2019-10-01 23:26:34,482 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:26:34,492 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:26:34,509 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:26:34,534 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:26:34,535 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:26:34,535 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:26:34,535 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:26:34,535 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:26:34,535 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:26:34,535 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:26:34,535 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:26:34,535 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:26:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 23:26:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 23:26:34,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:34,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:34,560 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:34,565 INFO L82 PathProgramCache]: Analyzing trace with hash -640162803, now seen corresponding path program 1 times [2019-10-01 23:26:34,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:34,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:34,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:34,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:26:34,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:26:34,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:26:34,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:26:34,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:26:34,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:26:34,731 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 23:26:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:34,753 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2019-10-01 23:26:34,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:26:34,754 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-01 23:26:34,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:34,762 INFO L225 Difference]: With dead ends: 54 [2019-10-01 23:26:34,762 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 23:26:34,766 INFO L640 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-10-01 23:26:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 23:26:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 23:26:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 23:26:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-10-01 23:26:34,803 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2019-10-01 23:26:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:34,804 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-10-01 23:26:34,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:26:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-10-01 23:26:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-01 23:26:34,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:34,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:34,806 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:34,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2068442237, now seen corresponding path program 1 times [2019-10-01 23:26:34,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:34,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:34,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:34,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:34,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:26:34,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:26:34,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:26:34,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:26:34,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:26:34,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:26:34,885 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-10-01 23:26:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:34,910 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 23:26:34,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:26:34,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-01 23:26:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:34,911 INFO L225 Difference]: With dead ends: 46 [2019-10-01 23:26:34,912 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 23:26:34,913 INFO L640 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-10-01 23:26:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 23:26:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 23:26:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 23:26:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-01 23:26:34,920 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2019-10-01 23:26:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:34,920 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-01 23:26:34,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:26:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-10-01 23:26:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-01 23:26:34,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:34,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:34,922 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:34,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1850093537, now seen corresponding path program 1 times [2019-10-01 23:26:34,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:34,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:34,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:34,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:34,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:26:34,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:26:34,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:26:34,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:26:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:26:34,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:26:34,981 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-10-01 23:26:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:35,061 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-10-01 23:26:35,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:26:35,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-01 23:26:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:35,064 INFO L225 Difference]: With dead ends: 48 [2019-10-01 23:26:35,064 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 23:26:35,065 INFO L640 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-10-01 23:26:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 23:26:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-10-01 23:26:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:26:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-01 23:26:35,072 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2019-10-01 23:26:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:35,073 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-01 23:26:35,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:26:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-01 23:26:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-01 23:26:35,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:35,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:35,075 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:35,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:35,075 INFO L82 PathProgramCache]: Analyzing trace with hash -45207547, now seen corresponding path program 1 times [2019-10-01 23:26:35,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:35,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:35,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:35,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:35,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 23:26:35,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:35,163 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:35,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:35,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:26:35,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:26:35,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:35,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-01 23:26:35,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:26:35,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:26:35,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:26:35,289 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 6 states. [2019-10-01 23:26:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:35,421 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2019-10-01 23:26:35,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:26:35,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-01 23:26:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:35,423 INFO L225 Difference]: With dead ends: 62 [2019-10-01 23:26:35,424 INFO L226 Difference]: Without dead ends: 42 [2019-10-01 23:26:35,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:26:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-01 23:26:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2019-10-01 23:26:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 23:26:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-01 23:26:35,432 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 24 [2019-10-01 23:26:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:35,433 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-01 23:26:35,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:26:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-01 23:26:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 23:26:35,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:35,434 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:35,435 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:35,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1499586431, now seen corresponding path program 2 times [2019-10-01 23:26:35,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:35,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:35,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:35,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:35,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 23:26:35,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:35,572 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:26:35,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:35,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:35,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:35,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:26:35,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 23:26:35,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:35,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:26:35,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:26:35,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:26:35,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:26:35,681 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 6 states. [2019-10-01 23:26:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:35,724 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2019-10-01 23:26:35,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:26:35,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-10-01 23:26:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:35,729 INFO L225 Difference]: With dead ends: 66 [2019-10-01 23:26:35,729 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 23:26:35,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-10-01 23:26:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 23:26:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 23:26:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 23:26:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2019-10-01 23:26:35,737 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 32 [2019-10-01 23:26:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:35,737 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2019-10-01 23:26:35,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:26:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2019-10-01 23:26:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 23:26:35,739 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:35,739 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:35,739 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:35,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:35,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1436123101, now seen corresponding path program 3 times [2019-10-01 23:26:35,740 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:35,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:35,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:35,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:35,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-01 23:26:35,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:35,853 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:26:35,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:35,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:26:35,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:35,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:26:35,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-01 23:26:35,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:35,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-01 23:26:35,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:26:35,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:26:35,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:26:35,953 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 9 states. [2019-10-01 23:26:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:36,121 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2019-10-01 23:26:36,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:26:36,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-10-01 23:26:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:36,122 INFO L225 Difference]: With dead ends: 78 [2019-10-01 23:26:36,122 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 23:26:36,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:26:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 23:26:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-10-01 23:26:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 23:26:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-10-01 23:26:36,131 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 34 [2019-10-01 23:26:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:36,131 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-10-01 23:26:36,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:26:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-10-01 23:26:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 23:26:36,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:36,135 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:36,136 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:36,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:36,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1447438805, now seen corresponding path program 4 times [2019-10-01 23:26:36,136 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:36,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:36,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:36,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:36,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:26:36,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:36,263 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:26:36,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:36,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:36,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:36,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:26:36,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:26:36,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:36,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:26:36,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:26:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:26:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:26:36,386 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 8 states. [2019-10-01 23:26:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:36,436 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2019-10-01 23:26:36,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:26:36,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-10-01 23:26:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:36,441 INFO L225 Difference]: With dead ends: 82 [2019-10-01 23:26:36,441 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 23:26:36,441 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 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-10-01 23:26:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 23:26:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 23:26:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 23:26:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2019-10-01 23:26:36,455 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 42 [2019-10-01 23:26:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:36,456 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2019-10-01 23:26:36,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:26:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2019-10-01 23:26:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 23:26:36,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:36,457 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:36,458 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1433365683, now seen corresponding path program 5 times [2019-10-01 23:26:36,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:36,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:36,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:36,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:36,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:26:36,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:36,548 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:26:36,572 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:36,674 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 23:26:36,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:36,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:26:36,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-01 23:26:36,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:36,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-01 23:26:36,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:26:36,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:26:36,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:26:36,742 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 12 states. [2019-10-01 23:26:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:36,924 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2019-10-01 23:26:36,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:26:36,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-10-01 23:26:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:36,933 INFO L225 Difference]: With dead ends: 94 [2019-10-01 23:26:36,933 INFO L226 Difference]: Without dead ends: 62 [2019-10-01 23:26:36,934 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:26:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-01 23:26:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2019-10-01 23:26:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-01 23:26:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-10-01 23:26:36,946 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 44 [2019-10-01 23:26:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:36,946 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-10-01 23:26:36,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:26:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2019-10-01 23:26:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-01 23:26:36,948 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:36,948 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:36,948 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:36,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash 589786441, now seen corresponding path program 6 times [2019-10-01 23:26:36,952 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:36,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:36,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:36,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:36,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-01 23:26:37,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:37,102 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:26:37,125 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:37,164 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 23:26:37,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:37,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:26:37,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:37,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:26:37,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:37,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:37,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:37,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-01 23:26:37,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-10-01 23:26:37,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:37,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:37,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-01 23:26:37,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:38 [2019-10-01 23:26:37,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:37,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2019-10-01 23:26:37,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:37,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-01 23:26:37,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:37,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:37,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55, output treesize:14 [2019-10-01 23:26:37,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-01 23:26:37,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:37,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-10-01 23:26:37,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:26:37,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:26:37,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:26:37,580 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 17 states. [2019-10-01 23:26:38,752 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-10-01 23:26:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:39,270 INFO L93 Difference]: Finished difference Result 137 states and 170 transitions. [2019-10-01 23:26:39,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:26:39,271 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2019-10-01 23:26:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:39,274 INFO L225 Difference]: With dead ends: 137 [2019-10-01 23:26:39,275 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 23:26:39,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=990, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:26:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 23:26:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2019-10-01 23:26:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 23:26:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-10-01 23:26:39,291 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 52 [2019-10-01 23:26:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:39,292 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-10-01 23:26:39,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:26:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-10-01 23:26:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 23:26:39,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:39,293 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:39,294 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:39,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1465812461, now seen corresponding path program 1 times [2019-10-01 23:26:39,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:39,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:39,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:39,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:39,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-01 23:26:39,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:39,411 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:39,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:39,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:26:39,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-01 23:26:39,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:39,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:26:39,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:26:39,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:26:39,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:26:39,507 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 11 states. [2019-10-01 23:26:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:39,555 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2019-10-01 23:26:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:26:39,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-01 23:26:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:39,558 INFO L225 Difference]: With dead ends: 132 [2019-10-01 23:26:39,558 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 23:26:39,559 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:26:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 23:26:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 23:26:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 23:26:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-10-01 23:26:39,569 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 54 [2019-10-01 23:26:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:39,569 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-10-01 23:26:39,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:26:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-10-01 23:26:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 23:26:39,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:39,571 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:39,571 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash 812163087, now seen corresponding path program 2 times [2019-10-01 23:26:39,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:39,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:39,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:39,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:39,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-01 23:26:39,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:39,692 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:26:39,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:39,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:39,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:39,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:26:39,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-01 23:26:39,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:39,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:26:39,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:26:39,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:26:39,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:26:39,817 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 12 states. [2019-10-01 23:26:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:39,861 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2019-10-01 23:26:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:26:39,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-10-01 23:26:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:39,863 INFO L225 Difference]: With dead ends: 134 [2019-10-01 23:26:39,863 INFO L226 Difference]: Without dead ends: 80 [2019-10-01 23:26:39,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:26:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-01 23:26:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-10-01 23:26:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-01 23:26:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-10-01 23:26:39,888 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 56 [2019-10-01 23:26:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:39,889 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-10-01 23:26:39,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:26:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-10-01 23:26:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-01 23:26:39,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:39,892 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:39,893 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:39,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash -279660111, now seen corresponding path program 3 times [2019-10-01 23:26:39,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:39,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:39,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:39,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:39,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-01 23:26:40,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:40,024 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:40,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:26:40,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 23:26:40,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:40,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:26:40,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:40,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:26:40,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:40,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:40,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:40,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-01 23:26:40,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-10-01 23:26:40,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:40,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:40,164 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-10-01 23:26:40,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-10-01 23:26:40,346 INFO L341 Elim1Store]: treesize reduction 17, result has 73.8 percent of original size [2019-10-01 23:26:40,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 88 [2019-10-01 23:26:40,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:40,386 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.9 percent of original size [2019-10-01 23:26:40,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:40,390 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-10-01 23:26:40,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:71 [2019-10-01 23:26:40,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:40,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:40,632 INFO L341 Elim1Store]: treesize reduction 17, result has 66.7 percent of original size [2019-10-01 23:26:40,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 43 [2019-10-01 23:26:40,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:40,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:40,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:40,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-01 23:26:40,663 INFO L567 ElimStorePlain]: treesize reduction 16, result has 63.6 percent of original size [2019-10-01 23:26:40,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:40,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-01 23:26:40,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2019-10-01 23:26:40,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-01 23:26:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-01 23:26:40,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:40,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2019-10-01 23:26:40,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:26:40,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:26:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:26:40,805 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 25 states. [2019-10-01 23:26:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:47,738 INFO L93 Difference]: Finished difference Result 187 states and 236 transitions. [2019-10-01 23:26:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 23:26:47,743 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2019-10-01 23:26:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:47,745 INFO L225 Difference]: With dead ends: 187 [2019-10-01 23:26:47,745 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 23:26:47,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=625, Invalid=3407, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 23:26:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 23:26:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 100. [2019-10-01 23:26:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-01 23:26:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2019-10-01 23:26:47,776 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 58 [2019-10-01 23:26:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:47,777 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2019-10-01 23:26:47,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:26:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2019-10-01 23:26:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-01 23:26:47,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:47,782 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:47,782 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:47,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:47,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1291567727, now seen corresponding path program 4 times [2019-10-01 23:26:47,783 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:47,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:47,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:47,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:47,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-01 23:26:47,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:47,915 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:47,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:26:47,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:47,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:47,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:26:47,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-01 23:26:48,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:48,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:26:48,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:26:48,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:26:48,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:26:48,006 INFO L87 Difference]: Start difference. First operand 100 states and 124 transitions. Second operand 14 states. [2019-10-01 23:26:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:48,056 INFO L93 Difference]: Finished difference Result 176 states and 224 transitions. [2019-10-01 23:26:48,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:26:48,057 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-01 23:26:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:48,058 INFO L225 Difference]: With dead ends: 176 [2019-10-01 23:26:48,058 INFO L226 Difference]: Without dead ends: 103 [2019-10-01 23:26:48,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:26:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-01 23:26:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-10-01 23:26:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 23:26:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2019-10-01 23:26:48,067 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 60 [2019-10-01 23:26:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:48,067 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2019-10-01 23:26:48,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:26:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2019-10-01 23:26:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-01 23:26:48,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:48,068 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:48,069 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:48,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:48,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2061060557, now seen corresponding path program 5 times [2019-10-01 23:26:48,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:48,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:48,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:48,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:48,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-01 23:26:48,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:48,224 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:48,261 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:26:48,444 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 23:26:48,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:48,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:26:48,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-10-01 23:26:48,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:48,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 23:26:48,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:26:48,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:26:48,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:26:48,514 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand 19 states. [2019-10-01 23:26:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:48,786 INFO L93 Difference]: Finished difference Result 226 states and 293 transitions. [2019-10-01 23:26:48,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:26:48,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2019-10-01 23:26:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:48,787 INFO L225 Difference]: With dead ends: 226 [2019-10-01 23:26:48,787 INFO L226 Difference]: Without dead ends: 153 [2019-10-01 23:26:48,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=591, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:26:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-01 23:26:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 116. [2019-10-01 23:26:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-01 23:26:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2019-10-01 23:26:48,796 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 62 [2019-10-01 23:26:48,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:48,797 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2019-10-01 23:26:48,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:26:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2019-10-01 23:26:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 23:26:48,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:48,798 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:48,798 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:48,799 INFO L82 PathProgramCache]: Analyzing trace with hash 304329915, now seen corresponding path program 6 times [2019-10-01 23:26:48,799 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:48,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:48,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:48,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:48,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-01 23:26:48,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:48,933 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:48,956 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:26:49,219 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 23:26:49,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:49,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:26:49,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-10-01 23:26:49,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:49,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-10-01 23:26:49,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:26:49,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:26:49,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:26:49,335 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand 21 states. [2019-10-01 23:26:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:49,610 INFO L93 Difference]: Finished difference Result 252 states and 327 transitions. [2019-10-01 23:26:49,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:26:49,610 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 70 [2019-10-01 23:26:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:49,612 INFO L225 Difference]: With dead ends: 252 [2019-10-01 23:26:49,612 INFO L226 Difference]: Without dead ends: 167 [2019-10-01 23:26:49,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=405, Invalid=717, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:26:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-01 23:26:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 130. [2019-10-01 23:26:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-01 23:26:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2019-10-01 23:26:49,623 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 70 [2019-10-01 23:26:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:49,623 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2019-10-01 23:26:49,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:26:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2019-10-01 23:26:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-01 23:26:49,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:49,625 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 6, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:49,625 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:49,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1426838071, now seen corresponding path program 7 times [2019-10-01 23:26:49,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:49,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:49,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:49,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:49,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-01 23:26:49,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:49,798 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:49,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:49,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:26:49,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:26:49,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:49,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:26:49,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:26:49,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:26:49,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:26:49,889 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand 17 states. [2019-10-01 23:26:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:49,950 INFO L93 Difference]: Finished difference Result 230 states and 294 transitions. [2019-10-01 23:26:49,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:26:49,951 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 78 [2019-10-01 23:26:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:49,952 INFO L225 Difference]: With dead ends: 230 [2019-10-01 23:26:49,952 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 23:26:49,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:26:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 23:26:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-10-01 23:26:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-01 23:26:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-10-01 23:26:49,963 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 78 [2019-10-01 23:26:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:49,963 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-10-01 23:26:49,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:26:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-10-01 23:26:49,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-01 23:26:49,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:49,965 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 6, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:49,965 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1504565671, now seen corresponding path program 8 times [2019-10-01 23:26:49,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:49,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:49,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-01 23:26:50,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:50,154 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:50,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:26:50,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:50,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:50,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:26:50,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-01 23:26:50,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:50,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:26:50,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:26:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:26:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:26:50,260 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 18 states. [2019-10-01 23:26:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:50,325 INFO L93 Difference]: Finished difference Result 232 states and 296 transitions. [2019-10-01 23:26:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:26:50,326 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 80 [2019-10-01 23:26:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:50,327 INFO L225 Difference]: With dead ends: 232 [2019-10-01 23:26:50,327 INFO L226 Difference]: Without dead ends: 135 [2019-10-01 23:26:50,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:26:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-01 23:26:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-10-01 23:26:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-01 23:26:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 166 transitions. [2019-10-01 23:26:50,338 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 166 transitions. Word has length 80 [2019-10-01 23:26:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:50,339 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 166 transitions. [2019-10-01 23:26:50,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:26:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 166 transitions. [2019-10-01 23:26:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-01 23:26:50,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:50,341 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:50,341 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1085015557, now seen corresponding path program 9 times [2019-10-01 23:26:50,341 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:50,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:50,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-01 23:26:50,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:50,578 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:50,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:26:50,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:26:50,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:50,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:26:50,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:50,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:26:50,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:50,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:50,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:50,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-01 23:26:50,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-10-01 23:26:50,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:50,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:50,858 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-10-01 23:26:50,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-10-01 23:26:50,948 INFO L341 Elim1Store]: treesize reduction 17, result has 73.8 percent of original size [2019-10-01 23:26:50,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 88 [2019-10-01 23:26:50,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:50,975 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:26:50,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:50,980 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-10-01 23:26:50,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:26:50,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:51,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:51,200 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:26:51,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:26:51,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:51,234 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.9 percent of original size [2019-10-01 23:26:51,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:51,236 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-10-01 23:26:51,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:71 [2019-10-01 23:26:51,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:51,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:52,608 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-10-01 23:26:52,690 INFO L341 Elim1Store]: treesize reduction 17, result has 66.7 percent of original size [2019-10-01 23:26:52,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 43 [2019-10-01 23:26:52,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:52,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:52,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:52,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-01 23:26:52,735 INFO L567 ElimStorePlain]: treesize reduction 30, result has 48.3 percent of original size [2019-10-01 23:26:52,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:26:52,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-01 23:26:52,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2019-10-01 23:26:52,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-01 23:26:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 23 proven. 55 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-10-01 23:26:52,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:52,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-10-01 23:26:52,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:26:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:26:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=924, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:26:52,914 INFO L87 Difference]: Start difference. First operand 134 states and 166 transitions. Second operand 34 states. [2019-10-01 23:26:59,748 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-01 23:27:03,467 WARN L191 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-10-01 23:27:06,426 WARN L191 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 45 [2019-10-01 23:27:11,185 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 43 [2019-10-01 23:27:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:12,531 INFO L93 Difference]: Finished difference Result 341 states and 434 transitions. [2019-10-01 23:27:12,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-01 23:27:12,531 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 82 [2019-10-01 23:27:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:12,533 INFO L225 Difference]: With dead ends: 341 [2019-10-01 23:27:12,533 INFO L226 Difference]: Without dead ends: 244 [2019-10-01 23:27:12,536 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2691 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1335, Invalid=8966, Unknown=1, NotChecked=0, Total=10302 [2019-10-01 23:27:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-10-01 23:27:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 164. [2019-10-01 23:27:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-01 23:27:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 206 transitions. [2019-10-01 23:27:12,550 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 206 transitions. Word has length 82 [2019-10-01 23:27:12,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:12,550 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 206 transitions. [2019-10-01 23:27:12,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:27:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2019-10-01 23:27:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 23:27:12,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:12,551 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 6, 6, 6, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:12,552 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:12,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1390821791, now seen corresponding path program 10 times [2019-10-01 23:27:12,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:12,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:12,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:12,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:12,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-01 23:27:12,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:12,740 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:12,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:27:12,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:27:12,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:12,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:27:12,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:27:12,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:12,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:27:12,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:27:12,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:27:12,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:27:12,852 INFO L87 Difference]: Start difference. First operand 164 states and 206 transitions. Second operand 20 states. [2019-10-01 23:27:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:12,928 INFO L93 Difference]: Finished difference Result 292 states and 376 transitions. [2019-10-01 23:27:12,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:27:12,929 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 84 [2019-10-01 23:27:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:12,930 INFO L225 Difference]: With dead ends: 292 [2019-10-01 23:27:12,930 INFO L226 Difference]: Without dead ends: 167 [2019-10-01 23:27:12,931 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:27:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-10-01 23:27:12,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-10-01 23:27:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-01 23:27:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2019-10-01 23:27:12,945 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 84 [2019-10-01 23:27:12,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:12,946 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2019-10-01 23:27:12,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:27:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2019-10-01 23:27:12,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-01 23:27:12,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:12,947 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 6, 6, 6, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:12,947 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:12,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:12,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1447988159, now seen corresponding path program 11 times [2019-10-01 23:27:12,948 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:12,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:12,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:12,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:12,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-01 23:27:13,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:13,175 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:13,207 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:27:13,986 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-01 23:27:13,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:13,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:27:13,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:27:14,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:14,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:27:14,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:27:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:27:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:27:14,048 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand 21 states. [2019-10-01 23:27:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:14,120 INFO L93 Difference]: Finished difference Result 294 states and 378 transitions. [2019-10-01 23:27:14,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:27:14,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2019-10-01 23:27:14,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:14,122 INFO L225 Difference]: With dead ends: 294 [2019-10-01 23:27:14,122 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:27:14,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:27:14,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:27:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2019-10-01 23:27:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-01 23:27:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 210 transitions. [2019-10-01 23:27:14,135 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 210 transitions. Word has length 86 [2019-10-01 23:27:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:14,136 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 210 transitions. [2019-10-01 23:27:14,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:27:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 210 transitions. [2019-10-01 23:27:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-01 23:27:14,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:14,137 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 6, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:14,137 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:14,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2054850147, now seen corresponding path program 12 times [2019-10-01 23:27:14,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:14,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:14,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:14,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:14,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-01 23:27:14,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:14,349 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:14,383 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:27:14,670 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:27:14,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:14,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:27:14,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:27:14,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:14,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2019-10-01 23:27:14,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:27:14,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:27:14,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:27:14,777 INFO L87 Difference]: Start difference. First operand 168 states and 210 transitions. Second operand 28 states. [2019-10-01 23:27:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:15,288 INFO L93 Difference]: Finished difference Result 382 states and 498 transitions. [2019-10-01 23:27:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:27:15,290 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 88 [2019-10-01 23:27:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:15,292 INFO L225 Difference]: With dead ends: 382 [2019-10-01 23:27:15,292 INFO L226 Difference]: Without dead ends: 257 [2019-10-01 23:27:15,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=777, Invalid=1385, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 23:27:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-01 23:27:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 185. [2019-10-01 23:27:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-01 23:27:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 232 transitions. [2019-10-01 23:27:15,308 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 232 transitions. Word has length 88 [2019-10-01 23:27:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:15,308 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 232 transitions. [2019-10-01 23:27:15,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:27:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 232 transitions. [2019-10-01 23:27:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 23:27:15,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:15,310 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 7, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:15,310 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:15,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1432498325, now seen corresponding path program 13 times [2019-10-01 23:27:15,310 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:15,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:15,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 23:27:15,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:15,585 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:15,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:15,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:27:15,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 23:27:15,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:15,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:27:15,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:27:15,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:27:15,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:27:15,689 INFO L87 Difference]: Start difference. First operand 185 states and 232 transitions. Second operand 23 states. [2019-10-01 23:27:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:15,840 INFO L93 Difference]: Finished difference Result 328 states and 422 transitions. [2019-10-01 23:27:15,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:27:15,841 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 96 [2019-10-01 23:27:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:15,843 INFO L225 Difference]: With dead ends: 328 [2019-10-01 23:27:15,843 INFO L226 Difference]: Without dead ends: 188 [2019-10-01 23:27:15,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:27:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-01 23:27:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-10-01 23:27:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-01 23:27:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 234 transitions. [2019-10-01 23:27:15,863 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 234 transitions. Word has length 96 [2019-10-01 23:27:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:15,864 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 234 transitions. [2019-10-01 23:27:15,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:27:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 234 transitions. [2019-10-01 23:27:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 23:27:15,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:15,865 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 7, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:15,866 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:15,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:15,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1357373683, now seen corresponding path program 14 times [2019-10-01 23:27:15,866 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:15,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:15,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:15,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:15,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 23:27:16,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:16,114 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:16,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:27:16,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:27:16,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:16,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:27:16,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 23:27:16,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:16,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:27:16,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:27:16,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:27:16,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:27:16,259 INFO L87 Difference]: Start difference. First operand 187 states and 234 transitions. Second operand 24 states. [2019-10-01 23:27:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:16,346 INFO L93 Difference]: Finished difference Result 330 states and 424 transitions. [2019-10-01 23:27:16,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:27:16,346 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2019-10-01 23:27:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:16,348 INFO L225 Difference]: With dead ends: 330 [2019-10-01 23:27:16,348 INFO L226 Difference]: Without dead ends: 190 [2019-10-01 23:27:16,349 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:27:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-01 23:27:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-10-01 23:27:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 23:27:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 236 transitions. [2019-10-01 23:27:16,364 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 236 transitions. Word has length 98 [2019-10-01 23:27:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:16,365 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 236 transitions. [2019-10-01 23:27:16,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:27:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 236 transitions. [2019-10-01 23:27:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 23:27:16,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:16,366 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 7, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:16,366 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:16,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2117930543, now seen corresponding path program 15 times [2019-10-01 23:27:16,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:16,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:16,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:16,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:16,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 23:27:16,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:16,680 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:16,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:27:16,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 23:27:16,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:16,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:27:16,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:16,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:27:16,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:16,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:16,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:16,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-01 23:27:16,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-10-01 23:27:16,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:16,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:16,983 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-10-01 23:27:16,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-10-01 23:27:17,074 INFO L341 Elim1Store]: treesize reduction 17, result has 73.8 percent of original size [2019-10-01 23:27:17,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 88 [2019-10-01 23:27:17,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:17,105 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:27:17,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,107 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-10-01 23:27:17,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:68 [2019-10-01 23:27:17,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,261 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:27:17,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:27:17,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:17,291 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:27:17,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,293 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-10-01 23:27:17,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:27:17,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,498 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:27:17,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:27:17,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:17,534 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.9 percent of original size [2019-10-01 23:27:17,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,535 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-10-01 23:27:17,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:71 [2019-10-01 23:27:17,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,810 INFO L341 Elim1Store]: treesize reduction 17, result has 66.7 percent of original size [2019-10-01 23:27:17,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 43 [2019-10-01 23:27:17,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-01 23:27:17,834 INFO L567 ElimStorePlain]: treesize reduction 16, result has 63.6 percent of original size [2019-10-01 23:27:17,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:27:17,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-01 23:27:17,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2019-10-01 23:27:17,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-01 23:27:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 33 proven. 83 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:27:18,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:18,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2019-10-01 23:27:18,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 23:27:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 23:27:18,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 23:27:18,135 INFO L87 Difference]: Start difference. First operand 189 states and 236 transitions. Second operand 43 states. [2019-10-01 23:27:23,982 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 69 DAG size of output: 38 [2019-10-01 23:27:24,563 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-10-01 23:27:27,447 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-10-01 23:27:30,564 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-01 23:27:34,334 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-10-01 23:27:44,067 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 45 [2019-10-01 23:27:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:55,586 INFO L93 Difference]: Finished difference Result 490 states and 625 transitions. [2019-10-01 23:27:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-10-01 23:27:55,587 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 100 [2019-10-01 23:27:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:55,589 INFO L225 Difference]: With dead ends: 490 [2019-10-01 23:27:55,589 INFO L226 Difference]: Without dead ends: 350 [2019-10-01 23:27:55,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6580 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=2501, Invalid=20147, Unknown=2, NotChecked=0, Total=22650 [2019-10-01 23:27:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-10-01 23:27:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 237. [2019-10-01 23:27:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-10-01 23:27:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 300 transitions. [2019-10-01 23:27:55,616 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 300 transitions. Word has length 100 [2019-10-01 23:27:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:55,616 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 300 transitions. [2019-10-01 23:27:55,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 23:27:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 300 transitions. [2019-10-01 23:27:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-01 23:27:55,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:55,618 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 7, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:55,618 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:55,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1593409265, now seen corresponding path program 16 times [2019-10-01 23:27:55,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:55,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:55,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:55,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 23:27:55,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:55,917 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:55,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:27:56,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:27:56,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:56,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:27:56,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 23:27:56,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:56,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:27:56,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:27:56,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:27:56,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:27:56,048 INFO L87 Difference]: Start difference. First operand 237 states and 300 transitions. Second operand 26 states. [2019-10-01 23:27:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:56,148 INFO L93 Difference]: Finished difference Result 426 states and 552 transitions. [2019-10-01 23:27:56,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:27:56,149 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2019-10-01 23:27:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:56,150 INFO L225 Difference]: With dead ends: 426 [2019-10-01 23:27:56,151 INFO L226 Difference]: Without dead ends: 240 [2019-10-01 23:27:56,152 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:27:56,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-10-01 23:27:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2019-10-01 23:27:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-01 23:27:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 302 transitions. [2019-10-01 23:27:56,173 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 302 transitions. Word has length 102 [2019-10-01 23:27:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:56,173 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 302 transitions. [2019-10-01 23:27:56,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:27:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 302 transitions. [2019-10-01 23:27:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-01 23:27:56,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:56,175 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 7, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:56,175 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:56,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1744506673, now seen corresponding path program 17 times [2019-10-01 23:27:56,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:56,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:56,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:56,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:56,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-10-01 23:27:56,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:56,507 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:56,562 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:28:01,615 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 23:28:01,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:01,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:28:01,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2019-10-01 23:28:01,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:01,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-01 23:28:01,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:28:01,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:28:01,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:28:01,765 INFO L87 Difference]: Start difference. First operand 239 states and 302 transitions. Second operand 34 states. [2019-10-01 23:28:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:02,487 INFO L93 Difference]: Finished difference Result 597 states and 782 transitions. [2019-10-01 23:28:02,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:28:02,487 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 104 [2019-10-01 23:28:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:02,490 INFO L225 Difference]: With dead ends: 597 [2019-10-01 23:28:02,490 INFO L226 Difference]: Without dead ends: 411 [2019-10-01 23:28:02,492 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1185, Invalid=2121, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 23:28:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-01 23:28:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 268. [2019-10-01 23:28:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-10-01 23:28:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 340 transitions. [2019-10-01 23:28:02,534 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 340 transitions. Word has length 104 [2019-10-01 23:28:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:02,534 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 340 transitions. [2019-10-01 23:28:02,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:28:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 340 transitions. [2019-10-01 23:28:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-01 23:28:02,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:02,536 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 8, 8, 8, 8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:02,537 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1886521389, now seen corresponding path program 18 times [2019-10-01 23:28:02,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:02,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:02,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-10-01 23:28:02,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:02,963 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:03,045 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:28:06,412 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-01 23:28:06,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:06,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:28:06,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2019-10-01 23:28:06,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:06,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11] total 36 [2019-10-01 23:28:06,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:28:06,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:28:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=855, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:28:06,580 INFO L87 Difference]: Start difference. First operand 268 states and 340 transitions. Second operand 36 states. [2019-10-01 23:28:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:07,272 INFO L93 Difference]: Finished difference Result 653 states and 856 transitions. [2019-10-01 23:28:07,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 23:28:07,273 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 112 [2019-10-01 23:28:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:07,275 INFO L225 Difference]: With dead ends: 653 [2019-10-01 23:28:07,275 INFO L226 Difference]: Without dead ends: 440 [2019-10-01 23:28:07,277 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1305, Invalid=2355, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 23:28:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-10-01 23:28:07,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 297. [2019-10-01 23:28:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-01 23:28:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 378 transitions. [2019-10-01 23:28:07,309 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 378 transitions. Word has length 112 [2019-10-01 23:28:07,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:07,310 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 378 transitions. [2019-10-01 23:28:07,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:28:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 378 transitions. [2019-10-01 23:28:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-01 23:28:07,311 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:07,311 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 9, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:07,311 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:07,312 INFO L82 PathProgramCache]: Analyzing trace with hash -274416203, now seen corresponding path program 19 times [2019-10-01 23:28:07,312 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:07,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:07,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:07,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:07,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-01 23:28:07,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:07,743 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:07,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:28:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:07,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:28:07,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-01 23:28:07,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:07,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:28:07,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:28:07,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:28:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:28:07,952 INFO L87 Difference]: Start difference. First operand 297 states and 378 transitions. Second operand 29 states. [2019-10-01 23:28:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:08,073 INFO L93 Difference]: Finished difference Result 540 states and 702 transitions. [2019-10-01 23:28:08,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:28:08,073 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 120 [2019-10-01 23:28:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:08,075 INFO L225 Difference]: With dead ends: 540 [2019-10-01 23:28:08,075 INFO L226 Difference]: Without dead ends: 300 [2019-10-01 23:28:08,076 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:28:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-01 23:28:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2019-10-01 23:28:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-10-01 23:28:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 380 transitions. [2019-10-01 23:28:08,126 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 380 transitions. Word has length 120 [2019-10-01 23:28:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:08,127 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 380 transitions. [2019-10-01 23:28:08,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:28:08,127 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 380 transitions. [2019-10-01 23:28:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 23:28:08,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:08,128 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 9, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:08,128 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:08,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:08,129 INFO L82 PathProgramCache]: Analyzing trace with hash 879937367, now seen corresponding path program 20 times [2019-10-01 23:28:08,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:08,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:08,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:28:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-01 23:28:08,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:08,508 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:08,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:28:08,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:28:08,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:08,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:28:08,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-01 23:28:08,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:08,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:28:08,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:28:08,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:28:08,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:28:08,652 INFO L87 Difference]: Start difference. First operand 299 states and 380 transitions. Second operand 30 states. [2019-10-01 23:28:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:08,800 INFO L93 Difference]: Finished difference Result 542 states and 704 transitions. [2019-10-01 23:28:08,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:28:08,801 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 122 [2019-10-01 23:28:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:08,803 INFO L225 Difference]: With dead ends: 542 [2019-10-01 23:28:08,803 INFO L226 Difference]: Without dead ends: 302 [2019-10-01 23:28:08,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:28:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-01 23:28:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-10-01 23:28:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-01 23:28:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 382 transitions. [2019-10-01 23:28:08,836 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 382 transitions. Word has length 122 [2019-10-01 23:28:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:08,837 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 382 transitions. [2019-10-01 23:28:08,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:28:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 382 transitions. [2019-10-01 23:28:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 23:28:08,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:08,838 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 9, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:08,839 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:08,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2112155769, now seen corresponding path program 21 times [2019-10-01 23:28:08,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:08,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:08,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-01 23:28:09,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:09,237 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:09,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:28:09,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:28:09,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:09,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:28:09,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:09,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:28:09,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:09,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:09,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:28:09,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-01 23:28:09,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-10-01 23:28:09,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:09,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:09,774 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-10-01 23:28:09,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-10-01 23:28:09,873 INFO L341 Elim1Store]: treesize reduction 17, result has 73.8 percent of original size [2019-10-01 23:28:09,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 88 [2019-10-01 23:28:09,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:09,904 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:28:09,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:09,907 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-10-01 23:28:09,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:28:09,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:09,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,068 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:28:10,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:28:10,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:10,104 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:28:10,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,106 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-10-01 23:28:10,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:28:10,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,284 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:28:10,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:28:10,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:10,313 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:28:10,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,315 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-10-01 23:28:10,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:28:10,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,563 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:28:10,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:28:10,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:10,599 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.9 percent of original size [2019-10-01 23:28:10,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,600 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-10-01 23:28:10,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:71 [2019-10-01 23:28:10,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,879 INFO L341 Elim1Store]: treesize reduction 17, result has 66.7 percent of original size [2019-10-01 23:28:10,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 43 [2019-10-01 23:28:10,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-01 23:28:10,913 INFO L567 ElimStorePlain]: treesize reduction 30, result has 48.3 percent of original size [2019-10-01 23:28:10,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:28:10,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-01 23:28:10,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2019-10-01 23:28:10,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-01 23:28:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 56 proven. 134 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2019-10-01 23:28:11,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:11,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 52 [2019-10-01 23:28:11,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 23:28:11,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 23:28:11,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=2156, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 23:28:11,226 INFO L87 Difference]: Start difference. First operand 301 states and 382 transitions. Second operand 52 states. [2019-10-01 23:28:24,235 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2019-10-01 23:28:37,396 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-10-01 23:28:48,612 WARN L191 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-01 23:28:51,021 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-10-01 23:29:00,740 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-01 23:29:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:29:16,047 INFO L93 Difference]: Finished difference Result 949 states and 1215 transitions. [2019-10-01 23:29:16,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-10-01 23:29:16,047 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 124 [2019-10-01 23:29:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:29:16,050 INFO L225 Difference]: With dead ends: 949 [2019-10-01 23:29:16,050 INFO L226 Difference]: Without dead ends: 709 [2019-10-01 23:29:16,054 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14735 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=4445, Invalid=42421, Unknown=6, NotChecked=0, Total=46872 [2019-10-01 23:29:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-10-01 23:29:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 398. [2019-10-01 23:29:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-10-01 23:29:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 512 transitions. [2019-10-01 23:29:16,108 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 512 transitions. Word has length 124 [2019-10-01 23:29:16,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:29:16,109 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 512 transitions. [2019-10-01 23:29:16,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 23:29:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 512 transitions. [2019-10-01 23:29:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 23:29:16,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:29:16,111 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 9, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:29:16,111 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:29:16,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:29:16,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1285768221, now seen corresponding path program 22 times [2019-10-01 23:29:16,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:29:16,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:29:16,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:29:16,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:29:16,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:29:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:29:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-01 23:29:16,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:29:16,542 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:29:16,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:29:16,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:29:16,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:29:16,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:29:16,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:29:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-01 23:29:16,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:29:16,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:29:16,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:29:16,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:29:16,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:29:16,748 INFO L87 Difference]: Start difference. First operand 398 states and 512 transitions. Second operand 32 states. [2019-10-01 23:29:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:29:16,924 INFO L93 Difference]: Finished difference Result 736 states and 964 transitions. [2019-10-01 23:29:16,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:29:16,924 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2019-10-01 23:29:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:29:16,928 INFO L225 Difference]: With dead ends: 736 [2019-10-01 23:29:16,928 INFO L226 Difference]: Without dead ends: 401 [2019-10-01 23:29:16,929 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:29:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-10-01 23:29:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 400. [2019-10-01 23:29:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-10-01 23:29:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 514 transitions. [2019-10-01 23:29:17,014 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 514 transitions. Word has length 126 [2019-10-01 23:29:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:29:17,014 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 514 transitions. [2019-10-01 23:29:17,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:29:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 514 transitions. [2019-10-01 23:29:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-01 23:29:17,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:29:17,017 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 9, 9, 9, 9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:29:17,018 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:29:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:29:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash -793244609, now seen corresponding path program 23 times [2019-10-01 23:29:17,020 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:29:17,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:29:17,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:29:17,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:29:17,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:29:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:29:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-10-01 23:29:17,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:29:17,809 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:29:17,888 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:29:51,579 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 23:29:51,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:29:51,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:29:51,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:29:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2019-10-01 23:29:51,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:29:51,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-01 23:29:51,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 23:29:51,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 23:29:51,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:29:51,837 INFO L87 Difference]: Start difference. First operand 400 states and 514 transitions. Second operand 42 states. [2019-10-01 23:29:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:29:52,970 INFO L93 Difference]: Finished difference Result 1116 states and 1469 transitions. [2019-10-01 23:29:52,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 23:29:52,970 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 128 [2019-10-01 23:29:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:29:52,974 INFO L225 Difference]: With dead ends: 1116 [2019-10-01 23:29:52,975 INFO L226 Difference]: Without dead ends: 781 [2019-10-01 23:29:52,976 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1821, Invalid=3291, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 23:29:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-01 23:29:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 444. [2019-10-01 23:29:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-10-01 23:29:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 572 transitions. [2019-10-01 23:29:53,041 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 572 transitions. Word has length 128 [2019-10-01 23:29:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:29:53,041 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 572 transitions. [2019-10-01 23:29:53,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 23:29:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 572 transitions. [2019-10-01 23:29:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-01 23:29:53,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:29:53,043 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 10, 10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:29:53,043 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:29:53,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:29:53,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1260800699, now seen corresponding path program 24 times [2019-10-01 23:29:53,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:29:53,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:29:53,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:29:53,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:29:53,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:29:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:29:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-10-01 23:29:53,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:29:53,775 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:29:53,876 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:30:02,202 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:30:02,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:02,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-01 23:30:02,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:02,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:30:02,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:02,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:02,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:02,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-01 23:30:02,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-10-01 23:30:02,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:02,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:02,282 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-10-01 23:30:02,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-10-01 23:30:02,397 INFO L341 Elim1Store]: treesize reduction 17, result has 73.8 percent of original size [2019-10-01 23:30:02,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 88 [2019-10-01 23:30:02,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:02,430 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:30:02,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:02,431 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-10-01 23:30:02,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:68 [2019-10-01 23:30:02,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:02,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:02,589 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:30:02,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:30:02,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:02,621 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:30:02,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:02,623 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-10-01 23:30:02,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:30:02,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:02,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:02,793 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:30:02,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:30:02,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:02,826 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:30:02,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:02,828 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-10-01 23:30:02,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:30:02,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:02,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,041 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:30:03,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:30:03,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:03,075 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:30:03,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,077 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-10-01 23:30:03,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:30:03,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,328 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:30:03,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:30:03,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:03,366 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.9 percent of original size [2019-10-01 23:30:03,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,368 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-10-01 23:30:03,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:71 [2019-10-01 23:30:03,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,767 INFO L341 Elim1Store]: treesize reduction 17, result has 66.7 percent of original size [2019-10-01 23:30:03,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 43 [2019-10-01 23:30:03,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-01 23:30:03,794 INFO L567 ElimStorePlain]: treesize reduction 16, result has 63.6 percent of original size [2019-10-01 23:30:03,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:30:03,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-01 23:30:03,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2019-10-01 23:30:03,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-01 23:30:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 69 proven. 177 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-10-01 23:30:04,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:04,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27] total 58 [2019-10-01 23:30:04,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 23:30:04,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 23:30:04,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=2709, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 23:30:04,207 INFO L87 Difference]: Start difference. First operand 444 states and 572 transitions. Second operand 58 states. [2019-10-01 23:30:17,505 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 96 DAG size of output: 46 [2019-10-01 23:30:18,709 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-10-01 23:30:24,847 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2019-10-01 23:30:26,252 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-01 23:30:29,026 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-10-01 23:30:29,955 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-10-01 23:30:43,500 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-01 23:31:01,496 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-01 23:31:13,260 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-10-01 23:31:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:31:30,076 INFO L93 Difference]: Finished difference Result 1495 states and 1917 transitions. [2019-10-01 23:31:30,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2019-10-01 23:31:30,077 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2019-10-01 23:31:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:31:30,082 INFO L225 Difference]: With dead ends: 1495 [2019-10-01 23:31:30,082 INFO L226 Difference]: Without dead ends: 1118 [2019-10-01 23:31:30,102 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36445 ImplicationChecksByTransitivity, 68.3s TimeCoverageRelationStatistics Valid=8039, Invalid=92764, Unknown=3, NotChecked=0, Total=100806 [2019-10-01 23:31:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-10-01 23:31:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 598. [2019-10-01 23:31:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-01 23:31:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 778 transitions. [2019-10-01 23:31:30,208 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 778 transitions. Word has length 136 [2019-10-01 23:31:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:31:30,209 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 778 transitions. [2019-10-01 23:31:30,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 23:31:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 778 transitions. [2019-10-01 23:31:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-01 23:31:30,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:31:30,211 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 10, 10, 10, 10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:31:30,211 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:31:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:31:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1491064355, now seen corresponding path program 25 times [2019-10-01 23:31:30,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:31:30,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:31:30,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:30,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:31:30,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-10-01 23:31:30,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:31:30,790 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:31:30,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:31:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:30,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:31:30,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:31:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Stream Closed [2019-10-01 23:31:30,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:31:30,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 23:31:30,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:31:30,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:31:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:31:30,977 INFO L87 Difference]: Start difference. First operand 598 states and 778 transitions. Second operand 35 states. [2019-10-01 23:31:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:31:31,189 INFO L93 Difference]: Finished difference Result 1130 states and 1490 transitions. [2019-10-01 23:31:31,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:31:31,189 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 138 [2019-10-01 23:31:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:31:31,191 INFO L225 Difference]: With dead ends: 1130 [2019-10-01 23:31:31,192 INFO L226 Difference]: Without dead ends: 601 [2019-10-01 23:31:31,193 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:31:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-01 23:31:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 600. [2019-10-01 23:31:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-01 23:31:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 780 transitions. [2019-10-01 23:31:31,301 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 780 transitions. Word has length 138 [2019-10-01 23:31:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:31:31,301 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 780 transitions. [2019-10-01 23:31:31,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:31:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 780 transitions. [2019-10-01 23:31:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 23:31:31,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:31:31,304 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 10, 10, 10, 10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:31:31,304 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:31:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:31:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1213214977, now seen corresponding path program 26 times [2019-10-01 23:31:31,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:31:31,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:31:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:31,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:31:31,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-10-01 23:31:31,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:31:31,894 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:31:31,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:31:32,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:31:32,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:31:32,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:31:32,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:31:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1314 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-10-01 23:31:32,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:31:32,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 23:31:32,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:31:32,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:31:32,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:31:32,093 INFO L87 Difference]: Start difference. First operand 600 states and 780 transitions. Second operand 36 states. [2019-10-01 23:31:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:31:32,266 INFO L93 Difference]: Finished difference Result 1132 states and 1492 transitions. [2019-10-01 23:31:32,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:31:32,267 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 140 [2019-10-01 23:31:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:31:32,269 INFO L225 Difference]: With dead ends: 1132 [2019-10-01 23:31:32,269 INFO L226 Difference]: Without dead ends: 603 [2019-10-01 23:31:32,270 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:31:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-01 23:31:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 602. [2019-10-01 23:31:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-01 23:31:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 782 transitions. [2019-10-01 23:31:32,403 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 782 transitions. Word has length 140 [2019-10-01 23:31:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:31:32,403 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 782 transitions. [2019-10-01 23:31:32,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:31:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 782 transitions. [2019-10-01 23:31:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 23:31:32,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:31:32,407 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 10, 10, 10, 10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:31:32,407 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:31:32,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:31:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash -487935071, now seen corresponding path program 27 times [2019-10-01 23:31:32,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:31:32,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:31:32,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:32,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:31:32,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-10-01 23:31:32,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:31:32,987 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:31:33,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:31:33,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 23:31:33,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:31:33,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:31:33,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:31:33,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:31:33,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:33,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:31:33,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:31:33,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-01 23:31:33,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-10-01 23:31:33,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:33,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:31:33,343 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-10-01 23:31:33,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-10-01 23:31:33,443 INFO L341 Elim1Store]: treesize reduction 17, result has 73.8 percent of original size [2019-10-01 23:31:33,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 88 [2019-10-01 23:31:33,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:33,478 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:31:33,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:33,480 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-10-01 23:31:33,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:31:33,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:33,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:33,625 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:31:33,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:31:33,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:33,655 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:31:33,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:33,657 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-10-01 23:31:33,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:31:33,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:33,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:33,883 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:31:33,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:31:33,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:33,918 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.9 percent of original size [2019-10-01 23:31:33,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:33,920 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-10-01 23:31:33,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:71 [2019-10-01 23:31:33,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:33,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:34,319 INFO L341 Elim1Store]: treesize reduction 17, result has 66.7 percent of original size [2019-10-01 23:31:34,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 43 [2019-10-01 23:31:34,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:34,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:34,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:34,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-01 23:31:34,344 INFO L567 ElimStorePlain]: treesize reduction 30, result has 48.3 percent of original size [2019-10-01 23:31:34,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:31:34,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-01 23:31:34,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2019-10-01 23:31:34,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-01 23:31:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 63 proven. 125 refuted. 0 times theorem prover too weak. 1191 trivial. 0 not checked. [2019-10-01 23:31:34,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:31:34,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 21] total 55 [2019-10-01 23:31:34,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 23:31:34,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 23:31:34,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2287, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 23:31:34,660 INFO L87 Difference]: Start difference. First operand 602 states and 782 transitions. Second operand 55 states. [2019-10-01 23:31:41,933 WARN L191 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-01 23:31:43,693 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-10-01 23:31:47,171 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2019-10-01 23:31:51,980 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 53 [2019-10-01 23:31:54,264 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-01 23:32:04,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:32:04,981 INFO L93 Difference]: Finished difference Result 1552 states and 1996 transitions. [2019-10-01 23:32:04,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-10-01 23:32:04,982 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 142 [2019-10-01 23:32:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:32:04,987 INFO L225 Difference]: With dead ends: 1552 [2019-10-01 23:32:04,988 INFO L226 Difference]: Without dead ends: 1023 [2019-10-01 23:32:04,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7974 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=3703, Invalid=26398, Unknown=1, NotChecked=0, Total=30102 [2019-10-01 23:32:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-10-01 23:32:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 455. [2019-10-01 23:32:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-10-01 23:32:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 584 transitions. [2019-10-01 23:32:05,097 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 584 transitions. Word has length 142 [2019-10-01 23:32:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:32:05,097 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 584 transitions. [2019-10-01 23:32:05,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 23:32:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 584 transitions. [2019-10-01 23:32:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-01 23:32:05,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:32:05,099 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 10, 10, 10, 10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:32:05,099 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:32:05,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:32:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1272792063, now seen corresponding path program 28 times [2019-10-01 23:32:05,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:32:05,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:32:05,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:32:05,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:32:05,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:32:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:32:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-10-01 23:32:05,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:32:05,707 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:32:05,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:32:05,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:32:05,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:32:05,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:32:05,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:32:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2019-10-01 23:32:06,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:32:06,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 23:32:06,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 23:32:06,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 23:32:06,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:32:06,147 INFO L87 Difference]: Start difference. First operand 455 states and 584 transitions. Second operand 48 states. [2019-10-01 23:32:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:32:07,454 INFO L93 Difference]: Finished difference Result 1279 states and 1684 transitions. [2019-10-01 23:32:07,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 23:32:07,455 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 144 [2019-10-01 23:32:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:32:07,458 INFO L225 Difference]: With dead ends: 1279 [2019-10-01 23:32:07,458 INFO L226 Difference]: Without dead ends: 899 [2019-10-01 23:32:07,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2423, Invalid=4383, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 23:32:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-10-01 23:32:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 505. [2019-10-01 23:32:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-10-01 23:32:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 650 transitions. [2019-10-01 23:32:07,548 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 650 transitions. Word has length 144 [2019-10-01 23:32:07,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:32:07,548 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 650 transitions. [2019-10-01 23:32:07,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 23:32:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 650 transitions. [2019-10-01 23:32:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 23:32:07,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:32:07,551 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 11, 11, 11, 11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:32:07,551 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:32:07,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:32:07,551 INFO L82 PathProgramCache]: Analyzing trace with hash -786647543, now seen corresponding path program 29 times [2019-10-01 23:32:07,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:32:07,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:32:07,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:32:07,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:32:07,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:32:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:32:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-10-01 23:32:08,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:32:08,151 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:32:08,251 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:33:17,169 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-01 23:33:17,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:33:17,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:33:17,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:33:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1577 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2019-10-01 23:33:17,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:33:17,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 14] total 50 [2019-10-01 23:33:17,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 23:33:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 23:33:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 23:33:17,513 INFO L87 Difference]: Start difference. First operand 505 states and 650 transitions. Second operand 50 states. [2019-10-01 23:33:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:33:18,796 INFO L93 Difference]: Finished difference Result 1380 states and 1818 transitions. [2019-10-01 23:33:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 23:33:18,800 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 152 [2019-10-01 23:33:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:33:18,804 INFO L225 Difference]: With dead ends: 1380 [2019-10-01 23:33:18,804 INFO L226 Difference]: Without dead ends: 952 [2019-10-01 23:33:18,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2593, Invalid=4717, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 23:33:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-10-01 23:33:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 558. [2019-10-01 23:33:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-10-01 23:33:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 720 transitions. [2019-10-01 23:33:18,904 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 720 transitions. Word has length 152 [2019-10-01 23:33:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:33:18,904 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 720 transitions. [2019-10-01 23:33:18,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 23:33:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 720 transitions. [2019-10-01 23:33:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-01 23:33:18,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:33:18,906 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 12, 12, 12, 12, 12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:33:18,906 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:33:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:33:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash -856991227, now seen corresponding path program 30 times [2019-10-01 23:33:18,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:33:18,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:33:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:33:18,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:33:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:33:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:33:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-01 23:33:19,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:33:19,696 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:33:19,839 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:33:41,159 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 23:33:41,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:33:41,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:33:41,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:33:41,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:33:41,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:33:41,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:33:41,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:33:41,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-01 23:33:41,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-10-01 23:33:41,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:33:41,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:33:41,292 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-10-01 23:33:41,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-10-01 23:33:41,408 INFO L341 Elim1Store]: treesize reduction 17, result has 73.8 percent of original size [2019-10-01 23:33:41,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 88 [2019-10-01 23:33:41,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:33:41,440 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:33:41,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:41,441 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-10-01 23:33:41,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:33:41,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:41,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:41,632 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:33:41,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:33:41,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:33:41,661 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:33:41,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:41,662 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-10-01 23:33:41,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:33:41,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:41,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:41,820 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:33:41,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:33:41,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:33:41,852 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:33:41,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:41,853 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-10-01 23:33:41,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:33:41,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:41,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:42,027 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:33:42,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:33:42,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:33:42,059 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:33:42,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:42,061 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-10-01 23:33:42,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:33:42,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:42,258 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:33:42,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:33:42,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:33:42,289 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:33:42,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:42,290 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-10-01 23:33:42,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:33:42,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:42,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:42,542 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:33:42,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:33:42,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:33:42,579 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.9 percent of original size [2019-10-01 23:33:42,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:42,580 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-10-01 23:33:42,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:71 [2019-10-01 23:33:42,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:42,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:42,891 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-10-01 23:33:43,011 INFO L341 Elim1Store]: treesize reduction 17, result has 66.7 percent of original size [2019-10-01 23:33:43,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 43 [2019-10-01 23:33:43,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:43,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:43,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:43,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-01 23:33:43,038 INFO L567 ElimStorePlain]: treesize reduction 30, result has 48.3 percent of original size [2019-10-01 23:33:43,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:33:43,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-01 23:33:43,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2019-10-01 23:33:43,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-01 23:33:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 101 proven. 249 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2019-10-01 23:33:43,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:33:43,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 30] total 67 [2019-10-01 23:33:43,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 23:33:43,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 23:33:43,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=3604, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 23:33:43,511 INFO L87 Difference]: Start difference. First operand 558 states and 720 transitions. Second operand 67 states. [2019-10-01 23:34:14,850 WARN L191 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-01 23:34:16,843 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-10-01 23:34:17,294 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-01 23:34:17,529 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-10-01 23:34:17,751 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-10-01 23:34:18,021 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-10-01 23:34:18,290 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-10-01 23:34:18,554 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 34 [2019-10-01 23:34:47,275 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-10-01 23:34:50,183 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-10-01 23:34:52,935 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-01 23:35:03,325 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-01 23:35:04,054 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-01 23:35:36,928 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 56 [2019-10-01 23:36:20,653 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 54 [2019-10-01 23:36:28,044 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-01 23:36:53,516 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-10-01 23:37:31,812 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-10-01 23:38:01,504 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2019-10-01 23:38:09,483 WARN L191 SmtUtils]: Spent 938.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-10-01 23:38:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:38:14,880 INFO L93 Difference]: Finished difference Result 2306 states and 2938 transitions. [2019-10-01 23:38:14,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 424 states. [2019-10-01 23:38:14,881 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 160 [2019-10-01 23:38:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:38:14,886 INFO L225 Difference]: With dead ends: 2306 [2019-10-01 23:38:14,886 INFO L226 Difference]: Without dead ends: 1827 [2019-10-01 23:38:14,898 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92889 ImplicationChecksByTransitivity, 210.7s TimeCoverageRelationStatistics Valid=16260, Invalid=220406, Unknown=16, NotChecked=0, Total=236682 [2019-10-01 23:38:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-10-01 23:38:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 813. [2019-10-01 23:38:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-10-01 23:38:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1060 transitions. [2019-10-01 23:38:15,122 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1060 transitions. Word has length 160 [2019-10-01 23:38:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:38:15,122 INFO L475 AbstractCegarLoop]: Abstraction has 813 states and 1060 transitions. [2019-10-01 23:38:15,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 23:38:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1060 transitions. [2019-10-01 23:38:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 23:38:15,124 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:38:15,124 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 12, 12, 12, 12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:38:15,125 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:38:15,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:38:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1120290007, now seen corresponding path program 31 times [2019-10-01 23:38:15,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:38:15,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:38:15,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:15,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:38:15,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:38:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-01 23:38:15,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:38:15,866 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:38:15,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:38:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:38:16,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:38:16,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:38:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-01 23:38:16,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:38:16,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 23:38:16,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:38:16,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:38:16,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:38:16,157 INFO L87 Difference]: Start difference. First operand 813 states and 1060 transitions. Second operand 41 states. [2019-10-01 23:38:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:38:16,473 INFO L93 Difference]: Finished difference Result 1548 states and 2042 transitions. [2019-10-01 23:38:16,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:38:16,474 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 162 [2019-10-01 23:38:16,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:38:16,476 INFO L225 Difference]: With dead ends: 1548 [2019-10-01 23:38:16,476 INFO L226 Difference]: Without dead ends: 816 [2019-10-01 23:38:16,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:38:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-10-01 23:38:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 815. [2019-10-01 23:38:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-10-01 23:38:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1062 transitions. [2019-10-01 23:38:16,733 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1062 transitions. Word has length 162 [2019-10-01 23:38:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:38:16,733 INFO L475 AbstractCegarLoop]: Abstraction has 815 states and 1062 transitions. [2019-10-01 23:38:16,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:38:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1062 transitions. [2019-10-01 23:38:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-01 23:38:16,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:38:16,738 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 12, 12, 12, 12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:38:16,738 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:38:16,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:38:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2133550517, now seen corresponding path program 32 times [2019-10-01 23:38:16,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:38:16,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:38:16,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:16,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:38:16,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:38:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-01 23:38:17,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:38:17,462 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:38:17,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:38:17,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:38:17,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:38:17,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:38:17,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:38:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-01 23:38:17,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:38:17,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 23:38:17,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 23:38:17,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 23:38:17,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:38:17,703 INFO L87 Difference]: Start difference. First operand 815 states and 1062 transitions. Second operand 42 states. [2019-10-01 23:38:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:38:18,016 INFO L93 Difference]: Finished difference Result 1550 states and 2044 transitions. [2019-10-01 23:38:18,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:38:18,016 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 164 [2019-10-01 23:38:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:38:18,019 INFO L225 Difference]: With dead ends: 1550 [2019-10-01 23:38:18,019 INFO L226 Difference]: Without dead ends: 818 [2019-10-01 23:38:18,020 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:38:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-01 23:38:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 817. [2019-10-01 23:38:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-10-01 23:38:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1064 transitions. [2019-10-01 23:38:18,242 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1064 transitions. Word has length 164 [2019-10-01 23:38:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:38:18,242 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1064 transitions. [2019-10-01 23:38:18,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 23:38:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1064 transitions. [2019-10-01 23:38:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-01 23:38:18,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:38:18,244 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 12, 12, 12, 12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:38:18,245 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:38:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:38:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash -919324435, now seen corresponding path program 33 times [2019-10-01 23:38:18,245 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:38:18,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:38:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:18,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:38:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:38:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-01 23:38:18,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:38:18,987 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:38:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:38:20,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 23:38:20,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:38:20,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 23:38:20,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:38:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1731 trivial. 0 not checked. [2019-10-01 23:38:20,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:38:20,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2019-10-01 23:38:20,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 23:38:20,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 23:38:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 23:38:20,864 INFO L87 Difference]: Start difference. First operand 817 states and 1064 transitions. Second operand 55 states. [2019-10-01 23:38:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:38:22,806 INFO L93 Difference]: Finished difference Result 2625 states and 3466 transitions. [2019-10-01 23:38:22,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 23:38:22,806 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 166 [2019-10-01 23:38:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:38:22,813 INFO L225 Difference]: With dead ends: 2625 [2019-10-01 23:38:22,813 INFO L226 Difference]: Without dead ends: 1893 [2019-10-01 23:38:22,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3165, Invalid=5765, Unknown=0, NotChecked=0, Total=8930 [2019-10-01 23:38:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-10-01 23:38:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 936. [2019-10-01 23:38:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-10-01 23:38:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1222 transitions. [2019-10-01 23:38:23,069 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1222 transitions. Word has length 166 [2019-10-01 23:38:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:38:23,069 INFO L475 AbstractCegarLoop]: Abstraction has 936 states and 1222 transitions. [2019-10-01 23:38:23,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 23:38:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1222 transitions. [2019-10-01 23:38:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 23:38:23,072 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:38:23,072 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 13, 13, 13, 13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:38:23,072 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:38:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:38:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1735089803, now seen corresponding path program 34 times [2019-10-01 23:38:23,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:38:23,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:38:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:23,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:38:23,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:38:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-01 23:38:24,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:38:24,015 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:38:24,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:38:24,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:38:24,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:38:24,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 23:38:24,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:38:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-01 23:38:24,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:38:24,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 23:38:24,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 23:38:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 23:38:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:38:24,365 INFO L87 Difference]: Start difference. First operand 936 states and 1222 transitions. Second operand 44 states. [2019-10-01 23:38:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:38:24,747 INFO L93 Difference]: Finished difference Result 1788 states and 2360 transitions. [2019-10-01 23:38:24,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 23:38:24,748 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 174 [2019-10-01 23:38:24,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:38:24,753 INFO L225 Difference]: With dead ends: 1788 [2019-10-01 23:38:24,753 INFO L226 Difference]: Without dead ends: 939 [2019-10-01 23:38:24,755 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:38:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-10-01 23:38:25,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 938. [2019-10-01 23:38:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-10-01 23:38:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1224 transitions. [2019-10-01 23:38:25,005 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1224 transitions. Word has length 174 [2019-10-01 23:38:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:38:25,006 INFO L475 AbstractCegarLoop]: Abstraction has 938 states and 1224 transitions. [2019-10-01 23:38:25,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 23:38:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1224 transitions. [2019-10-01 23:38:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 23:38:25,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:38:25,008 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 13, 13, 13, 13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:38:25,008 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:38:25,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:38:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1790976617, now seen corresponding path program 35 times [2019-10-01 23:38:25,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:38:25,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:38:25,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:25,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:38:25,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:38:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:38:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-01 23:38:26,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:38:26,211 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:38:26,401 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:40:03,639 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-01 23:40:03,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:03,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:40:03,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-01 23:40:03,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:40:03,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 23:40:03,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 23:40:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 23:40:03,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:40:03,740 INFO L87 Difference]: Start difference. First operand 938 states and 1224 transitions. Second operand 45 states. [2019-10-01 23:40:04,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:40:04,106 INFO L93 Difference]: Finished difference Result 1790 states and 2362 transitions. [2019-10-01 23:40:04,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 23:40:04,106 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 176 [2019-10-01 23:40:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:40:04,110 INFO L225 Difference]: With dead ends: 1790 [2019-10-01 23:40:04,110 INFO L226 Difference]: Without dead ends: 941 [2019-10-01 23:40:04,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:40:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-10-01 23:40:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 940. [2019-10-01 23:40:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-10-01 23:40:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1226 transitions. [2019-10-01 23:40:04,468 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1226 transitions. Word has length 176 [2019-10-01 23:40:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:40:04,469 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1226 transitions. [2019-10-01 23:40:04,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 23:40:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1226 transitions. [2019-10-01 23:40:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-01 23:40:04,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:40:04,470 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 13, 13, 13, 13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:40:04,471 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:40:04,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:40:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash 336369977, now seen corresponding path program 36 times [2019-10-01 23:40:04,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:40:04,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:40:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:04,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:40:04,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:40:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:40:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-01 23:40:05,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:40:05,513 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:40:05,643 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:40:41,873 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 23:40:41,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:40:41,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 23:40:41,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:40:41,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:40:41,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:41,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:40:41,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:40:41,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2019-10-01 23:40:41,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-10-01 23:40:41,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:41,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:40:41,999 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-10-01 23:40:41,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-10-01 23:40:42,120 INFO L341 Elim1Store]: treesize reduction 17, result has 73.8 percent of original size [2019-10-01 23:40:42,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 88 [2019-10-01 23:40:42,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:42,150 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:40:42,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,151 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-10-01 23:40:42,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:68 [2019-10-01 23:40:42,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,312 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:40:42,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:40:42,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:42,347 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:40:42,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,348 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-10-01 23:40:42,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:40:42,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,550 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:40:42,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:40:42,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:42,580 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:40:42,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,581 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-10-01 23:40:42,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:40:42,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,785 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:40:42,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:40:42,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:42,816 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:40:42,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,818 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-10-01 23:40:42,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:40:42,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:42,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:43,011 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:40:43,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:40:43,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:43,044 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:40:43,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:43,046 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-10-01 23:40:43,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:40:43,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:43,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:43,269 INFO L341 Elim1Store]: treesize reduction 52, result has 48.0 percent of original size [2019-10-01 23:40:43,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 100 [2019-10-01 23:40:43,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:40:43,302 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-10-01 23:40:43,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:43,304 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-10-01 23:40:43,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:68 [2019-10-01 23:40:43,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:40:43,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms