java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/mlceu.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:23:55,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:23:55,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:23:55,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:23:55,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:23:55,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:23:55,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:23:55,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:23:55,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:23:55,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:23:55,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:23:55,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:23:55,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:23:55,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:23:55,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:23:55,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:23:55,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:23:55,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:23:55,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:23:55,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:23:55,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:23:55,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:23:55,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:23:55,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:23:55,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:23:55,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:23:55,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:23:55,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:23:55,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:23:55,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:23:55,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:23:55,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:23:55,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:23:55,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:23:55,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:23:55,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:23:55,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:23:55,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:23:55,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:23:55,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:23:55,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:23:55,706 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 00:23:55,731 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:23:55,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:23:55,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:23:55,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:23:55,732 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:23:55,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:23:55,733 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:23:55,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:23:55,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:23:55,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:23:55,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:23:55,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:23:55,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:23:55,735 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:23:55,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:23:55,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:23:55,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:23:55,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:23:55,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:23:55,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:23:55,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:23:55,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:23:55,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:23:55,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:23:55,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:23:55,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:23:55,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:23:55,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:23:55,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:23:55,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:23:55,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:23:55,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:23:55,790 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:23:55,790 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:23:55,791 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mlceu.c [2019-10-02 00:23:55,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e63e806cc/bd5972624bbc48a88a8e4a5e9d0f25e3/FLAG117360c05 [2019-10-02 00:23:56,312 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:23:56,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mlceu.c [2019-10-02 00:23:56,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e63e806cc/bd5972624bbc48a88a8e4a5e9d0f25e3/FLAG117360c05 [2019-10-02 00:23:56,701 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e63e806cc/bd5972624bbc48a88a8e4a5e9d0f25e3 [2019-10-02 00:23:56,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:23:56,712 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:23:56,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:23:56,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:23:56,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:23:56,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:23:56" (1/1) ... [2019-10-02 00:23:56,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb44e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:56, skipping insertion in model container [2019-10-02 00:23:56,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:23:56" (1/1) ... [2019-10-02 00:23:56,731 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:23:56,749 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:23:56,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:23:56,968 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:23:56,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:23:57,015 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:23:57,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:57 WrapperNode [2019-10-02 00:23:57,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:23:57,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:23:57,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:23:57,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:23:57,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:57" (1/1) ... [2019-10-02 00:23:57,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:57" (1/1) ... [2019-10-02 00:23:57,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:57" (1/1) ... [2019-10-02 00:23:57,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:57" (1/1) ... [2019-10-02 00:23:57,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:57" (1/1) ... [2019-10-02 00:23:57,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:57" (1/1) ... [2019-10-02 00:23:57,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:57" (1/1) ... [2019-10-02 00:23:57,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:23:57,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:23:57,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:23:57,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:23:57,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:23:57,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:23:57,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:23:57,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 00:23:57,214 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:23:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:23:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 00:23:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 00:23:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:23:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 00:23:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:23:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 00:23:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 00:23:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 00:23:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:23:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:23:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 00:23:57,494 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:23:57,495 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 00:23:57,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:23:57 BoogieIcfgContainer [2019-10-02 00:23:57,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:23:57,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:23:57,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:23:57,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:23:57,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:23:56" (1/3) ... [2019-10-02 00:23:57,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d76a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:23:57, skipping insertion in model container [2019-10-02 00:23:57,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:23:57" (2/3) ... [2019-10-02 00:23:57,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d76a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:23:57, skipping insertion in model container [2019-10-02 00:23:57,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:23:57" (3/3) ... [2019-10-02 00:23:57,505 INFO L109 eAbstractionObserver]: Analyzing ICFG mlceu.c [2019-10-02 00:23:57,513 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:23:57,521 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:23:57,536 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:23:57,564 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:23:57,565 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:23:57,565 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:23:57,565 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:23:57,565 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:23:57,565 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:23:57,565 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:23:57,565 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:23:57,565 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:23:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-02 00:23:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 00:23:57,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:23:57,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:23:57,593 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:23:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:23:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 163391893, now seen corresponding path program 1 times [2019-10-02 00:23:57,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:23:57,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:23:57,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:23:57,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:23:57,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:23:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:23:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:23:57,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:23:57,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 00:23:57,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 00:23:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 00:23:57,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:23:57,762 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-10-02 00:23:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:23:57,781 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2019-10-02 00:23:57,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 00:23:57,782 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-02 00:23:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:23:57,789 INFO L225 Difference]: With dead ends: 42 [2019-10-02 00:23:57,789 INFO L226 Difference]: Without dead ends: 21 [2019-10-02 00:23:57,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 00:23:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-02 00:23:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-02 00:23:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-02 00:23:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-02 00:23:57,832 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-10-02 00:23:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:23:57,832 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-02 00:23:57,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 00:23:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-02 00:23:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 00:23:57,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:23:57,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:23:57,834 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:23:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:23:57,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1009214006, now seen corresponding path program 1 times [2019-10-02 00:23:57,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:23:57,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:23:57,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:23:57,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:23:57,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:23:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:23:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:23:57,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:23:57,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:23:57,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:23:57,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:23:57,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:23:57,926 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2019-10-02 00:23:57,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:23:57,983 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-10-02 00:23:57,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:23:57,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 00:23:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:23:57,986 INFO L225 Difference]: With dead ends: 38 [2019-10-02 00:23:57,986 INFO L226 Difference]: Without dead ends: 24 [2019-10-02 00:23:57,989 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:23:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-02 00:23:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-02 00:23:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-02 00:23:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-02 00:23:57,995 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2019-10-02 00:23:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:23:57,996 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-02 00:23:57,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:23:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-02 00:23:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 00:23:57,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:23:57,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:23:57,998 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:23:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:23:57,998 INFO L82 PathProgramCache]: Analyzing trace with hash 545846646, now seen corresponding path program 1 times [2019-10-02 00:23:57,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:23:57,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:23:58,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:23:58,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:23:58,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:23:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:23:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:23:58,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:23:58,082 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:23:58,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:23:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:23:58,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:23:58,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:23:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:23:58,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:23:58,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-02 00:23:58,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:23:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:23:58,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:23:58,229 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2019-10-02 00:23:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:23:58,305 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-10-02 00:23:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 00:23:58,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-02 00:23:58,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:23:58,307 INFO L225 Difference]: With dead ends: 41 [2019-10-02 00:23:58,307 INFO L226 Difference]: Without dead ends: 27 [2019-10-02 00:23:58,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:23:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-02 00:23:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-10-02 00:23:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-02 00:23:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-02 00:23:58,314 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2019-10-02 00:23:58,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:23:58,315 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-02 00:23:58,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:23:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-10-02 00:23:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 00:23:58,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:23:58,316 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:23:58,316 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:23:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:23:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1840475722, now seen corresponding path program 2 times [2019-10-02 00:23:58,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:23:58,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:23:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:23:58,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:23:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:23:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:23:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:23:58,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:23:58,565 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:23:58,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:23:58,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:23:58,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:23:58,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 00:23:58,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:23:58,667 INFO L375 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 15 treesize of output 11 [2019-10-02 00:23:58,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:23:58,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:23:58,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:23:58,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-10-02 00:23:58,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:23:58,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-02 00:23:58,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:23:58,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:23:58,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:23:58,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-10-02 00:23:58,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 00:23:58,868 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:23:58,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-10-02 00:23:58,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:23:58,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:23:58,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:23:58,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2019-10-02 00:23:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:23:58,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:23:58,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2019-10-02 00:23:58,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 00:23:58,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 00:23:58,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:23:58,918 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 14 states. [2019-10-02 00:24:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:24:00,246 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-10-02 00:24:00,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 00:24:00,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-10-02 00:24:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:24:00,250 INFO L225 Difference]: With dead ends: 48 [2019-10-02 00:24:00,250 INFO L226 Difference]: Without dead ends: 46 [2019-10-02 00:24:00,251 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:24:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-02 00:24:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2019-10-02 00:24:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 00:24:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-02 00:24:00,270 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-10-02 00:24:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:24:00,271 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-02 00:24:00,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 00:24:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-02 00:24:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 00:24:00,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:24:00,272 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:24:00,273 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:24:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:24:00,273 INFO L82 PathProgramCache]: Analyzing trace with hash -618905122, now seen corresponding path program 1 times [2019-10-02 00:24:00,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:24:00,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:24:00,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:00,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:24:00,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:24:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:24:00,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:24:00,445 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:24:00,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:24:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:24:00,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 00:24:00,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:24:00,517 INFO L375 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 15 treesize of output 11 [2019-10-02 00:24:00,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:24:00,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:24:00,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:24:00,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-10-02 00:24:02,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-10-02 00:24:02,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:24:02,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:24:02,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:24:02,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-10-02 00:24:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:24:02,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:24:02,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2019-10-02 00:24:02,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 00:24:02,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 00:24:02,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2019-10-02 00:24:02,678 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 14 states. [2019-10-02 00:24:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:24:09,022 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-10-02 00:24:09,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 00:24:09,023 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-10-02 00:24:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:24:09,024 INFO L225 Difference]: With dead ends: 46 [2019-10-02 00:24:09,024 INFO L226 Difference]: Without dead ends: 44 [2019-10-02 00:24:09,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=72, Invalid=306, Unknown=2, NotChecked=0, Total=380 [2019-10-02 00:24:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-02 00:24:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-10-02 00:24:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-02 00:24:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-10-02 00:24:09,035 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 28 [2019-10-02 00:24:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:24:09,035 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-10-02 00:24:09,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 00:24:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-10-02 00:24:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 00:24:09,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:24:09,037 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:24:09,038 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:24:09,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:24:09,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2140291442, now seen corresponding path program 2 times [2019-10-02 00:24:09,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:24:09,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:24:09,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:09,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:24:09,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:24:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:24:09,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:24:09,147 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:24:09,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:24:09,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:24:09,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:24:09,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 00:24:09,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:24:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:24:09,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:24:09,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-10-02 00:24:09,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 00:24:09,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 00:24:09,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-02 00:24:09,264 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 13 states. [2019-10-02 00:24:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:24:09,443 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2019-10-02 00:24:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 00:24:09,443 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-10-02 00:24:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:24:09,444 INFO L225 Difference]: With dead ends: 96 [2019-10-02 00:24:09,445 INFO L226 Difference]: Without dead ends: 50 [2019-10-02 00:24:09,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-10-02 00:24:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-02 00:24:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-10-02 00:24:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 00:24:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-02 00:24:09,455 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 36 [2019-10-02 00:24:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:24:09,455 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-02 00:24:09,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 00:24:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-02 00:24:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 00:24:09,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:24:09,457 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:24:09,457 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:24:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:24:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash -324382690, now seen corresponding path program 3 times [2019-10-02 00:24:09,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:24:09,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:24:09,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:09,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:24:09,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:24:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:24:09,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:24:09,696 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:24:09,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:24:09,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 00:24:09,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:24:09,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 00:24:09,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:24:09,764 INFO L375 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 15 treesize of output 11 [2019-10-02 00:24:09,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:24:09,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:24:09,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:24:09,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-10-02 00:24:17,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-10-02 00:24:17,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:24:17,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:24:17,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:24:17,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-10-02 00:24:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:24:17,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:24:17,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2019-10-02 00:24:17,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 00:24:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 00:24:17,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=225, Unknown=2, NotChecked=0, Total=272 [2019-10-02 00:24:17,978 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 17 states. [2019-10-02 00:24:26,079 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:24:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:24:26,423 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-10-02 00:24:26,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 00:24:26,424 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-10-02 00:24:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:24:26,425 INFO L225 Difference]: With dead ends: 57 [2019-10-02 00:24:26,425 INFO L226 Difference]: Without dead ends: 55 [2019-10-02 00:24:26,426 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=93, Invalid=504, Unknown=3, NotChecked=0, Total=600 [2019-10-02 00:24:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-02 00:24:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2019-10-02 00:24:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-02 00:24:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-10-02 00:24:26,440 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 39 [2019-10-02 00:24:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:24:26,440 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-10-02 00:24:26,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 00:24:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-10-02 00:24:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 00:24:26,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:24:26,453 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:24:26,454 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:24:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:24:26,455 INFO L82 PathProgramCache]: Analyzing trace with hash -229765198, now seen corresponding path program 4 times [2019-10-02 00:24:26,455 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:24:26,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:24:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:26,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:24:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:24:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:24:26,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:24:26,596 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:24:26,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:24:26,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:24:26,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:24:26,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 00:24:26,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:24:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:24:26,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:24:26,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-10-02 00:24:26,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 00:24:26,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 00:24:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-10-02 00:24:26,739 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 16 states. [2019-10-02 00:24:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:24:26,916 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-10-02 00:24:26,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:24:26,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2019-10-02 00:24:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:24:26,917 INFO L225 Difference]: With dead ends: 123 [2019-10-02 00:24:26,918 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 00:24:26,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:24:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 00:24:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-10-02 00:24:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-02 00:24:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-10-02 00:24:26,928 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2019-10-02 00:24:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:24:26,929 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-10-02 00:24:26,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 00:24:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-10-02 00:24:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 00:24:26,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:24:26,930 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:24:26,930 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:24:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:24:26,931 INFO L82 PathProgramCache]: Analyzing trace with hash -929276538, now seen corresponding path program 5 times [2019-10-02 00:24:26,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:24:26,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:24:26,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:26,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:24:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:24:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 00:24:27,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:24:27,159 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:24:27,177 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:24:27,209 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 00:24:27,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:24:27,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 00:24:27,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:24:27,319 INFO L375 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-10-02 00:24:27,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:24:27,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:24:27,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:24:27,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 00:24:27,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 00:24:27,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:24:27,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:24:27,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:24:27,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 00:24:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:24:27,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:24:27,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-10-02 00:24:27,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 00:24:27,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 00:24:27,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2019-10-02 00:24:27,713 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 27 states. [2019-10-02 00:24:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:24:28,354 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-10-02 00:24:28,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 00:24:28,355 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-10-02 00:24:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:24:28,357 INFO L225 Difference]: With dead ends: 68 [2019-10-02 00:24:28,357 INFO L226 Difference]: Without dead ends: 66 [2019-10-02 00:24:28,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 00:24:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-02 00:24:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-10-02 00:24:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-02 00:24:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-02 00:24:28,368 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 50 [2019-10-02 00:24:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:24:28,368 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-02 00:24:28,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 00:24:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-02 00:24:28,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 00:24:28,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:24:28,369 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:24:28,370 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:24:28,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:24:28,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1907373338, now seen corresponding path program 6 times [2019-10-02 00:24:28,370 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:24:28,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:24:28,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:28,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:24:28,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:24:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:24:28,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:24:28,494 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:24:28,515 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:24:28,557 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 00:24:28,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:24:28,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 00:24:28,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:24:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 40 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:24:28,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:24:28,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-10-02 00:24:28,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 00:24:28,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 00:24:28,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-10-02 00:24:28,678 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 19 states. [2019-10-02 00:24:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:24:28,921 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2019-10-02 00:24:28,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 00:24:28,921 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-10-02 00:24:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:24:28,923 INFO L225 Difference]: With dead ends: 150 [2019-10-02 00:24:28,923 INFO L226 Difference]: Without dead ends: 72 [2019-10-02 00:24:28,924 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-10-02 00:24:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-02 00:24:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2019-10-02 00:24:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-02 00:24:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2019-10-02 00:24:28,937 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 58 [2019-10-02 00:24:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:24:28,937 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2019-10-02 00:24:28,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 00:24:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2019-10-02 00:24:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 00:24:28,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:24:28,942 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:24:28,942 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:24:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:24:28,943 INFO L82 PathProgramCache]: Analyzing trace with hash 209500870, now seen corresponding path program 7 times [2019-10-02 00:24:28,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:24:28,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:24:28,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:28,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:24:28,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:24:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:24:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 8 proven. 67 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:24:29,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:24:29,318 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:24:29,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:24:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:24:29,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 00:24:29,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:24:29,430 INFO L375 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 15 treesize of output 11 [2019-10-02 00:24:29,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:24:29,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:24:29,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:24:29,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-10-02 00:25:01,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-10-02 00:25:01,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:01,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:01,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:01,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-10-02 00:25:01,820 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:25:01,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:01,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 23 [2019-10-02 00:25:01,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 00:25:01,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 00:25:01,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=437, Unknown=4, NotChecked=0, Total=506 [2019-10-02 00:25:01,826 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 23 states. [2019-10-02 00:25:09,949 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:25:12,333 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:25:14,439 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:25:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:14,934 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-10-02 00:25:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 00:25:14,934 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2019-10-02 00:25:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:14,936 INFO L225 Difference]: With dead ends: 79 [2019-10-02 00:25:14,937 INFO L226 Difference]: Without dead ends: 77 [2019-10-02 00:25:14,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=135, Invalid=1050, Unknown=5, NotChecked=0, Total=1190 [2019-10-02 00:25:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-02 00:25:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2019-10-02 00:25:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-02 00:25:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-10-02 00:25:14,948 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 61 [2019-10-02 00:25:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:14,949 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-10-02 00:25:14,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 00:25:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-10-02 00:25:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 00:25:14,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:14,950 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:14,950 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:14,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1023454630, now seen corresponding path program 8 times [2019-10-02 00:25:14,951 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:14,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:14,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:14,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:25:14,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 43 proven. 52 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:25:15,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:15,075 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:15,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:25:15,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:25:15,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:25:15,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 00:25:15,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:25:15,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:15,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2019-10-02 00:25:15,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 00:25:15,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 00:25:15,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:25:15,286 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 22 states. [2019-10-02 00:25:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:15,526 INFO L93 Difference]: Finished difference Result 177 states and 184 transitions. [2019-10-02 00:25:15,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 00:25:15,526 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2019-10-02 00:25:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:15,528 INFO L225 Difference]: With dead ends: 177 [2019-10-02 00:25:15,528 INFO L226 Difference]: Without dead ends: 83 [2019-10-02 00:25:15,530 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:25:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-02 00:25:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2019-10-02 00:25:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-02 00:25:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2019-10-02 00:25:15,539 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 69 [2019-10-02 00:25:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:15,540 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2019-10-02 00:25:15,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 00:25:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2019-10-02 00:25:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 00:25:15,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:15,541 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:15,541 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:15,542 INFO L82 PathProgramCache]: Analyzing trace with hash 653838638, now seen corresponding path program 9 times [2019-10-02 00:25:15,542 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:15,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:15,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:25:15,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 10 proven. 101 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 00:25:15,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:15,926 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:15,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:25:16,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 00:25:16,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:25:16,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 00:25:16,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:16,173 INFO L375 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 15 treesize of output 11 [2019-10-02 00:25:16,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:16,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:16,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:16,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 00:25:21,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:21,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-10-02 00:25:21,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:25:21,346 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 00:25:21,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:21,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 00:25:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 53 proven. 66 refuted. 8 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 00:25:21,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:21,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2019-10-02 00:25:21,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 00:25:21,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 00:25:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1240, Unknown=1, NotChecked=0, Total=1406 [2019-10-02 00:25:21,444 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 38 states. [2019-10-02 00:25:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:40,090 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2019-10-02 00:25:40,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 00:25:40,091 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-10-02 00:25:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:40,092 INFO L225 Difference]: With dead ends: 197 [2019-10-02 00:25:40,092 INFO L226 Difference]: Without dead ends: 95 [2019-10-02 00:25:40,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=534, Invalid=4157, Unknown=1, NotChecked=0, Total=4692 [2019-10-02 00:25:40,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-02 00:25:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-10-02 00:25:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-02 00:25:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-10-02 00:25:40,115 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 72 [2019-10-02 00:25:40,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:40,119 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-10-02 00:25:40,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 00:25:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-10-02 00:25:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 00:25:40,121 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:40,121 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:40,121 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1930966382, now seen corresponding path program 10 times [2019-10-02 00:25:40,122 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:40,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:40,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:40,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:25:40,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 12 proven. 142 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:25:40,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:40,444 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:40,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:25:40,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:25:40,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:25:40,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-02 00:25:40,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:40,701 INFO L375 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-10-02 00:25:40,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:40,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:40,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:40,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 00:25:41,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 00:25:41,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:41,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:41,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:41,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 00:25:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 00:25:41,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:41,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2019-10-02 00:25:41,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-02 00:25:41,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-02 00:25:41,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 00:25:41,436 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 39 states. [2019-10-02 00:25:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:42,537 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-10-02 00:25:42,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 00:25:42,537 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 83 [2019-10-02 00:25:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:42,539 INFO L225 Difference]: With dead ends: 101 [2019-10-02 00:25:42,539 INFO L226 Difference]: Without dead ends: 99 [2019-10-02 00:25:42,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 11 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=201, Invalid=2249, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 00:25:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-02 00:25:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2019-10-02 00:25:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-02 00:25:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2019-10-02 00:25:42,549 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 83 [2019-10-02 00:25:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:42,549 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2019-10-02 00:25:42,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-02 00:25:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2019-10-02 00:25:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 00:25:42,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:42,551 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:42,551 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:42,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:42,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1214883074, now seen corresponding path program 11 times [2019-10-02 00:25:42,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:42,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:42,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:25:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 87 proven. 95 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 00:25:42,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:42,723 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:42,751 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:25:42,803 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-10-02 00:25:42,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:25:42,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 00:25:42,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 112 proven. 70 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 00:25:42,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:42,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2019-10-02 00:25:42,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 00:25:42,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 00:25:42,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2019-10-02 00:25:42,968 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 28 states. [2019-10-02 00:25:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:25:43,389 INFO L93 Difference]: Finished difference Result 231 states and 238 transitions. [2019-10-02 00:25:43,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 00:25:43,390 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-10-02 00:25:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:25:43,392 INFO L225 Difference]: With dead ends: 231 [2019-10-02 00:25:43,392 INFO L226 Difference]: Without dead ends: 105 [2019-10-02 00:25:43,394 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=951, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 00:25:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-02 00:25:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2019-10-02 00:25:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-02 00:25:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-10-02 00:25:43,404 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 91 [2019-10-02 00:25:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:25:43,404 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-10-02 00:25:43,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 00:25:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-10-02 00:25:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 00:25:43,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:25:43,406 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:25:43,406 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:25:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:25:43,406 INFO L82 PathProgramCache]: Analyzing trace with hash -916880170, now seen corresponding path program 12 times [2019-10-02 00:25:43,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:25:43,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:25:43,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:43,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:25:43,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:25:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:25:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 14 proven. 190 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-02 00:25:43,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:25:43,747 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:25:43,778 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:25:43,836 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 00:25:43,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:25:43,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-02 00:25:43,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:25:43,992 INFO L375 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 15 treesize of output 11 [2019-10-02 00:25:43,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:25:43,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:43,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:43,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 00:25:52,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:25:52,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-10-02 00:25:52,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:25:52,838 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 00:25:52,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:25:52,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 00:25:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 91 proven. 113 refuted. 40 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 00:25:52,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:25:52,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 47 [2019-10-02 00:25:52,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-02 00:25:52,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-02 00:25:52,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1917, Unknown=3, NotChecked=0, Total=2162 [2019-10-02 00:25:52,968 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 47 states. [2019-10-02 00:26:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:26:04,821 INFO L93 Difference]: Finished difference Result 251 states and 260 transitions. [2019-10-02 00:26:04,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-02 00:26:04,822 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 94 [2019-10-02 00:26:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:26:04,823 INFO L225 Difference]: With dead ends: 251 [2019-10-02 00:26:04,824 INFO L226 Difference]: Without dead ends: 117 [2019-10-02 00:26:04,827 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1794 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=760, Invalid=6546, Unknown=4, NotChecked=0, Total=7310 [2019-10-02 00:26:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-02 00:26:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2019-10-02 00:26:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-02 00:26:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2019-10-02 00:26:04,837 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 94 [2019-10-02 00:26:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:26:04,837 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2019-10-02 00:26:04,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-02 00:26:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2019-10-02 00:26:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 00:26:04,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:26:04,839 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:26:04,839 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:26:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:26:04,839 INFO L82 PathProgramCache]: Analyzing trace with hash 697614358, now seen corresponding path program 13 times [2019-10-02 00:26:04,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:26:04,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:26:04,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:04,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:26:04,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:26:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 16 proven. 245 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 00:26:05,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:26:05,202 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:26:05,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:26:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:26:05,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-02 00:26:05,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:26:05,297 INFO L375 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 15 treesize of output 11 [2019-10-02 00:26:05,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:26:05,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:26:05,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:26:05,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-10-02 00:28:14,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-10-02 00:28:14,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:14,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:14,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:14,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-10-02 00:28:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 261 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 00:28:14,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:28:14,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 35 [2019-10-02 00:28:14,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 00:28:14,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 00:28:14,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1077, Unknown=8, NotChecked=0, Total=1190 [2019-10-02 00:28:14,246 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 35 states. [2019-10-02 00:28:22,431 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:28:24,568 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:28:26,873 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:28:28,978 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-10-02 00:28:31,431 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:28:33,883 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:28:36,259 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:28:37,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:28:37,259 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2019-10-02 00:28:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 00:28:37,259 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 105 [2019-10-02 00:28:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:28:37,260 INFO L225 Difference]: With dead ends: 123 [2019-10-02 00:28:37,260 INFO L226 Difference]: Without dead ends: 121 [2019-10-02 00:28:37,262 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 78 SyntacticMatches, 18 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 145.5s TimeCoverageRelationStatistics Valid=219, Invalid=2742, Unknown=9, NotChecked=0, Total=2970 [2019-10-02 00:28:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-02 00:28:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-10-02 00:28:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-02 00:28:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2019-10-02 00:28:37,273 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 105 [2019-10-02 00:28:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:28:37,274 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2019-10-02 00:28:37,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 00:28:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2019-10-02 00:28:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 00:28:37,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:28:37,275 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:28:37,276 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:28:37,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:28:37,276 INFO L82 PathProgramCache]: Analyzing trace with hash -207288406, now seen corresponding path program 14 times [2019-10-02 00:28:37,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:28:37,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:28:37,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:37,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:28:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:28:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 147 proven. 150 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 00:28:37,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:28:37,564 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:28:37,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:28:37,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:28:37,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:28:37,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 00:28:37,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:28:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 180 proven. 117 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 00:28:37,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:28:37,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2019-10-02 00:28:37,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 00:28:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 00:28:37,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 00:28:37,900 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 34 states. [2019-10-02 00:28:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:28:38,473 INFO L93 Difference]: Finished difference Result 285 states and 292 transitions. [2019-10-02 00:28:38,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 00:28:38,474 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 113 [2019-10-02 00:28:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:28:38,476 INFO L225 Difference]: With dead ends: 285 [2019-10-02 00:28:38,476 INFO L226 Difference]: Without dead ends: 127 [2019-10-02 00:28:38,477 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=454, Invalid=1438, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 00:28:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-02 00:28:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2019-10-02 00:28:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-02 00:28:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-10-02 00:28:38,489 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 113 [2019-10-02 00:28:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:28:38,489 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-10-02 00:28:38,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 00:28:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-10-02 00:28:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 00:28:38,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:28:38,491 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:28:38,491 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:28:38,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:28:38,492 INFO L82 PathProgramCache]: Analyzing trace with hash 753307774, now seen corresponding path program 15 times [2019-10-02 00:28:38,492 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:28:38,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:28:38,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:38,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:28:38,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:28:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:28:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 18 proven. 307 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 00:28:38,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:28:38,936 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:28:38,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:28:39,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-02 00:28:39,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:28:39,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-02 00:28:39,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:28:39,409 INFO L375 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 15 treesize of output 11 [2019-10-02 00:28:39,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:28:39,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:28:39,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:28:39,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 00:28:44,285 WARN L191 SmtUtils]: Spent 925.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-10-02 00:28:45,730 WARN L191 SmtUtils]: Spent 825.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-10-02 00:29:01,496 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:01,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-10-02 00:29:01,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:29:01,514 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 00:29:01,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:01,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 00:29:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 205 proven. 172 refuted. 20 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 00:29:01,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:01,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31] total 55 [2019-10-02 00:29:01,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-02 00:29:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-02 00:29:01,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2646, Unknown=2, NotChecked=0, Total=2970 [2019-10-02 00:29:01,638 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 55 states. [2019-10-02 00:29:21,172 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-10-02 00:29:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:35,358 INFO L93 Difference]: Finished difference Result 305 states and 314 transitions. [2019-10-02 00:29:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 00:29:35,358 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 116 [2019-10-02 00:29:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:35,359 INFO L225 Difference]: With dead ends: 305 [2019-10-02 00:29:35,359 INFO L226 Difference]: Without dead ends: 139 [2019-10-02 00:29:35,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 81 SyntacticMatches, 14 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=1024, Invalid=9478, Unknown=4, NotChecked=0, Total=10506 [2019-10-02 00:29:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-02 00:29:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2019-10-02 00:29:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-02 00:29:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2019-10-02 00:29:35,376 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 116 [2019-10-02 00:29:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:35,376 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2019-10-02 00:29:35,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-02 00:29:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2019-10-02 00:29:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 00:29:35,377 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:35,378 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:35,378 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:35,378 INFO L82 PathProgramCache]: Analyzing trace with hash -821404994, now seen corresponding path program 16 times [2019-10-02 00:29:35,378 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:35,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:35,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:35,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:29:35,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 20 proven. 376 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 00:29:35,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:35,978 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:29:36,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:29:36,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:29:36,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:29:36,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-02 00:29:36,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:36,420 INFO L375 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-10-02 00:29:36,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:36,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:36,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:36,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 00:29:37,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 00:29:37,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:37,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:37,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:37,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 00:29:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 00:29:37,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:37,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 55 [2019-10-02 00:29:37,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-02 00:29:37,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-02 00:29:37,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2776, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 00:29:37,905 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 55 states. [2019-10-02 00:29:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:40,144 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2019-10-02 00:29:40,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 00:29:40,145 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 127 [2019-10-02 00:29:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:40,147 INFO L225 Difference]: With dead ends: 145 [2019-10-02 00:29:40,147 INFO L226 Difference]: Without dead ends: 143 [2019-10-02 00:29:40,150 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 83 SyntacticMatches, 19 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=281, Invalid=4549, Unknown=0, NotChecked=0, Total=4830 [2019-10-02 00:29:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-02 00:29:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2019-10-02 00:29:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-02 00:29:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2019-10-02 00:29:40,176 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 127 [2019-10-02 00:29:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:40,176 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2019-10-02 00:29:40,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-02 00:29:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2019-10-02 00:29:40,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 00:29:40,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:40,181 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:40,181 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:40,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:40,182 INFO L82 PathProgramCache]: Analyzing trace with hash -875988398, now seen corresponding path program 17 times [2019-10-02 00:29:40,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:40,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:40,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:40,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:29:40,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 223 proven. 217 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-02 00:29:40,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:40,581 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:29:40,643 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:29:40,764 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-02 00:29:40,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:29:40,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 00:29:40,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 264 proven. 176 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Stream Closed [2019-10-02 00:29:41,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:29:41,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2019-10-02 00:29:41,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 00:29:41,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 00:29:41,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1191, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 00:29:41,066 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 40 states. [2019-10-02 00:29:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:29:41,696 INFO L93 Difference]: Finished difference Result 339 states and 346 transitions. [2019-10-02 00:29:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 00:29:41,697 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 135 [2019-10-02 00:29:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:29:41,699 INFO L225 Difference]: With dead ends: 339 [2019-10-02 00:29:41,699 INFO L226 Difference]: Without dead ends: 149 [2019-10-02 00:29:41,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=627, Invalid=2025, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 00:29:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-02 00:29:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2019-10-02 00:29:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-02 00:29:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-10-02 00:29:41,714 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 135 [2019-10-02 00:29:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:29:41,715 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-10-02 00:29:41,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 00:29:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-10-02 00:29:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 00:29:41,716 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:29:41,716 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:29:41,716 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:29:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:29:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash -121115610, now seen corresponding path program 18 times [2019-10-02 00:29:41,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:29:41,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:29:41,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:41,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:29:41,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:29:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:29:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 22 proven. 452 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-02 00:29:42,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:29:42,343 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:29:42,399 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:29:42,664 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-02 00:29:42,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:29:42,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-02 00:29:42,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:29:43,014 INFO L375 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 15 treesize of output 11 [2019-10-02 00:29:43,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:29:43,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:43,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:43,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 00:29:59,867 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:29:59,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-10-02 00:29:59,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:29:59,884 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 00:29:59,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:29:59,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 00:30:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 283 proven. 243 refuted. 104 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 00:30:00,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:30:00,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 38] total 66 [2019-10-02 00:30:00,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-02 00:30:00,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-02 00:30:00,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=3812, Unknown=8, NotChecked=0, Total=4290 [2019-10-02 00:30:00,047 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 66 states. [2019-10-02 00:30:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:30:19,174 INFO L93 Difference]: Finished difference Result 359 states and 368 transitions. [2019-10-02 00:30:19,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-02 00:30:19,177 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 138 [2019-10-02 00:30:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:30:19,178 INFO L225 Difference]: With dead ends: 359 [2019-10-02 00:30:19,179 INFO L226 Difference]: Without dead ends: 161 [2019-10-02 00:30:19,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 88 SyntacticMatches, 16 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3538 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=1369, Invalid=13142, Unknown=9, NotChecked=0, Total=14520 [2019-10-02 00:30:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-02 00:30:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2019-10-02 00:30:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-02 00:30:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2019-10-02 00:30:19,195 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 155 transitions. Word has length 138 [2019-10-02 00:30:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:30:19,196 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 155 transitions. [2019-10-02 00:30:19,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-02 00:30:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 155 transitions. [2019-10-02 00:30:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 00:30:19,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:30:19,198 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:30:19,198 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:30:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:30:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 412157286, now seen corresponding path program 19 times [2019-10-02 00:30:19,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:30:19,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:30:19,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:30:19,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:30:19,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:30:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:30:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 24 proven. 535 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-02 00:30:19,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:30:19,870 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:30:19,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:30:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:30:19,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-02 00:30:19,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:30:19,983 INFO L375 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 15 treesize of output 11 [2019-10-02 00:30:19,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:30:19,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:30:19,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:30:19,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-10-02 00:35:09,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-10-02 00:35:09,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:35:09,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:35:09,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:35:09,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-10-02 00:35:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-02 00:35:09,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:35:09,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 47 [2019-10-02 00:35:09,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-02 00:35:09,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-02 00:35:09,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2005, Unknown=12, NotChecked=0, Total=2162 [2019-10-02 00:35:09,789 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. Second operand 47 states. [2019-10-02 00:35:18,077 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:35:19,764 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:35:22,020 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:35:24,181 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2019-10-02 00:35:26,687 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:35:28,949 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:35:31,449 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:35:33,966 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:35:36,534 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:35:39,059 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:35:41,336 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-02 00:35:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:35:43,042 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2019-10-02 00:35:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-02 00:35:43,042 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 149 [2019-10-02 00:35:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:35:43,044 INFO L225 Difference]: With dead ends: 167 [2019-10-02 00:35:43,044 INFO L226 Difference]: Without dead ends: 165 [2019-10-02 00:35:43,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 110 SyntacticMatches, 26 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 314.1s TimeCoverageRelationStatistics Valid=303, Invalid=5234, Unknown=13, NotChecked=0, Total=5550 [2019-10-02 00:35:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-02 00:35:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-10-02 00:35:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-02 00:35:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-10-02 00:35:43,060 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 149 [2019-10-02 00:35:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:35:43,061 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-10-02 00:35:43,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-02 00:35:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-10-02 00:35:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 00:35:43,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:35:43,062 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:35:43,062 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:35:43,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:35:43,063 INFO L82 PathProgramCache]: Analyzing trace with hash -303104774, now seen corresponding path program 20 times [2019-10-02 00:35:43,063 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:35:43,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:35:43,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:35:43,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:35:43,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:35:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:35:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 315 proven. 296 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-02 00:35:43,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:35:43,459 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:35:43,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 00:35:43,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 00:35:43,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:35:43,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-02 00:35:43,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:35:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 364 proven. 247 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-02 00:35:44,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:35:44,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2019-10-02 00:35:44,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 00:35:44,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 00:35:44,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1585, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 00:35:44,010 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 46 states. [2019-10-02 00:35:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:35:44,883 INFO L93 Difference]: Finished difference Result 393 states and 400 transitions. [2019-10-02 00:35:44,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 00:35:44,884 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 157 [2019-10-02 00:35:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:35:44,886 INFO L225 Difference]: With dead ends: 393 [2019-10-02 00:35:44,886 INFO L226 Difference]: Without dead ends: 171 [2019-10-02 00:35:44,888 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=828, Invalid=2712, Unknown=0, NotChecked=0, Total=3540 [2019-10-02 00:35:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-02 00:35:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2019-10-02 00:35:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-02 00:35:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-10-02 00:35:44,905 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 157 [2019-10-02 00:35:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:35:44,905 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-10-02 00:35:44,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 00:35:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-10-02 00:35:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 00:35:44,907 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:35:44,907 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:35:44,907 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:35:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:35:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2116392910, now seen corresponding path program 21 times [2019-10-02 00:35:44,908 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:35:44,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:35:44,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:35:44,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:35:44,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:35:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:35:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 26 proven. 625 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-02 00:35:45,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:35:45,647 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:35:45,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 00:35:45,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-02 00:35:45,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:35:45,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-02 00:35:45,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:35:46,450 INFO L375 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 15 treesize of output 11 [2019-10-02 00:35:46,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:35:46,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:35:46,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:35:46,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 00:35:57,748 WARN L191 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 36 [2019-10-02 00:35:57,968 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2019-10-02 00:36:06,648 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:36:06,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-10-02 00:36:06,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:36:06,668 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 00:36:06,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:36:06,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 00:36:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 361 proven. 326 refuted. 84 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-02 00:36:06,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:36:06,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 40] total 72 [2019-10-02 00:36:06,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-02 00:36:06,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-02 00:36:06,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=4573, Unknown=3, NotChecked=0, Total=5112 [2019-10-02 00:36:06,858 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 72 states. [2019-10-02 00:36:24,450 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-10-02 00:36:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:36:32,449 INFO L93 Difference]: Finished difference Result 413 states and 422 transitions. [2019-10-02 00:36:32,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-02 00:36:32,449 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 160 [2019-10-02 00:36:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:36:32,450 INFO L225 Difference]: With dead ends: 413 [2019-10-02 00:36:32,450 INFO L226 Difference]: Without dead ends: 183 [2019-10-02 00:36:32,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 105 SyntacticMatches, 22 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4520 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=1634, Invalid=16721, Unknown=5, NotChecked=0, Total=18360 [2019-10-02 00:36:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-02 00:36:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 175. [2019-10-02 00:36:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-02 00:36:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-10-02 00:36:32,472 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 160 [2019-10-02 00:36:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:36:32,472 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-10-02 00:36:32,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-02 00:36:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-10-02 00:36:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 00:36:32,473 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:36:32,474 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:36:32,474 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:36:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:36:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1363197966, now seen corresponding path program 22 times [2019-10-02 00:36:32,474 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:36:32,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:36:32,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:36:32,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:36:32,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:36:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:36:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 28 proven. 722 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-10-02 00:36:33,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:36:33,340 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:36:33,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 00:36:33,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 00:36:33,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:36:33,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 73 conjunts are in the unsatisfiable core [2019-10-02 00:36:33,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:36:34,071 INFO L375 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-10-02 00:36:34,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:36:34,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:36:34,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:36:34,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 00:36:36,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-02 00:36:36,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:36:36,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:36:36,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:36:36,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 00:36:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 0 proven. 750 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-10-02 00:36:36,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:36:36,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 71 [2019-10-02 00:36:36,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-02 00:36:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-02 00:36:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4716, Unknown=0, NotChecked=0, Total=4970 [2019-10-02 00:36:36,610 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 71 states. [2019-10-02 00:36:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:36:40,180 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2019-10-02 00:36:40,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 00:36:40,180 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 171 [2019-10-02 00:36:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:36:40,182 INFO L225 Difference]: With dead ends: 189 [2019-10-02 00:36:40,182 INFO L226 Difference]: Without dead ends: 187 [2019-10-02 00:36:40,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 111 SyntacticMatches, 27 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2385 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=361, Invalid=7649, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 00:36:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-02 00:36:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2019-10-02 00:36:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-02 00:36:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 185 transitions. [2019-10-02 00:36:40,203 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 185 transitions. Word has length 171 [2019-10-02 00:36:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:36:40,203 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 185 transitions. [2019-10-02 00:36:40,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-02 00:36:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 185 transitions. [2019-10-02 00:36:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 00:36:40,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:36:40,205 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:36:40,205 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:36:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:36:40,205 INFO L82 PathProgramCache]: Analyzing trace with hash 221089698, now seen corresponding path program 23 times [2019-10-02 00:36:40,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:36:40,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:36:40,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:36:40,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:36:40,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:36:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:36:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 423 proven. 387 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-02 00:36:40,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:36:40,894 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:36:40,974 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 00:36:41,149 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-10-02 00:36:41,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:36:41,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 00:36:41,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:36:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 480 proven. 330 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-02 00:36:41,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:36:41,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2019-10-02 00:36:41,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 00:36:41,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 00:36:41,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=2035, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 00:36:41,658 INFO L87 Difference]: Start difference. First operand 183 states and 185 transitions. Second operand 52 states. [2019-10-02 00:36:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:36:42,632 INFO L93 Difference]: Finished difference Result 447 states and 454 transitions. [2019-10-02 00:36:42,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-02 00:36:42,632 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 179 [2019-10-02 00:36:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:36:42,634 INFO L225 Difference]: With dead ends: 447 [2019-10-02 00:36:42,634 INFO L226 Difference]: Without dead ends: 193 [2019-10-02 00:36:42,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1057, Invalid=3499, Unknown=0, NotChecked=0, Total=4556 [2019-10-02 00:36:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-02 00:36:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 186. [2019-10-02 00:36:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-02 00:36:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2019-10-02 00:36:42,656 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 179 [2019-10-02 00:36:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:36:42,657 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2019-10-02 00:36:42,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 00:36:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2019-10-02 00:36:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 00:36:42,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:36:42,658 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:36:42,659 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:36:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:36:42,659 INFO L82 PathProgramCache]: Analyzing trace with hash 942117750, now seen corresponding path program 24 times [2019-10-02 00:36:42,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:36:42,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:36:42,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:36:42,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:36:42,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:36:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:36:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 30 proven. 826 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-02 00:36:43,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:36:43,674 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:36:43,749 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 00:36:44,158 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-02 00:36:44,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 00:36:44,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-02 00:36:44,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:36:45,292 INFO L375 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 15 treesize of output 11 [2019-10-02 00:36:45,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:36:45,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:36:45,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:36:45,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-10-02 00:36:59,335 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:36:59,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-10-02 00:36:59,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 00:36:59,352 INFO L567 ElimStorePlain]: treesize reduction 13, result has 50.0 percent of original size [2019-10-02 00:36:59,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 00:36:59,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2019-10-02 00:36:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 483 proven. 421 refuted. 104 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-02 00:36:59,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:36:59,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 44] total 80 [2019-10-02 00:36:59,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-02 00:36:59,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-02 00:36:59,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=653, Invalid=5663, Unknown=4, NotChecked=0, Total=6320 [2019-10-02 00:36:59,595 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 80 states. [2019-10-02 00:37:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:37:11,088 INFO L93 Difference]: Finished difference Result 467 states and 476 transitions. [2019-10-02 00:37:11,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-02 00:37:11,089 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 182 [2019-10-02 00:37:11,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:37:11,091 INFO L225 Difference]: With dead ends: 467 [2019-10-02 00:37:11,091 INFO L226 Difference]: Without dead ends: 205 [2019-10-02 00:37:11,093 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 116 SyntacticMatches, 26 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5496 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=1953, Invalid=20693, Unknown=4, NotChecked=0, Total=22650 [2019-10-02 00:37:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-02 00:37:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 197. [2019-10-02 00:37:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-02 00:37:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 199 transitions. [2019-10-02 00:37:11,113 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 199 transitions. Word has length 182 [2019-10-02 00:37:11,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:37:11,113 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 199 transitions. [2019-10-02 00:37:11,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-02 00:37:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 199 transitions. [2019-10-02 00:37:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 00:37:11,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:37:11,115 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:37:11,115 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:37:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:37:11,115 INFO L82 PathProgramCache]: Analyzing trace with hash -634287434, now seen corresponding path program 25 times [2019-10-02 00:37:11,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:37:11,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:37:11,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:37:11,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 00:37:11,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:37:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:37:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 32 proven. 937 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-10-02 00:37:12,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:37:12,118 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:37:12,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:37:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:37:12,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 77 conjunts are in the unsatisfiable core [2019-10-02 00:37:12,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:37:12,302 INFO L375 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 15 treesize of output 11 [2019-10-02 00:37:12,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 00:37:12,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 00:37:12,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 00:37:12,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18