/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/pnr5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:47:47,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:47:47,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:47:47,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:47:47,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:47:47,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:47:47,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:47:47,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:47:47,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:47:47,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:47:47,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:47:47,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:47:47,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:47:47,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:47:47,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:47:47,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:47:47,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:47:47,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:47:47,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:47:47,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:47:47,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:47:47,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:47:47,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:47:47,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:47:47,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:47:47,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:47:47,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:47:47,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:47:47,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:47:47,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:47:47,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:47:47,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:47:47,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:47:47,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:47:47,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:47:47,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:47:47,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:47:47,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:47:47,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:47:47,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:47:47,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:47:47,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:47:47,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:47:47,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:47:47,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:47:47,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:47:47,767 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:47:47,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:47:47,767 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:47:47,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:47:47,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:47:47,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:47:47,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:47:47,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:47:47,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:47:47,769 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:47:47,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:47:47,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:47:47,769 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:47:47,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:47:47,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:47:47,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:47:47,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:47:47,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:47:47,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:47:47,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:47:47,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:47:47,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:47:47,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:47:47,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:47:47,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:47:47,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:47:48,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:47:48,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:47:48,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:47:48,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:47:48,117 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:47:48,118 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr5.c [2019-11-23 20:47:48,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723776065/995f4620dbf8498e9d4b3a033919ec89/FLAGc69581827 [2019-11-23 20:47:48,671 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:47:48,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr5.c [2019-11-23 20:47:48,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723776065/995f4620dbf8498e9d4b3a033919ec89/FLAGc69581827 [2019-11-23 20:47:49,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723776065/995f4620dbf8498e9d4b3a033919ec89 [2019-11-23 20:47:49,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:47:49,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:47:49,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:47:49,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:47:49,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:47:49,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61664b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49, skipping insertion in model container [2019-11-23 20:47:49,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:47:49,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:47:49,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:47:49,379 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:47:49,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:47:49,507 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:47:49,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49 WrapperNode [2019-11-23 20:47:49,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:47:49,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:47:49,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:47:49,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:47:49,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:47:49,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:47:49,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:47:49,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:47:49,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (1/1) ... [2019-11-23 20:47:49,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:47:49,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:47:49,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:47:49,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:47:49,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:47:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:47:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 20:47:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:47:49,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:47:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:47:49,955 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:47:49,955 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-23 20:47:49,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:47:49 BoogieIcfgContainer [2019-11-23 20:47:49,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:47:49,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:47:49,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:47:49,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:47:49,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:47:49" (1/3) ... [2019-11-23 20:47:49,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346b7ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:47:49, skipping insertion in model container [2019-11-23 20:47:49,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:47:49" (2/3) ... [2019-11-23 20:47:49,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346b7ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:47:49, skipping insertion in model container [2019-11-23 20:47:49,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:47:49" (3/3) ... [2019-11-23 20:47:49,966 INFO L109 eAbstractionObserver]: Analyzing ICFG pnr5.c [2019-11-23 20:47:49,990 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:47:50,004 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:47:50,026 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:47:50,051 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:47:50,051 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:47:50,051 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:47:50,051 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:47:50,054 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:47:50,054 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:47:50,054 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:47:50,054 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:47:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-11-23 20:47:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 20:47:50,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:50,087 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:50,088 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:50,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:50,092 INFO L82 PathProgramCache]: Analyzing trace with hash -560170606, now seen corresponding path program 1 times [2019-11-23 20:47:50,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:50,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568049003] [2019-11-23 20:47:50,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:50,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568049003] [2019-11-23 20:47:50,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:47:50,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:47:50,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875319127] [2019-11-23 20:47:50,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:47:50,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:50,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:47:50,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:47:50,476 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2019-11-23 20:47:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:50,594 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-11-23 20:47:50,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:47:50,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-23 20:47:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:50,607 INFO L225 Difference]: With dead ends: 62 [2019-11-23 20:47:50,608 INFO L226 Difference]: Without dead ends: 43 [2019-11-23 20:47:50,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:47:50,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-23 20:47:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-11-23 20:47:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 20:47:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-23 20:47:50,653 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 9 [2019-11-23 20:47:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:50,653 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-23 20:47:50,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:47:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-23 20:47:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 20:47:50,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:50,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:50,655 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1791728038, now seen corresponding path program 1 times [2019-11-23 20:47:50,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:50,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964292703] [2019-11-23 20:47:50,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:51,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964292703] [2019-11-23 20:47:51,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662222082] [2019-11-23 20:47:51,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:51,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:47:51,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:51,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:47:51,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:51,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:51,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:51,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:47:51,711 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:51,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:47:51,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:51,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:51,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:51,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:47:51,738 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:51,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:47:51,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:51,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:51,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:51,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:47:51,766 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:51,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:47:51,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:51,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:51,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:51,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:47:51,790 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-23 20:47:51,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-11-23 20:47:51,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:51,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:51,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:51,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2019-11-23 20:47:51,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:51,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:51,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-23 20:47:51,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411821068] [2019-11-23 20:47:51,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 20:47:51,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:51,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 20:47:51,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:47:51,843 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 14 states. [2019-11-23 20:47:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:52,289 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2019-11-23 20:47:52,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 20:47:52,290 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-23 20:47:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:52,295 INFO L225 Difference]: With dead ends: 105 [2019-11-23 20:47:52,295 INFO L226 Difference]: Without dead ends: 103 [2019-11-23 20:47:52,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:47:52,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-23 20:47:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-11-23 20:47:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-23 20:47:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2019-11-23 20:47:52,324 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 25 [2019-11-23 20:47:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:52,332 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2019-11-23 20:47:52,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 20:47:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2019-11-23 20:47:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 20:47:52,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:52,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:52,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:52,543 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash 814295516, now seen corresponding path program 1 times [2019-11-23 20:47:52,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:52,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182756202] [2019-11-23 20:47:52,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:53,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182756202] [2019-11-23 20:47:53,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770438611] [2019-11-23 20:47:53,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:53,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-23 20:47:53,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:53,225 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:47:53,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:53,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:53,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:53,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:47:53,268 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:53,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:47:53,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:53,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:53,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:53,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:47:53,292 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:53,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:47:53,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:53,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:53,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:53,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:47:53,328 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:53,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:47:53,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:53,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:53,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:53,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:47:53,350 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-23 20:47:53,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-11-23 20:47:53,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:53,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:53,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:53,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-23 20:47:53,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:53,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:53,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-23 20:47:53,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112225032] [2019-11-23 20:47:53,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:47:53,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:53,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:47:53,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:47:53,436 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand 15 states. [2019-11-23 20:47:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:54,439 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2019-11-23 20:47:54,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-23 20:47:54,441 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-11-23 20:47:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:54,444 INFO L225 Difference]: With dead ends: 120 [2019-11-23 20:47:54,444 INFO L226 Difference]: Without dead ends: 118 [2019-11-23 20:47:54,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:47:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-23 20:47:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 30. [2019-11-23 20:47:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 20:47:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-23 20:47:54,453 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2019-11-23 20:47:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:54,454 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-23 20:47:54,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:47:54,454 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-23 20:47:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 20:47:54,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:54,455 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:54,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:54,670 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:54,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:54,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2038625904, now seen corresponding path program 1 times [2019-11-23 20:47:54,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:54,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491121882] [2019-11-23 20:47:54,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:55,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491121882] [2019-11-23 20:47:55,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129906215] [2019-11-23 20:47:55,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:55,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 20:47:55,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:55,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:47:55,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:55,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:55,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:55,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:47:55,188 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:55,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:47:55,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:55,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:55,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:55,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:47:55,207 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:55,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:47:55,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:55,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:55,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:55,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:47:55,228 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:47:55,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2019-11-23 20:47:55,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:55,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:55,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:55,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-11-23 20:47:55,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:55,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:55,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-11-23 20:47:55,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623010822] [2019-11-23 20:47:55,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:47:55,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:55,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:47:55,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:47:55,291 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 15 states. [2019-11-23 20:47:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:55,987 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2019-11-23 20:47:55,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-23 20:47:55,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-11-23 20:47:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:55,990 INFO L225 Difference]: With dead ends: 136 [2019-11-23 20:47:55,991 INFO L226 Difference]: Without dead ends: 134 [2019-11-23 20:47:55,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:47:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-23 20:47:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 51. [2019-11-23 20:47:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-23 20:47:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2019-11-23 20:47:56,003 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 29 [2019-11-23 20:47:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:56,004 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-23 20:47:56,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:47:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2019-11-23 20:47:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 20:47:56,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:56,005 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:56,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:56,206 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1438692942, now seen corresponding path program 1 times [2019-11-23 20:47:56,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:56,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253161241] [2019-11-23 20:47:56,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:56,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253161241] [2019-11-23 20:47:56,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415534626] [2019-11-23 20:47:56,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:56,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-23 20:47:56,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:56,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:47:56,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:56,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:56,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:56,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:47:56,811 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:56,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:47:56,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:56,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:56,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:56,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:47:56,834 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:47:56,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:47:56,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:56,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:56,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:56,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:47:56,855 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:47:56,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:47:56,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:56,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:56,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:56,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:47:56,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:56,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:56,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-23 20:47:56,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443675979] [2019-11-23 20:47:56,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:47:56,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:56,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:47:56,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:47:56,936 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 16 states. [2019-11-23 20:47:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:47:58,891 INFO L93 Difference]: Finished difference Result 195 states and 237 transitions. [2019-11-23 20:47:58,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-23 20:47:58,891 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-11-23 20:47:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:47:58,893 INFO L225 Difference]: With dead ends: 195 [2019-11-23 20:47:58,894 INFO L226 Difference]: Without dead ends: 193 [2019-11-23 20:47:58,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=499, Invalid=1757, Unknown=0, NotChecked=0, Total=2256 [2019-11-23 20:47:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-23 20:47:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 72. [2019-11-23 20:47:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-23 20:47:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2019-11-23 20:47:58,911 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 29 [2019-11-23 20:47:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:47:58,912 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2019-11-23 20:47:58,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:47:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2019-11-23 20:47:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 20:47:58,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:47:58,913 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:47:59,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:59,124 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:47:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:47:59,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1883954746, now seen corresponding path program 2 times [2019-11-23 20:47:59,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:47:59,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939939060] [2019-11-23 20:47:59,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:47:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:47:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:59,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939939060] [2019-11-23 20:47:59,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737754839] [2019-11-23 20:47:59,538 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:47:59,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:47:59,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:47:59,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-23 20:47:59,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:47:59,630 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:47:59,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:59,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:59,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:59,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-23 20:47:59,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:59,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:47:59,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:59,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:59,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:59,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:23 [2019-11-23 20:47:59,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:47:59,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-23 20:47:59,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:47:59,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:47:59,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:47:59,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2019-11-23 20:47:59,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:47:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:47:59,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:47:59,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-23 20:47:59,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339819476] [2019-11-23 20:47:59,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 20:47:59,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:47:59,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 20:47:59,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-23 20:47:59,789 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 18 states. [2019-11-23 20:48:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:00,980 INFO L93 Difference]: Finished difference Result 248 states and 312 transitions. [2019-11-23 20:48:00,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-23 20:48:00,981 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-11-23 20:48:00,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:00,983 INFO L225 Difference]: With dead ends: 248 [2019-11-23 20:48:00,983 INFO L226 Difference]: Without dead ends: 246 [2019-11-23 20:48:00,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=382, Invalid=1510, Unknown=0, NotChecked=0, Total=1892 [2019-11-23 20:48:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-23 20:48:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 173. [2019-11-23 20:48:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-23 20:48:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 227 transitions. [2019-11-23 20:48:01,012 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 227 transitions. Word has length 33 [2019-11-23 20:48:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:01,012 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 227 transitions. [2019-11-23 20:48:01,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 20:48:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 227 transitions. [2019-11-23 20:48:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 20:48:01,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:01,015 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:01,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:01,228 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:01,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:01,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1461252920, now seen corresponding path program 1 times [2019-11-23 20:48:01,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:01,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328989489] [2019-11-23 20:48:01,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:01,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328989489] [2019-11-23 20:48:01,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581879211] [2019-11-23 20:48:01,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:01,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-23 20:48:01,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:01,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:01,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:01,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:01,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:01,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:01,822 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:01,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:01,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:01,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:01,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:01,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:01,842 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:48:01,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:01,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:01,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:01,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:01,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:48:01,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:01,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:01,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-23 20:48:01,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461352465] [2019-11-23 20:48:01,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 20:48:01,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:01,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 20:48:01,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-11-23 20:48:01,953 INFO L87 Difference]: Start difference. First operand 173 states and 227 transitions. Second operand 18 states. [2019-11-23 20:48:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:04,413 INFO L93 Difference]: Finished difference Result 371 states and 469 transitions. [2019-11-23 20:48:04,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-23 20:48:04,414 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-11-23 20:48:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:04,416 INFO L225 Difference]: With dead ends: 371 [2019-11-23 20:48:04,416 INFO L226 Difference]: Without dead ends: 369 [2019-11-23 20:48:04,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=529, Invalid=2441, Unknown=0, NotChecked=0, Total=2970 [2019-11-23 20:48:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-23 20:48:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 256. [2019-11-23 20:48:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-23 20:48:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 341 transitions. [2019-11-23 20:48:04,472 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 341 transitions. Word has length 33 [2019-11-23 20:48:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:04,472 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 341 transitions. [2019-11-23 20:48:04,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 20:48:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 341 transitions. [2019-11-23 20:48:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 20:48:04,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:04,475 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:04,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:04,683 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:04,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1843777796, now seen corresponding path program 3 times [2019-11-23 20:48:04,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:04,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152039912] [2019-11-23 20:48:04,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:05,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152039912] [2019-11-23 20:48:05,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412581861] [2019-11-23 20:48:05,147 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:05,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 20:48:05,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:05,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-23 20:48:05,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:05,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:05,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:05,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:05,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:05,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-23 20:48:05,277 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:48:05,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2019-11-23 20:48:05,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:05,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:05,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:05,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-11-23 20:48:05,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:05,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:05,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-11-23 20:48:05,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161148626] [2019-11-23 20:48:05,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 20:48:05,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:05,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 20:48:05,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:48:05,400 INFO L87 Difference]: Start difference. First operand 256 states and 341 transitions. Second operand 20 states. [2019-11-23 20:48:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:06,750 INFO L93 Difference]: Finished difference Result 700 states and 917 transitions. [2019-11-23 20:48:06,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-23 20:48:06,751 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-11-23 20:48:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:06,755 INFO L225 Difference]: With dead ends: 700 [2019-11-23 20:48:06,755 INFO L226 Difference]: Without dead ends: 698 [2019-11-23 20:48:06,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=439, Invalid=2011, Unknown=0, NotChecked=0, Total=2450 [2019-11-23 20:48:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-23 20:48:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 605. [2019-11-23 20:48:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-11-23 20:48:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 813 transitions. [2019-11-23 20:48:06,814 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 813 transitions. Word has length 37 [2019-11-23 20:48:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:06,815 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 813 transitions. [2019-11-23 20:48:06,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 20:48:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 813 transitions. [2019-11-23 20:48:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 20:48:06,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:06,817 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:07,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:07,022 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:07,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:07,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1624923078, now seen corresponding path program 1 times [2019-11-23 20:48:07,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:07,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871327566] [2019-11-23 20:48:07,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:07,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871327566] [2019-11-23 20:48:07,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967227734] [2019-11-23 20:48:07,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:07,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-23 20:48:07,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:07,727 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:07,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:07,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:07,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:07,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:07,775 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:48:07,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:07,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:07,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:07,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:07,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:48:07,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:07,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:07,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-11-23 20:48:07,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135799706] [2019-11-23 20:48:07,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-23 20:48:07,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:07,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-23 20:48:07,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:48:07,946 INFO L87 Difference]: Start difference. First operand 605 states and 813 transitions. Second operand 20 states. [2019-11-23 20:48:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:10,682 INFO L93 Difference]: Finished difference Result 1017 states and 1335 transitions. [2019-11-23 20:48:10,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-23 20:48:10,682 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-11-23 20:48:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:10,687 INFO L225 Difference]: With dead ends: 1017 [2019-11-23 20:48:10,688 INFO L226 Difference]: Without dead ends: 1015 [2019-11-23 20:48:10,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=602, Invalid=3180, Unknown=0, NotChecked=0, Total=3782 [2019-11-23 20:48:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-23 20:48:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2019-11-23 20:48:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-11-23 20:48:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1179 transitions. [2019-11-23 20:48:10,785 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1179 transitions. Word has length 37 [2019-11-23 20:48:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:10,786 INFO L462 AbstractCegarLoop]: Abstraction has 872 states and 1179 transitions. [2019-11-23 20:48:10,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-23 20:48:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1179 transitions. [2019-11-23 20:48:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:48:10,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:10,788 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:10,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:10,994 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:10,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1809206990, now seen corresponding path program 4 times [2019-11-23 20:48:10,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:10,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445525865] [2019-11-23 20:48:10,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:11,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445525865] [2019-11-23 20:48:11,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15621135] [2019-11-23 20:48:11,591 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:11,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:48:11,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:11,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-23 20:48:11,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:11,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:48:11,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:11,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:11,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:48:11,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:11,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:11,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-23 20:48:11,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490338234] [2019-11-23 20:48:11,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 20:48:11,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:11,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 20:48:11,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:48:11,917 INFO L87 Difference]: Start difference. First operand 872 states and 1179 transitions. Second operand 22 states. [2019-11-23 20:48:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:14,217 INFO L93 Difference]: Finished difference Result 2174 states and 2910 transitions. [2019-11-23 20:48:14,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-23 20:48:14,218 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-11-23 20:48:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:14,229 INFO L225 Difference]: With dead ends: 2174 [2019-11-23 20:48:14,229 INFO L226 Difference]: Without dead ends: 2147 [2019-11-23 20:48:14,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=469, Invalid=2393, Unknown=0, NotChecked=0, Total=2862 [2019-11-23 20:48:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2019-11-23 20:48:14,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2059. [2019-11-23 20:48:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2019-11-23 20:48:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2785 transitions. [2019-11-23 20:48:14,407 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2785 transitions. Word has length 41 [2019-11-23 20:48:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:14,407 INFO L462 AbstractCegarLoop]: Abstraction has 2059 states and 2785 transitions. [2019-11-23 20:48:14,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 20:48:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2785 transitions. [2019-11-23 20:48:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:48:14,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:14,409 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:14,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:14,612 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash 680321972, now seen corresponding path program 1 times [2019-11-23 20:48:14,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:14,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711097194] [2019-11-23 20:48:14,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:15,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711097194] [2019-11-23 20:48:15,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273067736] [2019-11-23 20:48:15,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:15,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-23 20:48:15,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:15,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-23 20:48:15,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:15,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:15,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:15,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-11-23 20:48:15,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:15,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:15,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-23 20:48:15,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271701797] [2019-11-23 20:48:15,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 20:48:15,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:15,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 20:48:15,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:48:15,461 INFO L87 Difference]: Start difference. First operand 2059 states and 2785 transitions. Second operand 22 states. [2019-11-23 20:48:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:18,060 INFO L93 Difference]: Finished difference Result 3027 states and 4056 transitions. [2019-11-23 20:48:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-23 20:48:18,060 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-11-23 20:48:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:18,073 INFO L225 Difference]: With dead ends: 3027 [2019-11-23 20:48:18,073 INFO L226 Difference]: Without dead ends: 3000 [2019-11-23 20:48:18,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=474, Invalid=2496, Unknown=0, NotChecked=0, Total=2970 [2019-11-23 20:48:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2019-11-23 20:48:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2860. [2019-11-23 20:48:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2860 states. [2019-11-23 20:48:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3875 transitions. [2019-11-23 20:48:18,345 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3875 transitions. Word has length 41 [2019-11-23 20:48:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:18,345 INFO L462 AbstractCegarLoop]: Abstraction has 2860 states and 3875 transitions. [2019-11-23 20:48:18,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 20:48:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3875 transitions. [2019-11-23 20:48:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 20:48:18,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:18,347 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:18,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:18,550 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:18,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:18,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1263898858, now seen corresponding path program 1 times [2019-11-23 20:48:18,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:18,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114669965] [2019-11-23 20:48:18,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:18,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114669965] [2019-11-23 20:48:18,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146475264] [2019-11-23 20:48:18,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:18,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-23 20:48:18,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:18,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:18,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:18,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:48:18,837 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:18,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:48:18,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:18,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:48:18,859 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:18,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:48:18,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:18,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:48:18,883 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:18,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:48:18,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:18,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:48:18,920 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:18,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:18,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:18,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:18,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:18,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 58 [2019-11-23 20:48:18,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:18,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,960 INFO L567 ElimStorePlain]: treesize reduction 32, result has 44.8 percent of original size [2019-11-23 20:48:18,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:18,974 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:18,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:18,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:18,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:18,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:18,996 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:18,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:18,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:19,018 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:19,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:19,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:19,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:19,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:10 [2019-11-23 20:48:19,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:19,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:19,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-11-23 20:48:19,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507168962] [2019-11-23 20:48:19,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:48:19,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:19,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:48:19,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:48:19,055 INFO L87 Difference]: Start difference. First operand 2860 states and 3875 transitions. Second operand 12 states. [2019-11-23 20:48:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:19,739 INFO L93 Difference]: Finished difference Result 3894 states and 5239 transitions. [2019-11-23 20:48:19,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 20:48:19,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-23 20:48:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:19,759 INFO L225 Difference]: With dead ends: 3894 [2019-11-23 20:48:19,759 INFO L226 Difference]: Without dead ends: 3892 [2019-11-23 20:48:19,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:48:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2019-11-23 20:48:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 2860. [2019-11-23 20:48:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2860 states. [2019-11-23 20:48:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3875 transitions. [2019-11-23 20:48:20,092 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3875 transitions. Word has length 45 [2019-11-23 20:48:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:20,092 INFO L462 AbstractCegarLoop]: Abstraction has 2860 states and 3875 transitions. [2019-11-23 20:48:20,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:48:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3875 transitions. [2019-11-23 20:48:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 20:48:20,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:20,096 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:20,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:20,300 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash -840617194, now seen corresponding path program 2 times [2019-11-23 20:48:20,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:20,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159858899] [2019-11-23 20:48:20,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:20,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159858899] [2019-11-23 20:48:20,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492944254] [2019-11-23 20:48:20,545 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:20,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:20,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:20,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-23 20:48:20,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:20,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:20,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:48:20,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,663 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:20,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:20,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:20,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:20,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:20,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:20,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:20,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:20,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:20,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:20,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:20,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:20,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:20,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:20,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:20,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:20,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:20,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:20,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:16 [2019-11-23 20:48:20,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:20,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:20,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-23 20:48:20,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534633838] [2019-11-23 20:48:20,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-23 20:48:20,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-23 20:48:20,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-11-23 20:48:20,885 INFO L87 Difference]: Start difference. First operand 2860 states and 3875 transitions. Second operand 18 states. [2019-11-23 20:48:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:22,660 INFO L93 Difference]: Finished difference Result 3351 states and 4373 transitions. [2019-11-23 20:48:22,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-23 20:48:22,660 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-23 20:48:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:22,672 INFO L225 Difference]: With dead ends: 3351 [2019-11-23 20:48:22,673 INFO L226 Difference]: Without dead ends: 3349 [2019-11-23 20:48:22,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=386, Invalid=1336, Unknown=0, NotChecked=0, Total=1722 [2019-11-23 20:48:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2019-11-23 20:48:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 1019. [2019-11-23 20:48:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-11-23 20:48:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1367 transitions. [2019-11-23 20:48:22,835 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1367 transitions. Word has length 45 [2019-11-23 20:48:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:22,835 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1367 transitions. [2019-11-23 20:48:22,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-23 20:48:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1367 transitions. [2019-11-23 20:48:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:48:22,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:22,837 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:23,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:23,041 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:23,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:23,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1429188304, now seen corresponding path program 5 times [2019-11-23 20:48:23,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:23,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331998194] [2019-11-23 20:48:23,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:23,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331998194] [2019-11-23 20:48:23,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644211656] [2019-11-23 20:48:23,196 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:23,293 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-23 20:48:23,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:23,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-23 20:48:23,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:23,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:23,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-23 20:48:23,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:23,403 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:48:23,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-11-23 20:48:23,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:23,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:48:23,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-11-23 20:48:23,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:23,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:48:23,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:20 [2019-11-23 20:48:23,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:23,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-23 20:48:23,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:23,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:23,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2019-11-23 20:48:23,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:23,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:23,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-23 20:48:23,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946798588] [2019-11-23 20:48:23,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-23 20:48:23,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:23,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-23 20:48:23,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:48:23,627 INFO L87 Difference]: Start difference. First operand 1019 states and 1367 transitions. Second operand 24 states. [2019-11-23 20:48:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:28,382 INFO L93 Difference]: Finished difference Result 4930 states and 6583 transitions. [2019-11-23 20:48:28,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-11-23 20:48:28,383 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2019-11-23 20:48:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:28,399 INFO L225 Difference]: With dead ends: 4930 [2019-11-23 20:48:28,399 INFO L226 Difference]: Without dead ends: 4928 [2019-11-23 20:48:28,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5817 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1583, Invalid=13423, Unknown=0, NotChecked=0, Total=15006 [2019-11-23 20:48:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2019-11-23 20:48:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 2045. [2019-11-23 20:48:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-11-23 20:48:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2761 transitions. [2019-11-23 20:48:28,636 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2761 transitions. Word has length 61 [2019-11-23 20:48:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:28,636 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 2761 transitions. [2019-11-23 20:48:28,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-23 20:48:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2761 transitions. [2019-11-23 20:48:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:48:28,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:28,638 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:28,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:28,839 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:28,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1020411826, now seen corresponding path program 1 times [2019-11-23 20:48:28,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:28,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270293101] [2019-11-23 20:48:28,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:29,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270293101] [2019-11-23 20:48:29,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389463731] [2019-11-23 20:48:29,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:29,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-23 20:48:29,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:29,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:29,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:29,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:48:29,218 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:29,218 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:29,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:29,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:29,240 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:29,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:29,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:29,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:29,267 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:29,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:29,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:29,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:29,292 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:48:29,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:29,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:29,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:29,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:48:29,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:29,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:29,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-11-23 20:48:29,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818003430] [2019-11-23 20:48:29,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-23 20:48:29,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:29,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-23 20:48:29,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-11-23 20:48:29,481 INFO L87 Difference]: Start difference. First operand 2045 states and 2761 transitions. Second operand 25 states. [2019-11-23 20:48:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:34,052 INFO L93 Difference]: Finished difference Result 4580 states and 6079 transitions. [2019-11-23 20:48:34,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-11-23 20:48:34,053 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2019-11-23 20:48:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:34,069 INFO L225 Difference]: With dead ends: 4580 [2019-11-23 20:48:34,069 INFO L226 Difference]: Without dead ends: 4578 [2019-11-23 20:48:34,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1163, Invalid=7209, Unknown=0, NotChecked=0, Total=8372 [2019-11-23 20:48:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2019-11-23 20:48:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 1075. [2019-11-23 20:48:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-11-23 20:48:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1427 transitions. [2019-11-23 20:48:34,215 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1427 transitions. Word has length 61 [2019-11-23 20:48:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:34,215 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 1427 transitions. [2019-11-23 20:48:34,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-23 20:48:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1427 transitions. [2019-11-23 20:48:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 20:48:34,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:34,217 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:34,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:34,418 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:34,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:34,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1138465126, now seen corresponding path program 6 times [2019-11-23 20:48:34,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:34,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737665751] [2019-11-23 20:48:34,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:34,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737665751] [2019-11-23 20:48:34,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403913040] [2019-11-23 20:48:34,593 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:34,714 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-23 20:48:34,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:34,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-23 20:48:34,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:34,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:34,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:34,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-23 20:48:34,818 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:34,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:48:34,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:34,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-11-23 20:48:34,901 INFO L343 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2019-11-23 20:48:34,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 45 [2019-11-23 20:48:34,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:34,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2019-11-23 20:48:34,935 INFO L343 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2019-11-23 20:48:34,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2019-11-23 20:48:34,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:34,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:34,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2019-11-23 20:48:35,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:35,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:35,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-11-23 20:48:35,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952264107] [2019-11-23 20:48:35,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:48:35,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:35,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:48:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:48:35,221 INFO L87 Difference]: Start difference. First operand 1075 states and 1427 transitions. Second operand 27 states. [2019-11-23 20:48:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:45,487 INFO L93 Difference]: Finished difference Result 10378 states and 13888 transitions. [2019-11-23 20:48:45,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-11-23 20:48:45,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 65 [2019-11-23 20:48:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:45,517 INFO L225 Difference]: With dead ends: 10378 [2019-11-23 20:48:45,517 INFO L226 Difference]: Without dead ends: 10376 [2019-11-23 20:48:45,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23155 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4895, Invalid=48697, Unknown=0, NotChecked=0, Total=53592 [2019-11-23 20:48:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10376 states. [2019-11-23 20:48:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10376 to 3469. [2019-11-23 20:48:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3469 states. [2019-11-23 20:48:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 4677 transitions. [2019-11-23 20:48:45,953 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 4677 transitions. Word has length 65 [2019-11-23 20:48:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:45,954 INFO L462 AbstractCegarLoop]: Abstraction has 3469 states and 4677 transitions. [2019-11-23 20:48:45,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:48:45,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 4677 transitions. [2019-11-23 20:48:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 20:48:45,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:45,957 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:46,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:46,203 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:46,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:46,204 INFO L82 PathProgramCache]: Analyzing trace with hash 798271064, now seen corresponding path program 1 times [2019-11-23 20:48:46,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:46,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781578457] [2019-11-23 20:48:46,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:46,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781578457] [2019-11-23 20:48:46,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127640079] [2019-11-23 20:48:46,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:46,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 20:48:46,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:46,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:46,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:48:46,526 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:46,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:48:46,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:48:46,544 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:48:46,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2019-11-23 20:48:46,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-23 20:48:46,561 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:46,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:46,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:46,580 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:46,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:46,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:46,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 58 [2019-11-23 20:48:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:46,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,627 INFO L567 ElimStorePlain]: treesize reduction 32, result has 44.8 percent of original size [2019-11-23 20:48:46,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:46,645 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:46,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:46,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:46,662 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:46,663 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:46,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:46,692 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:46,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:46,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:46,727 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:46,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:46,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:46,748 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 58 [2019-11-23 20:48:46,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:46,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,766 INFO L567 ElimStorePlain]: treesize reduction 32, result has 44.8 percent of original size [2019-11-23 20:48:46,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:46,778 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:46,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:46,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:14 [2019-11-23 20:48:46,795 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-23 20:48:46,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-23 20:48:46,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:46,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:46,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:10 [2019-11-23 20:48:46,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:46,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:46,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2019-11-23 20:48:46,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610002594] [2019-11-23 20:48:46,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 20:48:46,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:46,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 20:48:46,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-23 20:48:46,837 INFO L87 Difference]: Start difference. First operand 3469 states and 4677 transitions. Second operand 15 states. [2019-11-23 20:48:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:47,907 INFO L93 Difference]: Finished difference Result 4750 states and 6319 transitions. [2019-11-23 20:48:47,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:48:47,908 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-11-23 20:48:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:47,916 INFO L225 Difference]: With dead ends: 4750 [2019-11-23 20:48:47,916 INFO L226 Difference]: Without dead ends: 4748 [2019-11-23 20:48:47,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 72 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-11-23 20:48:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2019-11-23 20:48:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 3469. [2019-11-23 20:48:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3469 states. [2019-11-23 20:48:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 4677 transitions. [2019-11-23 20:48:48,395 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 4677 transitions. Word has length 65 [2019-11-23 20:48:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:48,395 INFO L462 AbstractCegarLoop]: Abstraction has 3469 states and 4677 transitions. [2019-11-23 20:48:48,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 20:48:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 4677 transitions. [2019-11-23 20:48:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 20:48:48,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:48,405 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:48,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:48,608 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:48,608 INFO L82 PathProgramCache]: Analyzing trace with hash -233342172, now seen corresponding path program 3 times [2019-11-23 20:48:48,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:48,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409223520] [2019-11-23 20:48:48,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:48,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409223520] [2019-11-23 20:48:48,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338141739] [2019-11-23 20:48:48,844 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:48,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-23 20:48:48,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:48,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-23 20:48:48,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:49,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:49,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:49,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:49,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:49,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:48:49,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:49,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:49,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:49,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:49,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:49,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:49,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:49,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:49,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:49,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:49,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:49,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:49,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:49,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:48:49,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:49,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:49,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:49,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-11-23 20:48:49,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:49,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:49,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2019-11-23 20:48:49,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835111596] [2019-11-23 20:48:49,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-23 20:48:49,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:49,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-23 20:48:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2019-11-23 20:48:49,300 INFO L87 Difference]: Start difference. First operand 3469 states and 4677 transitions. Second operand 27 states. [2019-11-23 20:48:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:48:56,185 INFO L93 Difference]: Finished difference Result 8628 states and 11557 transitions. [2019-11-23 20:48:56,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-11-23 20:48:56,186 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 65 [2019-11-23 20:48:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:48:56,201 INFO L225 Difference]: With dead ends: 8628 [2019-11-23 20:48:56,202 INFO L226 Difference]: Without dead ends: 8626 [2019-11-23 20:48:56,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4233 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1615, Invalid=11041, Unknown=0, NotChecked=0, Total=12656 [2019-11-23 20:48:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8626 states. [2019-11-23 20:48:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8626 to 2567. [2019-11-23 20:48:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2567 states. [2019-11-23 20:48:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 3459 transitions. [2019-11-23 20:48:57,049 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 3459 transitions. Word has length 65 [2019-11-23 20:48:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:48:57,049 INFO L462 AbstractCegarLoop]: Abstraction has 2567 states and 3459 transitions. [2019-11-23 20:48:57,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-23 20:48:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3459 transitions. [2019-11-23 20:48:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-23 20:48:57,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:48:57,051 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:48:57,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:57,266 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:48:57,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:48:57,266 INFO L82 PathProgramCache]: Analyzing trace with hash 819469912, now seen corresponding path program 2 times [2019-11-23 20:48:57,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:48:57,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147349987] [2019-11-23 20:48:57,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:48:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:48:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:57,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147349987] [2019-11-23 20:48:57,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838222914] [2019-11-23 20:48:57,746 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:48:57,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:48:57,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:48:57,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-23 20:48:57,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:48:57,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:48:57,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:57,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-23 20:48:57,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:57,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:57,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:57,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:57,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:57,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:57,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:48:57,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-23 20:48:58,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:58,030 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:58,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:58,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:58,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:58,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:58,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:58,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:58,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:58,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:58,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:58,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:58,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:58,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:58,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:58,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:58,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:58,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:58,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:58,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:58,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:58,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:58,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:58,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:58,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:58,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:58,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:48:58,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:48:58,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-23 20:48:58,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:48:58,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:48:58,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:16 [2019-11-23 20:48:58,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:48:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:48:58,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:48:58,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-23 20:48:58,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019843882] [2019-11-23 20:48:58,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-23 20:48:58,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:48:58,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-23 20:48:58,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-23 20:48:58,325 INFO L87 Difference]: Start difference. First operand 2567 states and 3459 transitions. Second operand 22 states. [2019-11-23 20:49:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:00,332 INFO L93 Difference]: Finished difference Result 2767 states and 3665 transitions. [2019-11-23 20:49:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 20:49:00,332 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2019-11-23 20:49:00,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:00,338 INFO L225 Difference]: With dead ends: 2767 [2019-11-23 20:49:00,338 INFO L226 Difference]: Without dead ends: 2765 [2019-11-23 20:49:00,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 67 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=478, Invalid=2072, Unknown=0, NotChecked=0, Total=2550 [2019-11-23 20:49:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2019-11-23 20:49:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 986. [2019-11-23 20:49:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2019-11-23 20:49:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1309 transitions. [2019-11-23 20:49:00,647 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1309 transitions. Word has length 65 [2019-11-23 20:49:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:00,648 INFO L462 AbstractCegarLoop]: Abstraction has 986 states and 1309 transitions. [2019-11-23 20:49:00,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-23 20:49:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1309 transitions. [2019-11-23 20:49:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-23 20:49:00,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:00,649 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:00,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:00,852 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:00,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1916546206, now seen corresponding path program 3 times [2019-11-23 20:49:00,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:00,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267249230] [2019-11-23 20:49:00,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:01,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267249230] [2019-11-23 20:49:01,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582872090] [2019-11-23 20:49:01,983 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:02,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-11-23 20:49:02,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:49:02,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-23 20:49:02,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:02,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:49:02,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:02,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:02,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:02,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-23 20:49:02,250 INFO L343 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-23 20:49:02,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-23 20:49:02,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:02,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:02,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:02,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-23 20:49:02,271 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:49:02,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-23 20:49:02,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:02,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:02,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:02,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-11-23 20:49:02,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:02,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:02,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2019-11-23 20:49:02,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318235746] [2019-11-23 20:49:02,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-23 20:49:02,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-23 20:49:02,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-11-23 20:49:02,607 INFO L87 Difference]: Start difference. First operand 986 states and 1309 transitions. Second operand 30 states. [2019-11-23 20:49:07,329 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-23 20:49:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:10,466 INFO L93 Difference]: Finished difference Result 1900 states and 2482 transitions. [2019-11-23 20:49:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-11-23 20:49:10,466 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 69 [2019-11-23 20:49:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:10,470 INFO L225 Difference]: With dead ends: 1900 [2019-11-23 20:49:10,471 INFO L226 Difference]: Without dead ends: 1898 [2019-11-23 20:49:10,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2744 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1027, Invalid=8873, Unknown=0, NotChecked=0, Total=9900 [2019-11-23 20:49:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-11-23 20:49:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1618. [2019-11-23 20:49:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-11-23 20:49:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2179 transitions. [2019-11-23 20:49:10,938 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2179 transitions. Word has length 69 [2019-11-23 20:49:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:10,938 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 2179 transitions. [2019-11-23 20:49:10,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-23 20:49:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2179 transitions. [2019-11-23 20:49:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 20:49:10,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:10,939 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:11,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:11,143 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1018071250, now seen corresponding path program 7 times [2019-11-23 20:49:11,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:11,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185225936] [2019-11-23 20:49:11,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:49:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:12,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185225936] [2019-11-23 20:49:12,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181470824] [2019-11-23 20:49:12,205 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:49:12,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-23 20:49:12,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:49:12,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-23 20:49:12,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:12,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:12,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:12,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-23 20:49:12,357 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-23 20:49:12,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2019-11-23 20:49:12,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:49:12,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:49:12,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:49:12,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-11-23 20:49:12,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:49:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:49:12,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:49:12,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-11-23 20:49:12,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408834255] [2019-11-23 20:49:12,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-23 20:49:12,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:49:12,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-23 20:49:12,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2019-11-23 20:49:12,680 INFO L87 Difference]: Start difference. First operand 1618 states and 2179 transitions. Second operand 31 states. [2019-11-23 20:49:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:49:18,860 INFO L93 Difference]: Finished difference Result 4320 states and 5795 transitions. [2019-11-23 20:49:18,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-23 20:49:18,861 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 73 [2019-11-23 20:49:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:49:18,865 INFO L225 Difference]: With dead ends: 4320 [2019-11-23 20:49:18,865 INFO L226 Difference]: Without dead ends: 4318 [2019-11-23 20:49:18,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1630 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=625, Invalid=6017, Unknown=0, NotChecked=0, Total=6642 [2019-11-23 20:49:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4318 states. [2019-11-23 20:49:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4318 to 4111. [2019-11-23 20:49:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4111 states. [2019-11-23 20:49:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4111 states to 4111 states and 5569 transitions. [2019-11-23 20:49:19,868 INFO L78 Accepts]: Start accepts. Automaton has 4111 states and 5569 transitions. Word has length 73 [2019-11-23 20:49:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:49:19,868 INFO L462 AbstractCegarLoop]: Abstraction has 4111 states and 5569 transitions. [2019-11-23 20:49:19,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-23 20:49:19,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4111 states and 5569 transitions. [2019-11-23 20:49:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-23 20:49:19,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:49:19,871 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:49:20,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:49:20,074 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:49:20,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:49:20,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1266217744, now seen corresponding path program 1 times [2019-11-23 20:49:20,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:49:20,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046060970] [2019-11-23 20:49:20,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY