java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:25:31,622 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:25:31,624 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:25:31,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:25:31,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:25:31,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:25:31,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:25:31,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:25:31,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:25:31,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:25:31,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:25:31,652 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:25:31,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:25:31,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:25:31,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:25:31,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:25:31,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:25:31,659 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:25:31,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:25:31,665 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:25:31,666 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:25:31,668 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:25:31,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:25:31,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:25:31,674 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:25:31,676 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:25:31,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:25:31,678 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:25:31,679 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:25:31,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:25:31,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:25:31,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:25:31,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:25:31,686 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:25:31,687 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:25:31,689 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:25:31,690 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:25:31,716 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:25:31,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:25:31,717 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:25:31,718 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:25:31,718 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:25:31,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:25:31,719 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:25:31,719 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:25:31,719 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:25:31,719 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:25:31,720 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:25:31,720 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:25:31,720 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:25:31,720 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:25:31,720 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:25:31,721 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:25:31,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:25:31,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:25:31,721 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:25:31,721 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:25:31,722 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:25:31,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:25:31,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:25:31,722 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:25:31,722 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:25:31,723 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:25:31,723 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:25:31,723 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:25:31,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:25:31,723 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:25:31,724 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:25:31,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:25:31,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:25:31,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:25:31,802 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:25:31,803 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:25:31,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-10-01 00:25:31,804 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl' [2018-10-01 00:25:31,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:25:31,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:25:31,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:25:31,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:25:31,870 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:25:31,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (1/1) ... [2018-10-01 00:25:31,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (1/1) ... [2018-10-01 00:25:31,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:25:31,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:25:31,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:25:31,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:25:31,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (1/1) ... [2018-10-01 00:25:31,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (1/1) ... [2018-10-01 00:25:31,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (1/1) ... [2018-10-01 00:25:31,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (1/1) ... [2018-10-01 00:25:31,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (1/1) ... [2018-10-01 00:25:31,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (1/1) ... [2018-10-01 00:25:31,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (1/1) ... [2018-10-01 00:25:31,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:25:31,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:25:31,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:25:31,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:25:31,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (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 [2018-10-01 00:25:32,012 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 00:25:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:25:32,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:25:32,183 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:25:32,184 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:25:32 BoogieIcfgContainer [2018-10-01 00:25:32,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:25:32,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:25:32,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:25:32,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:25:32,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:25:31" (1/2) ... [2018-10-01 00:25:32,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360e74ef and model type count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:25:32, skipping insertion in model container [2018-10-01 00:25:32,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:25:32" (2/2) ... [2018-10-01 00:25:32,193 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-10-01 00:25:32,203 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:25:32,212 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:25:32,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:25:32,265 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:25:32,265 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:25:32,265 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:25:32,265 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:25:32,266 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:25:32,266 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:25:32,266 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:25:32,266 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:25:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-01 00:25:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 00:25:32,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:32,290 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-01 00:25:32,291 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:32,298 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-10-01 00:25:32,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:32,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:32,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:32,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:32,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:32,480 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:25:32,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:25:32,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:25:32,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:25:32,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:32,501 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-01 00:25:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:32,629 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-10-01 00:25:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:25:32,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-01 00:25:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:32,657 INFO L225 Difference]: With dead ends: 9 [2018-10-01 00:25:32,657 INFO L226 Difference]: Without dead ends: 5 [2018-10-01 00:25:32,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:25:32,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-01 00:25:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-01 00:25:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-01 00:25:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-01 00:25:32,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-01 00:25:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:32,713 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-01 00:25:32,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:25:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-01 00:25:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:25:32,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:32,714 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:25:32,715 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:32,715 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:32,715 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-10-01 00:25:32,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:32,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:32,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:32,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:32,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:32,831 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:32,831 INFO L227 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 [2018-10-01 00:25:32,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:32,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:32,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:32,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-10-01 00:25:32,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:25:32,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:25:32,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:32,966 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-10-01 00:25:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:33,308 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-10-01 00:25:33,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:25:33,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-01 00:25:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:33,310 INFO L225 Difference]: With dead ends: 9 [2018-10-01 00:25:33,310 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:25:33,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:25:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:25:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 00:25:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:25:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-01 00:25:33,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-01 00:25:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:33,314 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-01 00:25:33,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:25:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-01 00:25:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:25:33,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:33,315 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-01 00:25:33,315 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:33,315 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 2 times [2018-10-01 00:25:33,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:33,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:33,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:33,534 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:33,534 INFO L227 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:33,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:25:33,555 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:25:33,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:33,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:33,811 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:33,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-10-01 00:25:33,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:25:33,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:25:33,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:33,813 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-10-01 00:25:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:34,093 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-01 00:25:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:25:34,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-01 00:25:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:34,096 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:25:34,096 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 00:25:34,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:25:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 00:25:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 00:25:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:25:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 00:25:34,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-01 00:25:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:34,106 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-01 00:25:34,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:25:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 00:25:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:25:34,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:34,107 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-01 00:25:34,108 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:34,108 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:34,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 3 times [2018-10-01 00:25:34,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:34,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:34,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:34,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:34,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:34,329 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:34,329 INFO L227 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:34,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:25:34,382 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:25:34,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:34,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:34,511 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:34,512 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-01 00:25:34,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:25:34,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:25:34,513 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:34,513 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-10-01 00:25:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:35,227 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-10-01 00:25:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:25:35,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-10-01 00:25:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:35,230 INFO L225 Difference]: With dead ends: 13 [2018-10-01 00:25:35,230 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:25:35,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:25:35,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:25:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:25:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:25:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 00:25:35,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-01 00:25:35,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:35,235 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-01 00:25:35,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:25:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 00:25:35,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:25:35,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:35,236 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-01 00:25:35,237 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:35,237 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:35,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 4 times [2018-10-01 00:25:35,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:35,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:35,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:35,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:35,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:35,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:35,402 INFO L227 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 [2018-10-01 00:25:35,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:25:35,420 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:25:35,420 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:35,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:35,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:35,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-10-01 00:25:35,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:25:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:25:35,534 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:35,534 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-10-01 00:25:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:35,920 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-10-01 00:25:35,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:25:35,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-10-01 00:25:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:35,922 INFO L225 Difference]: With dead ends: 15 [2018-10-01 00:25:35,922 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:25:35,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:25:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:25:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-01 00:25:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-01 00:25:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-01 00:25:35,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-01 00:25:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:35,929 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-01 00:25:35,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:25:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-01 00:25:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:25:35,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:35,930 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-10-01 00:25:35,930 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:35,930 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:35,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 5 times [2018-10-01 00:25:35,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:35,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:35,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:35,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:37,126 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:37,127 INFO L227 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:25:37,135 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:25:37,146 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:25:37,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:37,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:37,592 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:37,592 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-10-01 00:25:37,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:25:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:25:37,593 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:37,593 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-10-01 00:25:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:38,138 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-10-01 00:25:38,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:25:38,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-01 00:25:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:38,140 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:25:38,141 INFO L226 Difference]: Without dead ends: 15 [2018-10-01 00:25:38,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:25:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-01 00:25:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-01 00:25:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-01 00:25:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-01 00:25:38,147 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-01 00:25:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:38,147 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-01 00:25:38,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:25:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-01 00:25:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:25:38,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:38,148 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-10-01 00:25:38,148 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:38,149 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 6 times [2018-10-01 00:25:38,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:38,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:38,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:38,426 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:38,426 INFO L227 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 [2018-10-01 00:25:38,436 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:25:38,449 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:25:38,450 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:38,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:38,575 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:38,576 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-10-01 00:25:38,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:25:38,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:25:38,576 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:38,577 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-10-01 00:25:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:39,246 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-10-01 00:25:39,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:25:39,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-01 00:25:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:39,249 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:25:39,249 INFO L226 Difference]: Without dead ends: 17 [2018-10-01 00:25:39,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:25:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-01 00:25:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-01 00:25:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-01 00:25:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-01 00:25:39,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-01 00:25:39,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:39,257 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-01 00:25:39,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:25:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-01 00:25:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:25:39,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:39,258 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-10-01 00:25:39,258 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:39,258 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:39,258 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 7 times [2018-10-01 00:25:39,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:39,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:39,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:39,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:39,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:39,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:39,625 INFO L227 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 [2018-10-01 00:25:39,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:39,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:39,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:39,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-10-01 00:25:39,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:25:39,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:25:39,778 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:39,778 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-10-01 00:25:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:40,673 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-10-01 00:25:40,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:25:40,674 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:25:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:40,675 INFO L225 Difference]: With dead ends: 21 [2018-10-01 00:25:40,676 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:25:40,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:25:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:25:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-01 00:25:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:25:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-01 00:25:40,682 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-01 00:25:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:40,683 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-01 00:25:40,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:25:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-01 00:25:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:25:40,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:40,684 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-10-01 00:25:40,684 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:40,685 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 8 times [2018-10-01 00:25:40,685 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:40,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:40,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:40,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:40,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:41,371 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:41,371 INFO L227 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 [2018-10-01 00:25:41,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:25:41,403 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:25:41,403 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:41,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:41,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:41,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-10-01 00:25:41,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:25:41,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:25:41,529 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:41,529 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-10-01 00:25:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:42,533 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-10-01 00:25:42,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:25:42,533 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-01 00:25:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:42,534 INFO L225 Difference]: With dead ends: 23 [2018-10-01 00:25:42,534 INFO L226 Difference]: Without dead ends: 21 [2018-10-01 00:25:42,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:25:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-01 00:25:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-01 00:25:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:25:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-01 00:25:42,541 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-01 00:25:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:42,541 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-01 00:25:42,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:25:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-01 00:25:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:25:42,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:42,542 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-10-01 00:25:42,542 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:42,542 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:42,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 9 times [2018-10-01 00:25:42,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:42,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:42,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:42,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:42,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:43,136 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:43,136 INFO L227 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 [2018-10-01 00:25:43,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:25:43,160 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-01 00:25:43,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:43,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:43,424 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:43,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-10-01 00:25:43,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:25:43,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:25:43,425 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:43,425 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-10-01 00:25:44,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:44,358 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-10-01 00:25:44,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:25:44,364 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-10-01 00:25:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:44,364 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:25:44,365 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 00:25:44,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:25:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 00:25:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-01 00:25:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 00:25:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-01 00:25:44,371 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-01 00:25:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:44,371 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-01 00:25:44,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:25:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-01 00:25:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:25:44,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:44,372 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-10-01 00:25:44,372 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:44,373 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:44,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 10 times [2018-10-01 00:25:44,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:44,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:44,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:44,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:44,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:44,771 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:44,771 INFO L227 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 [2018-10-01 00:25:44,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:25:44,814 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:25:44,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:44,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:44,995 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:44,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-10-01 00:25:44,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:25:44,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:25:44,996 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:44,996 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-10-01 00:25:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:45,701 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-10-01 00:25:45,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:25:45,702 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-10-01 00:25:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:45,703 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:25:45,703 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 00:25:45,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:25:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 00:25:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-01 00:25:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:25:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-01 00:25:45,710 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-01 00:25:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:45,710 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-01 00:25:45,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:25:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-01 00:25:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:25:45,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:45,712 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-10-01 00:25:45,712 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:45,712 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:45,712 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 11 times [2018-10-01 00:25:45,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:45,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:45,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:46,170 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:46,171 INFO L227 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 [2018-10-01 00:25:46,178 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:25:46,207 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-01 00:25:46,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:46,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:46,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:46,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-10-01 00:25:46,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-01 00:25:46,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-01 00:25:46,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:46,362 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-10-01 00:25:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:47,535 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-10-01 00:25:47,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:25:47,536 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-10-01 00:25:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:47,537 INFO L225 Difference]: With dead ends: 29 [2018-10-01 00:25:47,537 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:25:47,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:25:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:25:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-01 00:25:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:25:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-01 00:25:47,544 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-01 00:25:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:47,544 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-01 00:25:47,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-01 00:25:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-01 00:25:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:25:47,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:47,545 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-10-01 00:25:47,545 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:47,546 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 12 times [2018-10-01 00:25:47,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:47,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:47,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:48,123 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:48,123 INFO L227 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 [2018-10-01 00:25:48,133 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:25:48,285 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:25:48,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:48,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:48,515 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:48,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-10-01 00:25:48,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-01 00:25:48,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-01 00:25:48,516 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:48,516 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-10-01 00:25:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:49,988 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-10-01 00:25:49,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:25:49,989 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-10-01 00:25:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:49,990 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:25:49,990 INFO L226 Difference]: Without dead ends: 29 [2018-10-01 00:25:49,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:25:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-01 00:25:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-01 00:25:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:25:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-01 00:25:49,998 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-01 00:25:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:49,998 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-01 00:25:49,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-01 00:25:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-01 00:25:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:25:49,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:49,999 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-10-01 00:25:49,999 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:49,999 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 13 times [2018-10-01 00:25:50,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:50,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:50,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:50,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:50,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:50,603 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:50,603 INFO L227 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 [2018-10-01 00:25:50,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:50,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:50,796 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:50,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-10-01 00:25:50,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-01 00:25:50,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-01 00:25:50,796 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:50,797 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-10-01 00:25:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:52,019 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-10-01 00:25:52,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:25:52,020 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-10-01 00:25:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:52,021 INFO L225 Difference]: With dead ends: 33 [2018-10-01 00:25:52,021 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:25:52,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:25:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:25:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-01 00:25:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:25:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-01 00:25:52,030 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-01 00:25:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:52,030 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-01 00:25:52,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-01 00:25:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-01 00:25:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:25:52,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:52,032 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-10-01 00:25:52,032 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:52,032 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:52,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 14 times [2018-10-01 00:25:52,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:52,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:52,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:52,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:25:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:52,948 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:52,948 INFO L227 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 [2018-10-01 00:25:52,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:25:53,002 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:25:53,003 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:53,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:53,184 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:53,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-10-01 00:25:53,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-01 00:25:53,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-01 00:25:53,185 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:53,185 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-10-01 00:25:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:55,032 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-10-01 00:25:55,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:25:55,032 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-10-01 00:25:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:55,033 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:25:55,034 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:25:55,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:25:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:25:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-01 00:25:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:25:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-01 00:25:55,043 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-01 00:25:55,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:55,043 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-01 00:25:55,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-01 00:25:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-01 00:25:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:25:55,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:55,044 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-10-01 00:25:55,045 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:55,045 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 15 times [2018-10-01 00:25:55,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:55,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:55,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:55,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:55,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:55,825 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:55,825 INFO L227 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 [2018-10-01 00:25:55,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:25:55,857 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-01 00:25:55,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:55,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:56,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:56,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-10-01 00:25:56,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-01 00:25:56,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-01 00:25:56,009 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:56,009 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-10-01 00:25:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:25:58,181 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-10-01 00:25:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:25:58,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-10-01 00:25:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:25:58,183 INFO L225 Difference]: With dead ends: 37 [2018-10-01 00:25:58,183 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:25:58,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:25:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:25:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:25:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:25:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-01 00:25:58,193 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-01 00:25:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:25:58,194 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-01 00:25:58,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-01 00:25:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-01 00:25:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:25:58,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:25:58,195 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-10-01 00:25:58,195 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:25:58,196 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:25:58,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 16 times [2018-10-01 00:25:58,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:25:58,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:25:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:58,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:25:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:25:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:25:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:58,980 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:25:58,980 INFO L227 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 [2018-10-01 00:25:58,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:25:59,051 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:25:59,051 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:25:59,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:25:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:25:59,254 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:25:59,254 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-10-01 00:25:59,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 00:25:59,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 00:25:59,255 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:25:59,255 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-10-01 00:26:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:01,480 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-10-01 00:26:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:26:01,481 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-10-01 00:26:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:01,481 INFO L225 Difference]: With dead ends: 39 [2018-10-01 00:26:01,481 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:26:01,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:26:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:26:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-01 00:26:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:26:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-01 00:26:01,489 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-01 00:26:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:01,490 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-01 00:26:01,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 00:26:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-01 00:26:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:26:01,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:01,491 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-10-01 00:26:01,491 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:01,491 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:01,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 17 times [2018-10-01 00:26:01,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:01,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:01,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:02,385 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:02,385 INFO L227 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 [2018-10-01 00:26:02,392 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:26:02,453 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-01 00:26:02,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:02,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:02,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:02,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-10-01 00:26:02,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-01 00:26:02,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-01 00:26:02,644 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:02,644 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-10-01 00:26:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:05,037 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-10-01 00:26:05,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:26:05,038 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-10-01 00:26:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:05,039 INFO L225 Difference]: With dead ends: 41 [2018-10-01 00:26:05,039 INFO L226 Difference]: Without dead ends: 39 [2018-10-01 00:26:05,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 00:26:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-01 00:26:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-01 00:26:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-01 00:26:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-01 00:26:05,049 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-01 00:26:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:05,049 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-01 00:26:05,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-01 00:26:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-01 00:26:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 00:26:05,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:05,050 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-10-01 00:26:05,051 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:05,051 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:05,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 18 times [2018-10-01 00:26:05,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:05,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:05,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:05,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:05,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:06,595 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:06,596 INFO L227 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 [2018-10-01 00:26:06,603 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:26:06,628 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 00:26:06,628 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:06,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:06,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:06,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-10-01 00:26:06,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-01 00:26:06,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-01 00:26:06,851 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:06,852 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-10-01 00:26:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:09,490 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-10-01 00:26:09,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:26:09,491 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-10-01 00:26:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:09,492 INFO L225 Difference]: With dead ends: 43 [2018-10-01 00:26:09,492 INFO L226 Difference]: Without dead ends: 41 [2018-10-01 00:26:09,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time [2018-10-01 00:26:09,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-01 00:26:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-01 00:26:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:26:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-01 00:26:09,506 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-01 00:26:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:09,506 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-01 00:26:09,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-01 00:26:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-01 00:26:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 00:26:09,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:09,508 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-10-01 00:26:09,508 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:09,508 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 19 times [2018-10-01 00:26:09,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:09,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:09,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:09,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:09,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:10,709 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:10,709 INFO L227 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 [2018-10-01 00:26:10,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:10,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:11,048 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:11,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-10-01 00:26:11,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-01 00:26:11,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-01 00:26:11,049 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:11,050 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-10-01 00:26:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:13,275 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-10-01 00:26:13,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:26:13,276 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-10-01 00:26:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:13,277 INFO L225 Difference]: With dead ends: 45 [2018-10-01 00:26:13,277 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:26:13,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time [2018-10-01 00:26:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:26:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-01 00:26:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-01 00:26:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-01 00:26:13,289 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-01 00:26:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:13,289 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-01 00:26:13,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-01 00:26:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-01 00:26:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 00:26:13,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:13,290 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-10-01 00:26:13,290 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:13,290 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:13,290 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 20 times [2018-10-01 00:26:13,291 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:13,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:13,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:13,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:13,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:14,456 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:14,456 INFO L227 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 [2018-10-01 00:26:14,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:26:14,561 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:26:14,562 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:14,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:14,901 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:14,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-10-01 00:26:14,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-01 00:26:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-01 00:26:14,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:14,902 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-10-01 00:26:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:17,312 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-10-01 00:26:17,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:26:17,313 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-10-01 00:26:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:17,313 INFO L225 Difference]: With dead ends: 47 [2018-10-01 00:26:17,314 INFO L226 Difference]: Without dead ends: 45 [2018-10-01 00:26:17,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time [2018-10-01 00:26:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-01 00:26:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-01 00:26:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-01 00:26:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-01 00:26:17,326 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-01 00:26:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:17,327 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-01 00:26:17,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-01 00:26:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-01 00:26:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 00:26:17,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:17,328 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-10-01 00:26:17,328 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:17,328 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:17,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 21 times [2018-10-01 00:26:17,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:17,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:17,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:17,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:17,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:18,823 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:18,823 INFO L227 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 [2018-10-01 00:26:18,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:26:18,863 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-01 00:26:18,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:18,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:19,032 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:19,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-10-01 00:26:19,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-01 00:26:19,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-01 00:26:19,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:19,033 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-10-01 00:26:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:23,391 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-10-01 00:26:23,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 00:26:23,394 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-10-01 00:26:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:23,395 INFO L225 Difference]: With dead ends: 49 [2018-10-01 00:26:23,395 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 00:26:23,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s Time [2018-10-01 00:26:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 00:26:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-01 00:26:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 00:26:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-01 00:26:23,406 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-01 00:26:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:23,406 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-01 00:26:23,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-01 00:26:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-01 00:26:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 00:26:23,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:23,407 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-10-01 00:26:23,408 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:23,408 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:23,408 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 22 times [2018-10-01 00:26:23,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:23,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:23,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:23,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:23,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:24,844 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:24,844 INFO L227 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 [2018-10-01 00:26:24,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:26:24,989 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:26:24,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:25,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:25,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:25,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-10-01 00:26:25,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-01 00:26:25,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-01 00:26:25,390 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:25,391 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-10-01 00:26:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:30,389 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-10-01 00:26:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:26:30,389 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-10-01 00:26:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:30,390 INFO L225 Difference]: With dead ends: 51 [2018-10-01 00:26:30,390 INFO L226 Difference]: Without dead ends: 49 [2018-10-01 00:26:30,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s Time [2018-10-01 00:26:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-01 00:26:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-01 00:26:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-01 00:26:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-01 00:26:30,399 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-01 00:26:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:30,399 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-01 00:26:30,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-01 00:26:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-01 00:26:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 00:26:30,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:30,400 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-10-01 00:26:30,400 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:30,400 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 23 times [2018-10-01 00:26:30,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:30,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:30,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:30,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:32,363 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:32,363 INFO L227 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 [2018-10-01 00:26:32,370 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:26:32,494 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-01 00:26:32,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:32,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:33,167 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:33,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2018-10-01 00:26:33,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-01 00:26:33,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-01 00:26:33,168 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:33,168 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-10-01 00:26:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:36,486 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-10-01 00:26:36,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:26:36,486 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-10-01 00:26:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:36,487 INFO L225 Difference]: With dead ends: 53 [2018-10-01 00:26:36,487 INFO L226 Difference]: Without dead ends: 51 [2018-10-01 00:26:36,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s Time [2018-10-01 00:26:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-01 00:26:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-01 00:26:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-01 00:26:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-01 00:26:36,500 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-01 00:26:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:36,501 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-01 00:26:36,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-01 00:26:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-01 00:26:36,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 00:26:36,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:36,502 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-10-01 00:26:36,502 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:36,502 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 24 times [2018-10-01 00:26:36,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:36,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:36,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:38,290 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:38,290 INFO L227 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 [2018-10-01 00:26:38,297 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:26:38,337 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 00:26:38,337 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:38,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:38,542 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:38,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2018-10-01 00:26:38,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-01 00:26:38,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-01 00:26:38,543 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:38,543 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-10-01 00:26:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:41,406 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-01 00:26:41,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 00:26:41,407 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-10-01 00:26:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:41,407 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:26:41,408 INFO L226 Difference]: Without dead ends: 53 [2018-10-01 00:26:41,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time [2018-10-01 00:26:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-01 00:26:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-01 00:26:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 00:26:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-01 00:26:41,421 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-01 00:26:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:41,421 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-01 00:26:41,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-01 00:26:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-01 00:26:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:26:41,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:41,422 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-10-01 00:26:41,422 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:41,422 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:41,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 25 times [2018-10-01 00:26:41,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:41,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:41,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:41,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:41,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:43,106 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:43,106 INFO L227 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 [2018-10-01 00:26:43,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:43,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:43,606 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:43,606 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2018-10-01 00:26:43,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-01 00:26:43,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-01 00:26:43,606 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:43,606 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-10-01 00:26:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:48,226 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-10-01 00:26:48,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:26:48,227 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-10-01 00:26:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:48,228 INFO L225 Difference]: With dead ends: 57 [2018-10-01 00:26:48,228 INFO L226 Difference]: Without dead ends: 55 [2018-10-01 00:26:48,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s Time [2018-10-01 00:26:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-01 00:26:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-01 00:26:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-01 00:26:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-01 00:26:48,240 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-01 00:26:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:48,240 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-01 00:26:48,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-01 00:26:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-01 00:26:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-01 00:26:48,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:48,241 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-10-01 00:26:48,242 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:48,242 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:48,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 26 times [2018-10-01 00:26:48,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:48,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:48,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:48,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:26:48,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:50,303 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:50,303 INFO L227 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 [2018-10-01 00:26:50,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:26:50,524 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:26:50,524 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:50,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:50,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:50,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2018-10-01 00:26:50,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-01 00:26:50,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-01 00:26:50,970 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:50,970 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-10-01 00:26:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:26:56,509 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-10-01 00:26:56,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:26:56,509 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-10-01 00:26:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:26:56,510 INFO L225 Difference]: With dead ends: 59 [2018-10-01 00:26:56,510 INFO L226 Difference]: Without dead ends: 57 [2018-10-01 00:26:56,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s Time [2018-10-01 00:26:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-01 00:26:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-01 00:26:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-01 00:26:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-01 00:26:56,523 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-01 00:26:56,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:26:56,523 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-01 00:26:56,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-01 00:26:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-01 00:26:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-01 00:26:56,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:26:56,523 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-10-01 00:26:56,524 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:26:56,524 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:26:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 27 times [2018-10-01 00:26:56,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:26:56,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:26:56,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:56,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:26:56,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:26:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:26:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:58,483 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:26:58,483 INFO L227 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 [2018-10-01 00:26:58,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:26:58,544 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-01 00:26:58,544 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:26:58,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:26:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:26:58,812 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:26:58,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2018-10-01 00:26:58,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-01 00:26:58,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-01 00:26:58,813 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:26:58,813 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-10-01 00:27:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:03,214 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-10-01 00:27:03,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-01 00:27:03,215 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-10-01 00:27:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:03,215 INFO L225 Difference]: With dead ends: 61 [2018-10-01 00:27:03,216 INFO L226 Difference]: Without dead ends: 59 [2018-10-01 00:27:03,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s Time [2018-10-01 00:27:03,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-01 00:27:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-01 00:27:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 00:27:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-01 00:27:03,228 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-01 00:27:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:03,228 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-01 00:27:03,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-01 00:27:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-01 00:27:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 00:27:03,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:03,229 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-10-01 00:27:03,229 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:03,229 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 28 times [2018-10-01 00:27:03,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:03,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:03,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:05,341 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:05,341 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:05,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:27:05,595 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:27:05,595 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:05,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:06,047 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:06,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2018-10-01 00:27:06,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-01 00:27:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-01 00:27:06,048 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:06,048 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-10-01 00:27:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:11,724 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-10-01 00:27:11,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-01 00:27:11,725 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-10-01 00:27:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:11,725 INFO L225 Difference]: With dead ends: 63 [2018-10-01 00:27:11,725 INFO L226 Difference]: Without dead ends: 61 [2018-10-01 00:27:11,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s Time [2018-10-01 00:27:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-01 00:27:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-01 00:27:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-01 00:27:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-01 00:27:11,739 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-01 00:27:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:11,739 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-01 00:27:11,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-01 00:27:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-01 00:27:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-01 00:27:11,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:11,740 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-10-01 00:27:11,740 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:11,740 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 29 times [2018-10-01 00:27:11,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:11,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:11,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:11,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:13,996 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:13,996 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:14,004 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:27:14,230 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-01 00:27:14,230 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:14,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:14,512 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:14,512 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2018-10-01 00:27:14,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-01 00:27:14,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-01 00:27:14,513 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:14,513 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-10-01 00:27:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:19,603 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-10-01 00:27:19,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-01 00:27:19,604 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-10-01 00:27:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:19,605 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:27:19,605 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 00:27:19,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s Time [2018-10-01 00:27:19,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 00:27:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-01 00:27:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:27:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-01 00:27:19,619 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-01 00:27:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:19,619 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-01 00:27:19,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-01 00:27:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-01 00:27:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 00:27:19,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:19,620 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-10-01 00:27:19,620 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:19,620 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:19,620 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 30 times [2018-10-01 00:27:19,620 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:19,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:19,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:19,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:19,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:22,345 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:22,346 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:22,364 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:27:22,410 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-01 00:27:22,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:22,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:22,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:22,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2018-10-01 00:27:22,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-01 00:27:22,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-01 00:27:22,702 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:22,702 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-10-01 00:27:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:28,816 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-10-01 00:27:28,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-01 00:27:28,817 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-10-01 00:27:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:28,818 INFO L225 Difference]: With dead ends: 67 [2018-10-01 00:27:28,818 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:27:28,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s Time [2018-10-01 00:27:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:27:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-01 00:27:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-01 00:27:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-01 00:27:28,831 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-10-01 00:27:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:28,831 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-01 00:27:28,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-01 00:27:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-01 00:27:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-01 00:27:28,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:28,832 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-10-01 00:27:28,832 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:28,832 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:28,833 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 31 times [2018-10-01 00:27:28,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:28,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:28,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:28,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:31,967 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:31,968 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:31,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:32,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:32,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:32,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2018-10-01 00:27:32,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-01 00:27:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-01 00:27:32,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:32,791 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-10-01 00:27:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:43,725 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-10-01 00:27:43,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-01 00:27:43,725 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-10-01 00:27:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:43,726 INFO L225 Difference]: With dead ends: 69 [2018-10-01 00:27:43,726 INFO L226 Difference]: Without dead ends: 67 [2018-10-01 00:27:43,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s Time [2018-10-01 00:27:43,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-01 00:27:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-01 00:27:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 00:27:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-01 00:27:43,741 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-10-01 00:27:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:43,741 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-01 00:27:43,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-01 00:27:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-01 00:27:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:27:43,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:43,742 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-10-01 00:27:43,742 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:43,743 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 32 times [2018-10-01 00:27:43,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:43,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:43,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:43,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:27:43,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:46,552 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:46,552 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:46,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:27:46,921 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:27:46,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:47,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:47,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:47,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2018-10-01 00:27:47,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-01 00:27:47,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-01 00:27:47,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:47,642 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-10-01 00:27:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:27:54,812 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-10-01 00:27:54,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 00:27:54,812 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-10-01 00:27:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:27:54,813 INFO L225 Difference]: With dead ends: 71 [2018-10-01 00:27:54,813 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 00:27:54,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s Time [2018-10-01 00:27:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 00:27:54,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-01 00:27:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-01 00:27:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-01 00:27:54,828 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-10-01 00:27:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:27:54,829 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-01 00:27:54,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-01 00:27:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-01 00:27:54,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 00:27:54,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:27:54,830 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-10-01 00:27:54,830 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:27:54,830 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:27:54,830 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 33 times [2018-10-01 00:27:54,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:27:54,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:27:54,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:54,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:27:54,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:27:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:27:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:57,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:27:57,972 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:27:57,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:27:58,025 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-01 00:27:58,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:27:58,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:27:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:27:58,297 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:27:58,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2018-10-01 00:27:58,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-01 00:27:58,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-01 00:27:58,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:27:58,298 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-10-01 00:28:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:09,900 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-10-01 00:28:09,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-01 00:28:09,901 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-10-01 00:28:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:09,902 INFO L225 Difference]: With dead ends: 73 [2018-10-01 00:28:09,902 INFO L226 Difference]: Without dead ends: 71 [2018-10-01 00:28:09,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s Time [2018-10-01 00:28:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-01 00:28:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-01 00:28:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-01 00:28:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-01 00:28:09,917 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-10-01 00:28:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:09,917 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-01 00:28:09,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-01 00:28:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-01 00:28:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-01 00:28:09,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:09,918 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-10-01 00:28:09,918 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:09,918 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 34 times [2018-10-01 00:28:09,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:09,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:09,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:09,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:09,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:13,218 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:13,218 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:13,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:28:13,675 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:28:13,675 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:13,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:14,231 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:14,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 70 [2018-10-01 00:28:14,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-01 00:28:14,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-01 00:28:14,232 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:14,232 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-10-01 00:28:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:21,322 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-10-01 00:28:21,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:28:21,322 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-10-01 00:28:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:21,323 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:28:21,323 INFO L226 Difference]: Without dead ends: 73 [2018-10-01 00:28:21,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s Time [2018-10-01 00:28:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-01 00:28:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-01 00:28:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 00:28:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-01 00:28:21,340 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-10-01 00:28:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:21,340 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-01 00:28:21,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-01 00:28:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-01 00:28:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-01 00:28:21,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:21,341 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-10-01 00:28:21,341 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:21,342 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:21,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 35 times [2018-10-01 00:28:21,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:21,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:21,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:25,175 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:25,175 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:25,185 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:28:25,563 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-01 00:28:25,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:25,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:25,884 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:25,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 72 [2018-10-01 00:28:25,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-01 00:28:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-01 00:28:25,884 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:25,884 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-10-01 00:28:35,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:35,704 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-10-01 00:28:35,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-01 00:28:35,704 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-10-01 00:28:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:35,705 INFO L225 Difference]: With dead ends: 77 [2018-10-01 00:28:35,705 INFO L226 Difference]: Without dead ends: 75 [2018-10-01 00:28:35,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s Time [2018-10-01 00:28:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-01 00:28:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-01 00:28:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 00:28:35,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-01 00:28:35,726 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-10-01 00:28:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:35,726 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-01 00:28:35,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-01 00:28:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-01 00:28:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-01 00:28:35,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:35,727 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-10-01 00:28:35,727 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:35,728 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:35,728 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 36 times [2018-10-01 00:28:35,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:35,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:35,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:35,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:35,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:40,221 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:40,221 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:40,228 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:28:40,278 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-01 00:28:40,278 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:28:40,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:40,638 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:40,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 74 [2018-10-01 00:28:40,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-01 00:28:40,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-01 00:28:40,639 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:40,639 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-10-01 00:28:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:28:51,700 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-10-01 00:28:51,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-01 00:28:51,701 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-10-01 00:28:51,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:28:51,702 INFO L225 Difference]: With dead ends: 79 [2018-10-01 00:28:51,702 INFO L226 Difference]: Without dead ends: 77 [2018-10-01 00:28:51,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s Time [2018-10-01 00:28:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-01 00:28:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-01 00:28:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-01 00:28:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-01 00:28:51,722 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-10-01 00:28:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:28:51,722 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-01 00:28:51,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-01 00:28:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-01 00:28:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-01 00:28:51,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:28:51,723 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-10-01 00:28:51,723 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:28:51,723 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:28:51,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 37 times [2018-10-01 00:28:51,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:28:51,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:28:51,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:51,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:28:51,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:28:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:55,614 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:28:55,614 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:28:55,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:28:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:28:56,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:28:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:28:56,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:28:56,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 76 [2018-10-01 00:28:56,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-01 00:28:56,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-01 00:28:56,820 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:28:56,820 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-10-01 00:29:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:10,644 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-10-01 00:29:10,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-01 00:29:10,645 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-10-01 00:29:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:10,646 INFO L225 Difference]: With dead ends: 81 [2018-10-01 00:29:10,646 INFO L226 Difference]: Without dead ends: 79 [2018-10-01 00:29:10,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s Time [2018-10-01 00:29:10,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-01 00:29:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-01 00:29:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-01 00:29:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-01 00:29:10,663 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-10-01 00:29:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:10,664 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-01 00:29:10,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-01 00:29:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-01 00:29:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-01 00:29:10,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:10,664 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-10-01 00:29:10,664 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:10,664 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 38 times [2018-10-01 00:29:10,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:10,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:10,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:10,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:29:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:14,833 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:14,833 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:14,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:29:15,455 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:29:15,455 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:15,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:16,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:16,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 78 [2018-10-01 00:29:16,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-01 00:29:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-01 00:29:16,234 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:16,234 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-10-01 00:29:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:35,531 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-10-01 00:29:35,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:29:35,532 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-10-01 00:29:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:35,533 INFO L225 Difference]: With dead ends: 83 [2018-10-01 00:29:35,533 INFO L226 Difference]: Without dead ends: 81 [2018-10-01 00:29:35,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.0s Time [2018-10-01 00:29:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-01 00:29:35,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-01 00:29:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-01 00:29:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-01 00:29:35,552 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-10-01 00:29:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:35,553 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-01 00:29:35,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-01 00:29:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-01 00:29:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-01 00:29:35,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:35,554 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-10-01 00:29:35,554 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:35,554 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:35,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 39 times [2018-10-01 00:29:35,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:35,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:35,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:35,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:35,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:40,153 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:40,153 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:40,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:29:40,217 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-01 00:29:40,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:29:40,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:29:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:40,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:29:40,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 80 [2018-10-01 00:29:40,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-01 00:29:40,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-01 00:29:40,564 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:29:40,564 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-10-01 00:29:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:29:55,319 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-10-01 00:29:55,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 00:29:55,320 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-10-01 00:29:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:29:55,321 INFO L225 Difference]: With dead ends: 85 [2018-10-01 00:29:55,321 INFO L226 Difference]: Without dead ends: 83 [2018-10-01 00:29:55,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s Time [2018-10-01 00:29:55,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-01 00:29:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-01 00:29:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-01 00:29:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-01 00:29:55,341 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-10-01 00:29:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:29:55,342 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-01 00:29:55,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-01 00:29:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-01 00:29:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-01 00:29:55,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:29:55,342 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-10-01 00:29:55,343 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:29:55,343 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:29:55,343 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 40 times [2018-10-01 00:29:55,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:29:55,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:29:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:55,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:29:55,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:29:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:29:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:29:59,908 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:29:59,908 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:29:59,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:30:00,609 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:30:00,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:01,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:01,364 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:01,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 82 [2018-10-01 00:30:01,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-01 00:30:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-01 00:30:01,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:01,365 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-10-01 00:30:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:13,211 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-10-01 00:30:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-01 00:30:13,211 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-10-01 00:30:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:13,212 INFO L225 Difference]: With dead ends: 87 [2018-10-01 00:30:13,212 INFO L226 Difference]: Without dead ends: 85 [2018-10-01 00:30:13,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s Time [2018-10-01 00:30:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-01 00:30:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-01 00:30:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-01 00:30:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-01 00:30:13,231 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-10-01 00:30:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:13,231 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-01 00:30:13,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-01 00:30:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-01 00:30:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-01 00:30:13,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:13,232 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-10-01 00:30:13,232 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:13,232 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:13,232 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 41 times [2018-10-01 00:30:13,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:13,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:13,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:13,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:13,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:17,958 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:17,958 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:17,967 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:30:18,565 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-01 00:30:18,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:18,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:18,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:18,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 84 [2018-10-01 00:30:18,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-01 00:30:18,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-01 00:30:18,995 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:18,995 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-10-01 00:30:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:28,859 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-10-01 00:30:28,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:30:28,859 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-10-01 00:30:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:28,861 INFO L225 Difference]: With dead ends: 89 [2018-10-01 00:30:28,861 INFO L226 Difference]: Without dead ends: 87 [2018-10-01 00:30:28,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s Time [2018-10-01 00:30:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-01 00:30:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-01 00:30:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-01 00:30:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-01 00:30:28,889 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-10-01 00:30:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:28,890 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-01 00:30:28,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-01 00:30:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-01 00:30:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-01 00:30:28,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:28,891 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-10-01 00:30:28,891 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:28,891 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 42 times [2018-10-01 00:30:28,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:28,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:28,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:28,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:28,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:30:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:34,831 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:30:34,831 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-01 00:30:34,847 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:30:34,991 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-01 00:30:34,992 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:30:34,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:30:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:30:35,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:30:35,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 86 [2018-10-01 00:30:35,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-01 00:30:35,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-01 00:30:35,474 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:30:35,475 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-10-01 00:30:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:30:54,933 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-10-01 00:30:54,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-01 00:30:54,933 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-10-01 00:30:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:30:54,934 INFO L225 Difference]: With dead ends: 91 [2018-10-01 00:30:54,934 INFO L226 Difference]: Without dead ends: 89 [2018-10-01 00:30:54,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.6s Time [2018-10-01 00:30:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-01 00:30:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-01 00:30:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-01 00:30:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-01 00:30:54,961 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-10-01 00:30:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:30:54,961 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-01 00:30:54,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-01 00:30:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-01 00:30:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-01 00:30:54,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:30:54,962 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-10-01 00:30:54,962 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:30:54,962 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:30:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 43 times [2018-10-01 00:30:54,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:30:54,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:30:54,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:54,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:30:54,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:30:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:00,168 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:00,168 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:00,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:01,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:02,023 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:02,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 88 [2018-10-01 00:31:02,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-01 00:31:02,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-01 00:31:02,024 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:02,024 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-10-01 00:31:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:14,859 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-10-01 00:31:14,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-01 00:31:14,860 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-10-01 00:31:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:14,861 INFO L225 Difference]: With dead ends: 93 [2018-10-01 00:31:14,861 INFO L226 Difference]: Without dead ends: 91 [2018-10-01 00:31:14,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s Time [2018-10-01 00:31:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-01 00:31:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-01 00:31:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-01 00:31:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-01 00:31:14,892 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-10-01 00:31:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:14,892 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-01 00:31:14,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-01 00:31:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-01 00:31:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-01 00:31:14,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:14,892 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-10-01 00:31:14,892 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:14,893 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:14,893 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 44 times [2018-10-01 00:31:14,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:14,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:14,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:14,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:31:14,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:20,282 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:20,282 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:20,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:31:21,185 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:31:21,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:21,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:22,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:22,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 90 [2018-10-01 00:31:22,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-01 00:31:22,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-01 00:31:22,357 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:22,357 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-10-01 00:31:39,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:31:39,004 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-10-01 00:31:39,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-01 00:31:39,005 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-10-01 00:31:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:31:39,005 INFO L225 Difference]: With dead ends: 95 [2018-10-01 00:31:39,006 INFO L226 Difference]: Without dead ends: 93 [2018-10-01 00:31:39,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.4s Time [2018-10-01 00:31:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-01 00:31:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-10-01 00:31:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-01 00:31:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-01 00:31:39,027 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-10-01 00:31:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:31:39,027 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-01 00:31:39,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-01 00:31:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-01 00:31:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-01 00:31:39,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:31:39,028 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-10-01 00:31:39,028 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:31:39,028 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:31:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 45 times [2018-10-01 00:31:39,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:31:39,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:31:39,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:39,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:31:39,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:31:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:31:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:44,839 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:31:44,839 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:31:44,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:31:44,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-01 00:31:44,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:31:44,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:31:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:31:45,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:31:45,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 92 [2018-10-01 00:31:45,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-01 00:31:45,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-01 00:31:45,280 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:31:45,280 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-10-01 00:32:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:06,061 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-10-01 00:32:06,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-01 00:32:06,062 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-10-01 00:32:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:06,063 INFO L225 Difference]: With dead ends: 97 [2018-10-01 00:32:06,063 INFO L226 Difference]: Without dead ends: 95 [2018-10-01 00:32:06,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.6s Time [2018-10-01 00:32:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-01 00:32:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-01 00:32:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-01 00:32:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-01 00:32:06,089 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-10-01 00:32:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:06,089 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-01 00:32:06,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-01 00:32:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-01 00:32:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-01 00:32:06,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:06,090 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-10-01 00:32:06,090 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:06,090 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 46 times [2018-10-01 00:32:06,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:06,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:06,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:06,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:06,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:13,134 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:13,134 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:13,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:32:14,174 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:32:14,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:14,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:15,259 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:15,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 94 [2018-10-01 00:32:15,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-01 00:32:15,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-01 00:32:15,260 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:15,260 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-10-01 00:32:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:32:27,140 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-10-01 00:32:27,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-01 00:32:27,141 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-10-01 00:32:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:32:27,142 INFO L225 Difference]: With dead ends: 99 [2018-10-01 00:32:27,142 INFO L226 Difference]: Without dead ends: 97 [2018-10-01 00:32:27,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s Time [2018-10-01 00:32:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-01 00:32:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-10-01 00:32:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-01 00:32:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-01 00:32:27,167 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-10-01 00:32:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:32:27,167 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-01 00:32:27,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-01 00:32:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-01 00:32:27,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-01 00:32:27,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:32:27,168 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-10-01 00:32:27,168 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:32:27,168 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:32:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 47 times [2018-10-01 00:32:27,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:32:27,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:32:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:27,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:32:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:32:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:32:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:33,458 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:32:33,458 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:32:33,466 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:32:34,358 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-01 00:32:34,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:32:34,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:32:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:32:35,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:32:35,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 96 [2018-10-01 00:32:35,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-01 00:32:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-01 00:32:35,127 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:32:35,127 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-10-01 00:33:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:08,274 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-10-01 00:33:08,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-01 00:33:08,274 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-10-01 00:33:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:08,276 INFO L225 Difference]: With dead ends: 101 [2018-10-01 00:33:08,276 INFO L226 Difference]: Without dead ends: 99 [2018-10-01 00:33:08,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.6s Time [2018-10-01 00:33:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-01 00:33:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-01 00:33:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-01 00:33:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-01 00:33:08,304 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-10-01 00:33:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:08,304 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-01 00:33:08,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-01 00:33:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-01 00:33:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-01 00:33:08,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:08,305 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-10-01 00:33:08,306 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:08,306 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 48 times [2018-10-01 00:33:08,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:08,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:08,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:33:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:33:15,603 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:15,603 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:15,611 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:33:15,683 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-01 00:33:15,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:33:15,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:33:16,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:16,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 98 [2018-10-01 00:33:16,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-01 00:33:16,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-01 00:33:16,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:16,925 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-10-01 00:33:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:33:39,162 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-10-01 00:33:39,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-01 00:33:39,163 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-10-01 00:33:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:33:39,164 INFO L225 Difference]: With dead ends: 103 [2018-10-01 00:33:39,164 INFO L226 Difference]: Without dead ends: 101 [2018-10-01 00:33:39,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.2s Time [2018-10-01 00:33:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-01 00:33:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-01 00:33:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-01 00:33:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-01 00:33:39,200 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-10-01 00:33:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:33:39,200 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-01 00:33:39,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-01 00:33:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-01 00:33:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-01 00:33:39,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:33:39,201 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-10-01 00:33:39,201 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:33:39,201 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:33:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 49 times [2018-10-01 00:33:39,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:33:39,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:33:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:39,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:33:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:33:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:33:46,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:33:46,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:33:46,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:33:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:33:48,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:33:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:33:48,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:33:48,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 100 [2018-10-01 00:33:48,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-01 00:33:48,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-01 00:33:48,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:33:48,837 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-10-01 00:34:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:07,702 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-10-01 00:34:07,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-01 00:34:07,702 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-10-01 00:34:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:07,703 INFO L225 Difference]: With dead ends: 105 [2018-10-01 00:34:07,703 INFO L226 Difference]: Without dead ends: 103 [2018-10-01 00:34:07,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.5s Time [2018-10-01 00:34:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-01 00:34:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-01 00:34:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-01 00:34:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-01 00:34:07,732 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-10-01 00:34:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:07,732 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-01 00:34:07,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-01 00:34:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-01 00:34:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-01 00:34:07,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:07,733 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-10-01 00:34:07,733 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:07,734 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 50 times [2018-10-01 00:34:07,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:07,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:07,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:07,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:34:07,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:34:14,776 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:14,776 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:14,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:34:16,123 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:34:16,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:34:16,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:34:17,370 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:17,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 102 [2018-10-01 00:34:17,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-01 00:34:17,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-01 00:34:17,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:17,371 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-10-01 00:34:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:34:38,594 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-10-01 00:34:38,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-01 00:34:38,594 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-10-01 00:34:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:34:38,595 INFO L225 Difference]: With dead ends: 107 [2018-10-01 00:34:38,595 INFO L226 Difference]: Without dead ends: 105 [2018-10-01 00:34:38,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.7s Time [2018-10-01 00:34:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-01 00:34:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-10-01 00:34:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-01 00:34:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-01 00:34:38,635 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-10-01 00:34:38,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:34:38,636 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-01 00:34:38,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-01 00:34:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-01 00:34:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-01 00:34:38,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:34:38,637 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-10-01 00:34:38,637 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:34:38,637 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:34:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 51 times [2018-10-01 00:34:38,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:34:38,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:34:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:38,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:34:38,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:34:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:34:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:34:46,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:34:46,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:34:46,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:34:46,491 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-01 00:34:46,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:34:46,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:34:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:34:47,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:34:47,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 104 [2018-10-01 00:34:47,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-01 00:34:47,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-01 00:34:47,188 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:34:47,188 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 105 states. [2018-10-01 00:35:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:35:23,109 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-10-01 00:35:23,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-01 00:35:23,109 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2018-10-01 00:35:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:35:23,110 INFO L225 Difference]: With dead ends: 109 [2018-10-01 00:35:23,110 INFO L226 Difference]: Without dead ends: 107 [2018-10-01 00:35:23,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.4s Time [2018-10-01 00:35:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-01 00:35:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-01 00:35:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-01 00:35:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-01 00:35:23,145 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-10-01 00:35:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:35:23,145 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-01 00:35:23,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-01 00:35:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-01 00:35:23,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-01 00:35:23,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:35:23,146 INFO L375 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-10-01 00:35:23,146 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:35:23,146 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:35:23,147 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 52 times [2018-10-01 00:35:23,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:35:23,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:35:23,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:23,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:35:23,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:35:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:35:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:35:30,964 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:35:30,964 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:35:30,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:35:32,426 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:35:32,426 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:35:33,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:35:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:35:33,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:35:33,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 106 [2018-10-01 00:35:33,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-01 00:35:33,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-01 00:35:33,995 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:35:33,995 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 107 states. [2018-10-01 00:36:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:05,979 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-10-01 00:36:05,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-01 00:36:05,980 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 106 [2018-10-01 00:36:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:05,981 INFO L225 Difference]: With dead ends: 111 [2018-10-01 00:36:05,981 INFO L226 Difference]: Without dead ends: 109 [2018-10-01 00:36:05,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.3s Time [2018-10-01 00:36:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-01 00:36:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-01 00:36:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-01 00:36:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-01 00:36:06,022 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-10-01 00:36:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:06,022 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-01 00:36:06,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-01 00:36:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-01 00:36:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-01 00:36:06,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:06,023 INFO L375 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-10-01 00:36:06,023 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:06,023 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:06,024 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 53 times [2018-10-01 00:36:06,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:06,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:06,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:06,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:36:06,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:36:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:36:14,326 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:36:14,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:36:14,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:36:15,593 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-01 00:36:15,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:36:15,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:36:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:36:16,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:36:16,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 108 [2018-10-01 00:36:16,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-01 00:36:16,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-01 00:36:16,193 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:36:16,194 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 109 states. [2018-10-01 00:36:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:36:52,028 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-10-01 00:36:52,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-01 00:36:52,029 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 108 [2018-10-01 00:36:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:36:52,029 INFO L225 Difference]: With dead ends: 113 [2018-10-01 00:36:52,029 INFO L226 Difference]: Without dead ends: 111 [2018-10-01 00:36:52,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.4s Time [2018-10-01 00:36:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-01 00:36:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-10-01 00:36:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-01 00:36:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-01 00:36:52,061 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-10-01 00:36:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:36:52,061 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-01 00:36:52,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-01 00:36:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-01 00:36:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-01 00:36:52,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:36:52,062 INFO L375 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-10-01 00:36:52,063 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:36:52,063 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:36:52,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 54 times [2018-10-01 00:36:52,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:36:52,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:36:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:52,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:36:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:36:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:37:00,500 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:00,500 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:00,506 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:37:00,596 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-01 00:37:00,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:37:00,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:37:02,168 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:02,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 110 [2018-10-01 00:37:02,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-01 00:37:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-01 00:37:02,169 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:02,169 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 111 states. [2018-10-01 00:37:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:37:22,879 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-10-01 00:37:22,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-01 00:37:22,880 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 110 [2018-10-01 00:37:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:37:22,880 INFO L225 Difference]: With dead ends: 115 [2018-10-01 00:37:22,880 INFO L226 Difference]: Without dead ends: 113 [2018-10-01 00:37:22,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.6s Time [2018-10-01 00:37:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-01 00:37:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-10-01 00:37:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-01 00:37:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-01 00:37:22,912 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-10-01 00:37:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:37:22,913 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-01 00:37:22,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-01 00:37:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-01 00:37:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-01 00:37:22,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:37:22,913 INFO L375 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-10-01 00:37:22,914 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:37:22,914 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:37:22,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 55 times [2018-10-01 00:37:22,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:37:22,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:37:22,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:22,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:37:22,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:37:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:37:31,709 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:37:31,709 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:37:31,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:37:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:37:34,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:37:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:37:35,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:37:35,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 112 [2018-10-01 00:37:35,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-01 00:37:35,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-01 00:37:35,271 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:37:35,272 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 113 states. [2018-10-01 00:38:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:01,566 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-10-01 00:38:01,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-01 00:38:01,567 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 112 [2018-10-01 00:38:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:01,568 INFO L225 Difference]: With dead ends: 117 [2018-10-01 00:38:01,568 INFO L226 Difference]: Without dead ends: 115 [2018-10-01 00:38:01,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.3s Time [2018-10-01 00:38:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-01 00:38:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-10-01 00:38:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-01 00:38:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-01 00:38:01,602 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-10-01 00:38:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:01,603 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-01 00:38:01,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-01 00:38:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-01 00:38:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-01 00:38:01,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:01,603 INFO L375 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-10-01 00:38:01,604 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:01,604 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:01,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1489203976, now seen corresponding path program 56 times [2018-10-01 00:38:01,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:01,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:01,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:01,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:01,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:10,376 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:10,376 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:10,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:38:12,245 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:38:12,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:13,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:13,966 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:13,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 114 [2018-10-01 00:38:13,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-01 00:38:13,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-01 00:38:13,967 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:13,967 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 115 states. [2018-10-01 00:38:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:43,881 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-10-01 00:38:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-01 00:38:43,882 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 114 [2018-10-01 00:38:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:43,883 INFO L225 Difference]: With dead ends: 119 [2018-10-01 00:38:43,883 INFO L226 Difference]: Without dead ends: 117 [2018-10-01 00:38:43,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.8s Time [2018-10-01 00:38:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-01 00:38:43,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-10-01 00:38:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-01 00:38:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-01 00:38:43,919 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-10-01 00:38:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:43,919 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-01 00:38:43,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-01 00:38:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-01 00:38:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-01 00:38:43,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:43,920 INFO L375 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-10-01 00:38:43,920 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:43,920 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash 900848168, now seen corresponding path program 57 times [2018-10-01 00:38:43,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:43,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:43,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:43,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:43,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:53,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:53,615 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:53,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:38:53,717 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-01 00:38:53,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:53,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:54,280 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:54,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 116 [2018-10-01 00:38:54,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-01 00:38:54,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-01 00:38:54,281 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:54,281 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 117 states. Received shutdown request... [2018-10-01 00:39:10,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:39:10,840 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 00:39:10,845 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 00:39:10,845 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:39:10 BoogieIcfgContainer [2018-10-01 00:39:10,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:39:10,846 INFO L168 Benchmark]: Toolchain (without parser) took 818980.92 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -4.7 MB). Free memory was 1.5 GB in the beginning and 792.7 MB in the end (delta: 675.6 MB). Peak memory consumption was 670.8 MB. Max. memory is 7.1 GB. [2018-10-01 00:39:10,848 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:39:10,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:39:10,849 INFO L168 Benchmark]: Boogie Preprocessor took 21.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:39:10,849 INFO L168 Benchmark]: RCFGBuilder took 248.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:39:10,850 INFO L168 Benchmark]: TraceAbstraction took 818660.28 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -4.7 MB). Free memory was 1.4 GB in the beginning and 792.7 MB in the end (delta: 654.4 MB). Peak memory consumption was 649.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:39:10,857 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 248.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 818660.28 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -4.7 MB). Free memory was 1.4 GB in the beginning and 792.7 MB in the end (delta: 654.4 MB). Peak memory consumption was 649.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (117states) and FLOYD_HOARE automaton (currently 22 states, 117 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 818.5s OverallTime, 58 OverallIterations, 113 TraceHistogramMax, 575.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 0 SDslu, 3231 SDs, 0 SdLazy, 6766 SolverSat, 3248 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9883 GetRequests, 3364 SyntacticMatches, 0 SemanticMatches, 6519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 706.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 57 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 37.0s SatisfiabilityAnalysisTime, 202.5s InterpolantComputationTime, 6843 NumberOfCodeBlocks, 6843 NumberOfCodeBlocksAsserted, 965 NumberOfCheckSat, 6728 ConstructedInterpolants, 0 QuantifiedInterpolants, 2581146 SizeOfPredicates, 114 NumberOfNonLiveVariables, 10716 ConjunctsInSsa, 3458 ConjunctsInUnsatCore, 115 InterpolantComputations, 1 PerfectInterpolantSequences, 0/250154 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-39-10-868.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-39-10-868.csv Completed graceful shutdown