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.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:29:31,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:29:31,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:29:31,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:29:31,789 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:29:31,790 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:29:31,791 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:29:31,793 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:29:31,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:29:31,795 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:29:31,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:29:31,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:29:31,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:29:31,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:29:31,799 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:29:31,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:29:31,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:29:31,802 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:29:31,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:29:31,806 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:29:31,807 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:29:31,808 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:29:31,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:29:31,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:29:31,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:29:31,812 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:29:31,813 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:29:31,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:29:31,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:29:31,816 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:29:31,816 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:29:31,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:29:31,817 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:29:31,817 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:29:31,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:29:31,819 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:29:31,819 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:29:31,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:29:31,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:29:31,841 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:29:31,841 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:29:31,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:29:31,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:29:31,842 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:29:31,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:29:31,843 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:29:31,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:29:31,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:29:31,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:29:31,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:29:31,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:29:31,844 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:29:31,844 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:29:31,844 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:29:31,844 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:29:31,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:29:31,845 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:29:31,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:29:31,845 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:29:31,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:29:31,845 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:29:31,846 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:29:31,846 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:29:31,846 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:29:31,846 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:29:31,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:29:31,847 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:29:31,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:29:31,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:29:31,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:29:31,914 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:29:31,914 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:29:31,915 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-10-04 12:29:31,915 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl' [2018-10-04 12:29:31,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:29:31,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:29:31,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:29:31,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:29:31,965 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:29:31,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29:31" (1/1) ... [2018-10-04 12:29:31,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29:31" (1/1) ... [2018-10-04 12:29:32,002 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:29:32,002 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:29:32,002 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:29:32,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:29:32,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:29:32,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:29:32,006 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:29:32,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29:31" (1/1) ... [2018-10-04 12:29:32,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29:31" (1/1) ... [2018-10-04 12:29:32,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29:31" (1/1) ... [2018-10-04 12:29:32,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29:31" (1/1) ... [2018-10-04 12:29:32,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29:31" (1/1) ... [2018-10-04 12:29:32,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29:31" (1/1) ... [2018-10-04 12:29:32,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29:31" (1/1) ... [2018-10-04 12:29:32,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:29:32,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:29:32,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:29:32,026 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:29:32,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29: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-04 12:29:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-10-04 12:29:32,092 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-10-04 12:29:32,270 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:29:32,270 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:29:32 BoogieIcfgContainer [2018-10-04 12:29:32,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:29:32,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:29:32,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:29:32,278 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:29:32,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:29:31" (1/2) ... [2018-10-04 12:29:32,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b429d5e and model type DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:29:32, skipping insertion in model container [2018-10-04 12:29:32,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:29:32" (2/2) ... [2018-10-04 12:29:32,281 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-10-04 12:29:32,292 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:29:32,301 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:29:32,357 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:29:32,358 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:29:32,358 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:29:32,358 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:29:32,358 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:29:32,358 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:29:32,358 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:29:32,359 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:29:32,359 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:29:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 12:29:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 12:29:32,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:32,381 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 12:29:32,382 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:32,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-04 12:29:32,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:32,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:32,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:32,557 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-04 12:29:32,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:29:32,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:29:32,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:29:32,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:29:32,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:29:32,577 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 12:29:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:32,633 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:29:32,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:29:32,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 12:29:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:32,646 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:29:32,646 INFO L226 Difference]: Without dead ends: 4 [2018-10-04 12:29:32,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:29:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-04 12:29:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-04 12:29:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-04 12:29:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-04 12:29:32,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-04 12:29:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:32,689 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-04 12:29:32,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:29:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-04 12:29:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:29:32,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:32,690 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:29:32,690 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:32,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-04 12:29:32,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:32,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:32,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:32,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:32,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:32,882 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-04 12:29:32,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:32,883 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-04 12:29:32,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:32,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:32,984 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-04 12:29:33,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:33,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-10-04 12:29:33,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:29:33,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:29:33,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:29:33,023 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-10-04 12:29:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:33,126 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-04 12:29:33,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:29:33,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-10-04 12:29:33,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:33,127 INFO L225 Difference]: With dead ends: 6 [2018-10-04 12:29:33,128 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 12:29:33,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:29:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 12:29:33,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 12:29:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 12:29:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 12:29:33,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 12:29:33,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:33,132 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 12:29:33,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:29:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 12:29:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:29:33,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:33,133 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-04 12:29:33,133 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:33,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:33,134 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-04 12:29:33,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:33,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:33,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:33,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:33,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:33,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:33,498 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-04 12:29:33,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:29:33,541 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:29:33,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:33,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:33,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:33,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:29:33,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:29:33,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:29:33,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:29:33,591 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-10-04 12:29:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:33,643 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-04 12:29:33,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:29:33,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 12:29:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:33,644 INFO L225 Difference]: With dead ends: 7 [2018-10-04 12:29:33,644 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 12:29:33,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:29:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 12:29:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 12:29:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:29:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 12:29:33,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 12:29:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:33,649 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 12:29:33,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:29:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 12:29:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:29:33,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:33,650 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-04 12:29:33,650 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:33,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:33,651 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-04 12:29:33,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:33,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:33,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:33,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:33,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:33,854 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-04 12:29:33,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:33,855 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-04 12:29:33,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:29:33,904 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:29:33,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:33,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:33,959 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-04 12:29:33,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:33,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:29:33,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:29:33,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:29:33,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:29:33,994 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-10-04 12:29:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:34,152 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 12:29:34,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:29:34,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 12:29:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:34,153 INFO L225 Difference]: With dead ends: 8 [2018-10-04 12:29:34,153 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:29:34,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:29:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:29:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:29:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:29:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:29:34,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 12:29:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:34,157 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:29:34,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:29:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:29:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:29:34,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:34,158 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-04 12:29:34,158 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:34,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-04 12:29:34,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:34,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:34,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:34,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:34,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:34,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:34,316 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-04 12:29:34,329 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:29:34,345 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:29:34,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:34,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:34,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:34,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:29:34,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:29:34,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:29:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:29:34,376 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-10-04 12:29:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:34,533 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:29:34,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:29:34,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-04 12:29:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:34,534 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:29:34,534 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 12:29:34,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:29:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 12:29:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 12:29:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:29:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 12:29:34,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 12:29:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:34,539 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 12:29:34,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:29:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 12:29:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:29:34,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:34,541 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-04 12:29:34,541 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:34,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:34,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-04 12:29:34,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:34,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:34,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:34,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:34,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:34,689 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-04 12:29:34,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:34,690 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-04 12:29:34,700 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:29:34,707 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 12:29:34,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:34,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:34,715 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-04 12:29:34,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:34,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:29:34,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:29:34,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:29:34,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:29:34,738 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-10-04 12:29:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:34,854 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 12:29:34,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:29:34,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-04 12:29:34,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:34,857 INFO L225 Difference]: With dead ends: 10 [2018-10-04 12:29:34,857 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:29:34,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:29:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:29:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:29:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:29:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:29:34,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 12:29:34,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:34,861 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:29:34,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:29:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:29:34,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:29:34,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:34,862 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-04 12:29:34,863 INFO L423 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:34,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:34,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-04 12:29:34,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:34,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:34,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:34,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:34,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:35,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:35,364 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-04 12:29:35,376 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:29:35,401 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 12:29:35,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:35,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:35,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:35,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:29:35,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:29:35,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:29:35,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:29:35,432 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-10-04 12:29:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:35,544 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:29:35,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:29:35,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-10-04 12:29:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:35,546 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:29:35,546 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:29:35,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:29:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:29:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 12:29:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:29:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 12:29:35,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 12:29:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:35,551 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 12:29:35,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:29:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 12:29:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:29:35,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:35,552 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-04 12:29:35,552 INFO L423 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:35,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:35,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-04 12:29:35,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:35,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:35,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:35,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:35,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:35,710 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-04 12:29:35,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:35,711 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-04 12:29:35,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:35,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:35,735 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-04 12:29:35,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:35,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:29:35,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:29:35,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:29:35,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:29:35,758 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-10-04 12:29:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:35,872 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 12:29:35,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:29:35,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-10-04 12:29:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:35,873 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:29:35,874 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:29:35,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:29:35,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:29:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:29:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:29:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:29:35,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 12:29:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:35,879 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:29:35,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:29:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:29:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:29:35,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:35,880 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-04 12:29:35,881 INFO L423 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:35,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-04 12:29:35,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:35,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:35,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:36,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:36,089 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-04 12:29:36,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:29:36,112 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:29:36,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:36,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:36,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:36,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:29:36,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:29:36,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:29:36,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:29:36,145 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-10-04 12:29:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:36,256 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:29:36,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:29:36,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-10-04 12:29:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:36,259 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:29:36,259 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:29:36,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:29:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:29:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 12:29:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:29:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 12:29:36,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 12:29:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:36,263 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 12:29:36,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:29:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 12:29:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:29:36,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:36,264 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-04 12:29:36,264 INFO L423 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:36,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:36,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-04 12:29:36,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:36,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:36,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:36,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:36,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:36,486 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-04 12:29:36,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:36,487 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-04 12:29:36,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:29:36,508 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:29:36,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:36,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:36,547 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-04 12:29:36,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:36,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:29:36,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:29:36,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:29:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:29:36,574 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-10-04 12:29:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:36,715 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 12:29:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:29:36,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-04 12:29:36,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:36,716 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:29:36,716 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 12:29:36,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:29:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 12:29:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 12:29:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:29:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:29:36,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 12:29:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:36,720 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:29:36,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:29:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:29:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:29:36,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:36,721 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-04 12:29:36,721 INFO L423 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:36,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-04 12:29:36,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:36,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:36,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:36,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:36,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:36,984 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-04 12:29:37,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:29:37,008 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:29:37,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:37,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:37,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:37,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 12:29:37,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:29:37,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:29:37,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:29:37,048 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-10-04 12:29:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:37,167 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:29:37,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:29:37,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-04 12:29:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:37,169 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:29:37,169 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:29:37,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:29:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:29:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 12:29:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:29:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 12:29:37,174 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 12:29:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:37,174 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 12:29:37,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:29:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 12:29:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:29:37,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:37,175 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-04 12:29:37,176 INFO L423 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:37,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:37,176 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-04 12:29:37,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:37,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:37,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:37,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:37,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:37,394 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-04 12:29:37,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:37,394 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-04 12:29:37,409 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:29:37,426 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:29:37,426 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:37,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:37,443 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-04 12:29:37,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:37,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 12:29:37,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:29:37,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:29:37,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:29:37,466 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-10-04 12:29:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:37,681 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 12:29:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:29:37,681 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 12:29:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:37,682 INFO L225 Difference]: With dead ends: 16 [2018-10-04 12:29:37,682 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:29:37,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:29:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:29:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 12:29:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 12:29:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 12:29:37,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 12:29:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:37,687 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 12:29:37,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:29:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 12:29:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:29:37,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:37,688 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-04 12:29:37,689 INFO L423 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:37,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-04 12:29:37,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:37,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:37,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:37,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:37,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:37,976 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-04 12:29:37,984 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:29:38,003 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:29:38,003 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:38,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:38,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:38,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 12:29:38,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:29:38,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:29:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:29:38,080 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-10-04 12:29:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:38,299 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 12:29:38,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:29:38,300 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-04 12:29:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:38,301 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:29:38,301 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:29:38,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:29:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:29:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 12:29:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:29:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 12:29:38,306 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 12:29:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:38,307 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 12:29:38,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:29:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 12:29:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:29:38,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:38,308 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-04 12:29:38,308 INFO L423 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:38,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:38,308 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-04 12:29:38,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:38,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:38,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:38,562 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-04 12:29:38,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:38,562 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-04 12:29:38,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:38,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:38,592 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-04 12:29:38,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:38,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 12:29:38,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:29:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:29:38,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:29:38,622 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-10-04 12:29:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:38,897 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 12:29:38,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:29:38,898 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-04 12:29:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:38,898 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:29:38,899 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:29:38,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:29:38,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:29:38,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:29:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:29:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:29:38,908 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 12:29:38,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:38,908 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:29:38,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:29:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:29:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:29:38,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:38,909 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-04 12:29:38,909 INFO L423 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:38,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:38,909 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-04 12:29:38,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:38,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:38,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:38,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:38,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:39,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:39,215 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-04 12:29:39,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:29:39,262 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:29:39,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:39,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:39,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:39,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 12:29:39,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:29:39,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:29:39,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:29:39,325 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-10-04 12:29:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:39,647 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:29:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:29:39,648 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:29:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:39,649 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:29:39,649 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:29:39,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:29:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:29:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 12:29:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:29:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 12:29:39,655 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 12:29:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:39,655 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 12:29:39,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:29:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 12:29:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:29:39,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:39,656 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-04 12:29:39,657 INFO L423 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:39,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:39,657 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-04 12:29:39,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:39,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:39,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:39,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:39,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:39,945 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-04 12:29:39,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:39,946 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-04 12:29:39,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:29:39,977 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:29:39,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:39,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:39,992 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-04 12:29:40,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:40,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 12:29:40,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:29:40,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:29:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:29:40,014 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-10-04 12:29:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:40,202 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 12:29:40,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:29:40,202 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-10-04 12:29:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:40,203 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:29:40,203 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:29:40,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:29:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:29:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 12:29:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:29:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 12:29:40,208 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 12:29:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:40,209 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 12:29:40,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:29:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 12:29:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:29:40,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:40,210 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-04 12:29:40,210 INFO L423 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:40,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:40,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-04 12:29:40,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:40,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:40,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:40,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:40,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:40,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:40,540 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-04 12:29:40,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:29:40,554 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:29:40,554 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:40,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:40,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:40,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 12:29:40,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:29:40,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:29:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:29:40,604 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-10-04 12:29:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:40,880 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 12:29:40,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:29:40,881 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-04 12:29:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:40,882 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:29:40,882 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:29:40,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:29:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:29:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 12:29:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:29:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 12:29:40,888 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 12:29:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:40,888 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 12:29:40,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:29:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 12:29:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:29:40,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:40,889 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-04 12:29:40,889 INFO L423 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:40,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:40,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-04 12:29:40,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:40,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:40,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:40,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:40,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:41,367 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-04 12:29:41,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:41,368 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-04 12:29:41,379 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:29:41,389 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 12:29:41,389 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:41,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:41,398 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-04 12:29:41,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:41,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 12:29:41,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:29:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:29:41,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:29:41,422 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-10-04 12:29:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:41,705 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 12:29:41,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:29:41,705 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-10-04 12:29:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:41,706 INFO L225 Difference]: With dead ends: 22 [2018-10-04 12:29:41,706 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:29:41,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:29:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:29:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:29:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:29:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:29:41,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 12:29:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:41,712 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:29:41,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:29:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:29:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:29:41,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:41,713 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-04 12:29:41,714 INFO L423 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:41,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:41,714 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-04 12:29:41,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:41,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:41,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:42,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:42,262 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-04 12:29:42,270 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:29:42,316 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 12:29:42,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:42,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:42,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:42,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 12:29:42,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:29:42,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:29:42,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:29:42,355 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-10-04 12:29:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:42,671 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:29:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:29:42,671 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-10-04 12:29:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:42,672 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:29:42,673 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:29:42,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:29:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:29:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 12:29:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:29:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 12:29:42,679 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 12:29:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:42,679 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 12:29:42,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:29:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 12:29:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:29:42,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:42,680 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-04 12:29:42,681 INFO L423 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:42,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:42,681 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-04 12:29:42,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:42,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:42,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:42,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:42,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:42,997 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-04 12:29:42,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:42,997 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-04 12:29:43,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:43,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:43,024 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-04 12:29:43,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:43,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 12:29:43,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:29:43,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:29:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:29:43,055 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-10-04 12:29:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:43,433 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 12:29:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:29:43,434 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-10-04 12:29:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:43,435 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:29:43,435 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:29:43,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:29:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:29:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:29:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:29:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 12:29:43,441 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 12:29:43,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:43,441 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 12:29:43,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:29:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 12:29:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:29:43,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:43,442 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-04 12:29:43,443 INFO L423 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:43,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:43,443 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-04 12:29:43,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:43,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:43,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:44,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:44,102 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-04 12:29:44,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:29:44,120 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:29:44,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:44,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:44,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:44,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 12:29:44,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 12:29:44,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 12:29:44,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:29:44,156 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-10-04 12:29:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:44,511 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 12:29:44,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:29:44,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-10-04 12:29:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:44,512 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:29:44,513 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:29:44,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:29:44,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:29:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 12:29:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:29:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 12:29:44,518 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 12:29:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:44,518 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 12:29:44,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 12:29:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 12:29:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:29:44,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:44,519 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-04 12:29:44,519 INFO L423 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:44,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:44,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-04 12:29:44,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:44,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:44,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:44,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:44,940 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-04 12:29:44,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:44,941 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-04 12:29:44,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:29:44,967 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 12:29:44,967 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:44,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:44,980 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-04 12:29:45,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:45,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 12:29:45,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:29:45,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:29:45,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:29:45,008 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-10-04 12:29:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:45,417 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 12:29:45,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:29:45,420 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-10-04 12:29:45,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:45,420 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:29:45,420 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:29:45,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:29:45,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:29:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 12:29:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:29:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 12:29:45,425 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 12:29:45,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:45,425 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 12:29:45,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:29:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 12:29:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:29:45,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:45,426 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-04 12:29:45,426 INFO L423 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:45,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:45,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-04 12:29:45,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:45,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:45,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:45,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:45,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:46,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:46,105 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-04 12:29:46,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:29:46,122 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:29:46,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:46,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:46,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:46,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 12:29:46,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 12:29:46,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 12:29:46,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:29:46,179 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-10-04 12:29:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:46,590 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 12:29:46,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:29:46,591 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-10-04 12:29:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:46,592 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:29:46,592 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:29:46,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:29:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:29:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 12:29:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:29:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 12:29:46,598 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 12:29:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:46,598 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 12:29:46,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 12:29:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 12:29:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:29:46,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:46,599 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-04 12:29:46,600 INFO L423 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:46,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:46,600 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-04 12:29:46,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:46,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:46,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:47,339 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-04 12:29:47,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:47,339 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-04 12:29:47,347 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:29:47,358 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 12:29:47,359 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:47,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:47,369 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-04 12:29:47,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:47,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 12:29:47,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:29:47,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:29:47,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:29:47,390 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-10-04 12:29:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:48,344 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 12:29:48,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:29:48,345 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-10-04 12:29:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:48,345 INFO L225 Difference]: With dead ends: 28 [2018-10-04 12:29:48,346 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:29:48,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:29:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:29:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 12:29:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:29:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 12:29:48,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 12:29:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:48,350 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 12:29:48,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:29:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 12:29:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:29:48,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:48,351 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-04 12:29:48,351 INFO L423 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:48,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:48,352 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-04 12:29:48,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:48,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:48,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:48,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:48,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:48,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:48,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 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-04 12:29:48,851 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:29:48,863 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:29:48,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:48,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:48,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:48,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 12:29:48,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 12:29:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 12:29:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:29:48,896 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-10-04 12:29:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:49,372 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 12:29:49,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:29:49,373 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-10-04 12:29:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:49,373 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:29:49,373 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 12:29:49,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:29:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 12:29:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 12:29:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:29:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 12:29:49,379 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 12:29:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:49,379 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 12:29:49,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 12:29:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 12:29:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 12:29:49,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:49,380 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-04 12:29:49,380 INFO L423 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:49,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:49,381 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-04 12:29:49,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:49,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:49,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:49,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:49,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:49,856 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-04 12:29:49,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:49,856 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-04 12:29:49,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:49,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:49,886 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-04 12:29:49,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:49,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 12:29:49,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:29:49,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:29:49,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:29:49,908 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-10-04 12:29:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:50,371 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 12:29:50,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:29:50,372 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-10-04 12:29:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:50,373 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:29:50,373 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:29:50,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:29:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:29:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 12:29:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:29:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 12:29:50,378 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 12:29:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:50,379 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 12:29:50,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:29:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 12:29:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:29:50,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:50,379 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-04 12:29:50,380 INFO L423 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:50,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-04 12:29:50,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:50,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:50,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:50,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:50,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:50,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:50,926 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-04 12:29:50,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:29:50,944 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:29:50,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:50,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:50,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:50,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 12:29:50,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:29:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:29:50,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-04 12:29:50,986 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-10-04 12:29:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:51,462 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 12:29:51,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:29:51,463 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-10-04 12:29:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:51,464 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:29:51,464 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:29:51,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-04 12:29:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:29:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 12:29:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:29:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 12:29:51,469 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 12:29:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:51,469 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 12:29:51,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:29:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 12:29:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:29:51,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:51,470 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-04 12:29:51,470 INFO L423 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:51,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-04 12:29:51,471 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:51,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:51,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:51,939 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-04 12:29:51,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:51,940 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-04 12:29:51,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:29:51,962 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 12:29:51,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:51,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:51,976 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-04 12:29:51,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:51,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 12:29:51,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:29:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:29:51,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-04 12:29:51,997 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-10-04 12:29:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:52,879 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 12:29:52,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:29:52,879 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-10-04 12:29:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:52,880 INFO L225 Difference]: With dead ends: 32 [2018-10-04 12:29:52,880 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:29:52,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-04 12:29:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:29:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 12:29:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:29:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 12:29:52,886 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 12:29:52,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:52,886 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 12:29:52,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:29:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 12:29:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:29:52,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:52,887 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-04 12:29:52,887 INFO L423 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:52,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-04 12:29:52,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:52,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:52,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:52,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:53,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:53,461 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-04 12:29:53,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:29:53,478 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:29:53,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:53,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:53,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:53,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 12:29:53,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 12:29:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 12:29:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-04 12:29:53,512 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-10-04 12:29:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:54,058 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 12:29:54,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:29:54,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-10-04 12:29:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:54,059 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:29:54,059 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:29:54,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-04 12:29:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:29:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 12:29:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:29:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 12:29:54,066 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 12:29:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:54,066 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 12:29:54,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 12:29:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 12:29:54,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:29:54,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:54,067 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-04 12:29:54,067 INFO L423 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:54,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:54,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-04 12:29:54,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:54,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:54,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:54,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:54,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:54,654 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-04 12:29:54,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:54,655 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-04 12:29:54,668 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:29:54,685 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 12:29:54,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:54,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:54,702 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-04 12:29:54,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:54,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 12:29:54,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:29:54,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:29:54,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:29:54,723 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-10-04 12:29:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:55,366 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 12:29:55,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:29:55,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-10-04 12:29:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:55,368 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:29:55,368 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:29:55,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:29:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:29:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:29:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:29:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 12:29:55,373 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 12:29:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:55,374 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 12:29:55,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:29:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 12:29:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:29:55,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:55,374 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-04 12:29:55,374 INFO L423 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:55,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-04 12:29:55,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:55,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:55,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:55,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:55,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:56,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:56,003 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-04 12:29:56,013 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:29:56,028 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 12:29:56,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:56,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:56,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:56,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 12:29:56,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 12:29:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 12:29:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:29:56,087 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-10-04 12:29:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:56,717 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 12:29:56,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:29:56,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-10-04 12:29:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:56,718 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:29:56,718 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:29:56,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 12:29:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:29:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 12:29:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:29:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 12:29:56,723 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 12:29:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:56,723 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 12:29:56,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 12:29:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 12:29:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:29:56,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:56,724 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-04 12:29:56,724 INFO L423 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:56,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:56,725 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-04 12:29:56,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:56,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:56,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:56,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:56,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:58,186 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-04 12:29:58,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:58,187 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-04 12:29:58,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:58,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:58,222 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-04 12:29:58,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:58,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 12:29:58,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 12:29:58,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 12:29:58,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:29:58,247 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-10-04 12:29:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:58,980 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 12:29:58,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:29:58,980 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-10-04 12:29:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:58,981 INFO L225 Difference]: With dead ends: 36 [2018-10-04 12:29:58,981 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:29:58,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:29:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:29:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 12:29:58,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:29:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 12:29:58,986 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 12:29:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:58,986 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 12:29:58,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 12:29:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 12:29:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:29:58,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:58,987 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-04 12:29:58,987 INFO L423 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:58,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:58,988 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-04 12:29:58,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:58,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:58,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:58,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:58,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:00,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:00,158 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-04 12:30:00,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:30:00,175 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:30:00,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:00,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:00,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:00,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 12:30:00,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 12:30:00,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 12:30:00,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:30:00,247 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-10-04 12:30:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:01,111 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 12:30:01,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:30:01,111 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-10-04 12:30:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:01,112 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:30:01,112 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 12:30:01,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:30:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 12:30:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 12:30:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 12:30:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 12:30:01,118 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 12:30:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:01,118 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 12:30:01,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 12:30:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 12:30:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 12:30:01,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:01,119 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-04 12:30:01,119 INFO L423 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:01,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:01,120 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-04 12:30:01,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:01,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:01,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:01,803 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-04 12:30:01,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:01,804 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-04 12:30:01,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:30:01,828 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 12:30:01,828 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:01,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:01,842 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-04 12:30:01,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:01,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 12:30:01,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:30:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:30:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:30:01,864 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-10-04 12:30:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:02,821 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 12:30:02,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:30:02,821 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-10-04 12:30:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:02,822 INFO L225 Difference]: With dead ends: 38 [2018-10-04 12:30:02,822 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:30:02,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:30:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:30:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 12:30:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:30:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 12:30:02,827 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 12:30:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:02,828 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 12:30:02,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:30:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 12:30:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:30:02,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:02,828 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-04 12:30:02,828 INFO L423 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:02,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:02,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-04 12:30:02,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:02,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:02,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:02,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:02,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:03,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:03,826 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-04 12:30:03,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:30:03,845 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:30:03,846 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:03,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:03,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:03,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 12:30:03,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 12:30:03,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 12:30:03,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:30:03,885 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-10-04 12:30:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:04,678 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 12:30:04,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:30:04,678 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-10-04 12:30:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:04,679 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:30:04,679 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 12:30:04,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:30:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 12:30:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 12:30:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 12:30:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 12:30:04,683 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 12:30:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:04,683 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 12:30:04,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 12:30:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 12:30:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:30:04,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:04,683 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-04 12:30:04,684 INFO L423 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:04,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-04 12:30:04,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:04,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:04,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:04,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:04,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:05,392 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-04 12:30:05,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:05,393 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-04 12:30:05,401 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:30:05,421 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 12:30:05,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:05,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:05,434 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-04 12:30:05,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:05,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 12:30:05,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:30:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:30:05,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:30:05,455 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-10-04 12:30:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:06,289 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 12:30:06,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:30:06,290 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-10-04 12:30:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:06,291 INFO L225 Difference]: With dead ends: 40 [2018-10-04 12:30:06,291 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:30:06,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:30:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:30:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 12:30:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 12:30:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 12:30:06,295 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 12:30:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:06,296 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 12:30:06,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:30:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 12:30:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:30:06,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:06,297 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-04 12:30:06,297 INFO L423 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:06,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-04 12:30:06,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:06,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:06,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:06,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:06,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:07,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:07,679 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-04 12:30:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:30:07,718 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:30:07,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:07,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:07,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:07,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 12:30:07,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 12:30:07,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 12:30:07,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 12:30:07,751 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-10-04 12:30:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:08,709 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 12:30:08,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:30:08,709 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-10-04 12:30:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:08,710 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:30:08,710 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 12:30:08,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 12:30:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 12:30:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 12:30:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 12:30:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 12:30:08,715 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 12:30:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:08,716 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 12:30:08,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 12:30:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 12:30:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 12:30:08,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:08,716 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-04 12:30:08,717 INFO L423 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:08,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-04 12:30:08,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:08,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:08,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:08,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:08,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:10,099 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-04 12:30:10,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:10,100 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-04 12:30:10,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:30:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:10,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:10,131 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-04 12:30:10,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:10,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 12:30:10,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 12:30:10,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 12:30:10,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:30:10,153 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-10-04 12:30:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:11,075 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 12:30:11,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:30:11,076 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-10-04 12:30:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:11,076 INFO L225 Difference]: With dead ends: 42 [2018-10-04 12:30:11,077 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:30:11,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:30:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:30:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 12:30:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:30:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 12:30:11,081 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 12:30:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:11,081 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 12:30:11,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 12:30:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 12:30:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 12:30:11,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:11,082 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-04 12:30:11,082 INFO L423 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:11,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:11,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-04 12:30:11,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:11,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:11,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:11,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:30:11,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:13,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:13,007 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-04 12:30:13,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:30:13,027 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:30:13,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:13,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:13,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:13,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 12:30:13,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 12:30:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 12:30:13,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 12:30:13,067 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-10-04 12:30:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:14,049 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 12:30:14,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:30:14,050 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-10-04 12:30:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:14,050 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:30:14,051 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 12:30:14,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 12:30:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 12:30:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 12:30:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 12:30:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 12:30:14,055 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 12:30:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:14,056 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 12:30:14,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 12:30:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 12:30:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:30:14,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:14,056 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-04 12:30:14,057 INFO L423 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:14,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:14,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-04 12:30:14,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:14,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:14,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:14,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:14,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:15,030 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-04 12:30:15,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:15,030 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-04 12:30:15,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:30:15,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 12:30:15,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:15,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:15,072 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-04 12:30:15,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:15,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 12:30:15,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 12:30:15,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 12:30:15,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:30:15,096 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-10-04 12:30:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:16,123 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 12:30:16,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:30:16,123 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-10-04 12:30:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:16,124 INFO L225 Difference]: With dead ends: 44 [2018-10-04 12:30:16,124 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:30:16,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:30:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:30:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 12:30:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 12:30:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 12:30:16,128 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 12:30:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:16,129 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 12:30:16,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 12:30:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 12:30:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 12:30:16,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:16,129 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-04 12:30:16,129 INFO L423 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:16,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-04 12:30:16,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:16,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:16,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:16,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:17,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:17,109 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-04 12:30:17,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:30:17,128 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:30:17,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:17,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:17,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:17,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 12:30:17,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 12:30:17,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 12:30:17,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:30:17,162 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-10-04 12:30:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:18,409 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 12:30:18,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:30:18,410 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-10-04 12:30:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:18,411 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:30:18,411 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:30:18,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:30:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:30:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 12:30:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:30:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 12:30:18,416 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 12:30:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:18,416 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 12:30:18,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 12:30:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 12:30:18,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:30:18,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:18,417 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-04 12:30:18,417 INFO L423 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:18,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:18,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-04 12:30:18,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:18,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:18,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:18,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:18,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:20,664 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-04 12:30:20,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:20,665 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-04 12:30:20,672 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:30:20,696 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 12:30:20,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:20,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:20,711 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-04 12:30:20,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:20,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 12:30:20,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 12:30:20,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 12:30:20,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:30:20,733 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-10-04 12:30:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:21,849 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 12:30:21,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:30:21,850 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-10-04 12:30:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:21,850 INFO L225 Difference]: With dead ends: 46 [2018-10-04 12:30:21,850 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:30:21,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:30:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:30:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 12:30:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 12:30:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 12:30:21,855 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 12:30:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:21,855 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 12:30:21,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 12:30:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 12:30:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:30:21,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:21,855 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-04 12:30:21,856 INFO L423 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:21,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:21,856 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-04 12:30:21,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:21,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:21,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:21,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:21,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:23,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:23,111 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) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:30:23,120 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:30:23,141 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 12:30:23,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:23,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:23,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:23,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 12:30:23,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:30:23,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:30:23,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:30:23,180 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-10-04 12:30:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:24,410 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 12:30:24,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:30:24,411 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-10-04 12:30:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:24,411 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:30:24,412 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 12:30:24,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:30:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 12:30:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 12:30:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 12:30:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 12:30:24,417 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 12:30:24,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:24,417 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 12:30:24,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:30:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 12:30:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 12:30:24,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:24,418 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-04 12:30:24,418 INFO L423 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:24,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-04 12:30:24,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:24,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:24,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:25,793 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-04 12:30:25,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:25,794 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-04 12:30:25,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:30:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:25,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:25,824 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-04 12:30:25,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:25,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 12:30:25,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 12:30:25,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 12:30:25,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:30:25,847 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-10-04 12:30:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:27,079 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-04 12:30:27,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 12:30:27,079 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-10-04 12:30:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:27,080 INFO L225 Difference]: With dead ends: 48 [2018-10-04 12:30:27,080 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:30:27,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:30:27,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:30:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 12:30:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 12:30:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 12:30:27,084 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-04 12:30:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:27,085 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 12:30:27,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 12:30:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 12:30:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 12:30:27,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:27,085 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-04 12:30:27,086 INFO L423 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:27,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:27,086 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-04 12:30:27,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:27,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:27,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:30:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:28,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:28,925 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-04 12:30:28,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:30:28,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:30:28,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:28,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:28,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:28,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 12:30:28,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 12:30:28,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 12:30:28,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 12:30:28,990 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-10-04 12:30:30,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:30,276 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-04 12:30:30,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:30:30,277 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-10-04 12:30:30,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:30,277 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:30:30,277 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 12:30:30,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 12:30:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 12:30:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-04 12:30:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 12:30:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-04 12:30:30,282 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-10-04 12:30:30,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:30,282 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-04 12:30:30,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 12:30:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-04 12:30:30,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 12:30:30,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:30,283 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-10-04 12:30:30,283 INFO L423 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:30,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:30,283 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-10-04 12:30:30,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:30,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:30,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:31,496 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-04 12:30:31,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:31,496 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-04 12:30:31,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:30:31,526 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-04 12:30:31,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:31,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:31,564 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-04 12:30:31,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:31,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 12:30:31,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 12:30:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 12:30:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:30:31,584 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-10-04 12:30:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:32,925 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-04 12:30:32,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:30:32,926 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-10-04 12:30:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:32,926 INFO L225 Difference]: With dead ends: 50 [2018-10-04 12:30:32,927 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:30:32,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:30:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:30:32,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-04 12:30:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 12:30:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 12:30:32,932 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-10-04 12:30:32,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:32,932 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 12:30:32,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 12:30:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 12:30:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 12:30:32,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:32,933 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-10-04 12:30:32,933 INFO L423 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:32,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:32,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-10-04 12:30:32,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:32,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:32,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:32,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:32,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:34,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:34,381 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-04 12:30:34,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:30:34,403 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:30:34,404 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:34,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:34,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:34,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 12:30:34,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 12:30:34,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 12:30:34,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 12:30:34,439 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-10-04 12:30:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:35,822 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 12:30:35,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:30:35,822 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-10-04 12:30:35,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:35,823 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:30:35,823 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 12:30:35,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 12:30:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 12:30:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 12:30:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 12:30:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-04 12:30:35,827 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-10-04 12:30:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:35,828 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-04 12:30:35,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 12:30:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-04 12:30:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 12:30:35,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:35,829 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-10-04 12:30:35,829 INFO L423 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:35,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:35,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-10-04 12:30:35,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:35,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:35,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:35,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:35,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:37,165 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-04 12:30:37,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:37,165 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-04 12:30:37,173 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:30:37,195 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 12:30:37,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:37,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:37,210 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-04 12:30:37,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:37,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 12:30:37,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 12:30:37,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 12:30:37,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:30:37,240 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-10-04 12:30:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:39,044 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-04 12:30:39,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 12:30:39,045 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-10-04 12:30:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:39,046 INFO L225 Difference]: With dead ends: 52 [2018-10-04 12:30:39,046 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:30:39,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:30:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:30:39,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 12:30:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 12:30:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 12:30:39,049 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-10-04 12:30:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:39,049 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 12:30:39,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 12:30:39,050 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 12:30:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 12:30:39,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:39,050 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-10-04 12:30:39,050 INFO L423 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:39,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:39,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-10-04 12:30:39,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:39,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:39,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:39,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:39,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:40,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:40,505 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-04 12:30:40,512 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:30:40,536 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 12:30:40,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:40,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:40,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:40,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 12:30:40,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 12:30:40,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 12:30:40,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 12:30:40,576 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-10-04 12:30:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:42,088 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-04 12:30:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:30:42,095 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-10-04 12:30:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:42,095 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:30:42,095 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 12:30:42,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 12:30:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 12:30:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-04 12:30:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 12:30:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-04 12:30:42,100 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-10-04 12:30:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:42,100 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-04 12:30:42,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 12:30:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-04 12:30:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 12:30:42,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:42,101 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-10-04 12:30:42,101 INFO L423 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:42,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-10-04 12:30:42,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:42,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:42,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:43,769 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-04 12:30:43,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:43,769 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-04 12:30:43,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:30:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:43,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:43,839 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-04 12:30:43,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:43,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 12:30:43,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:30:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:30:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:30:43,860 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-10-04 12:30:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:45,440 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-04 12:30:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:30:45,440 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-10-04 12:30:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:45,441 INFO L225 Difference]: With dead ends: 54 [2018-10-04 12:30:45,441 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:30:45,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:30:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:30:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 12:30:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:30:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 12:30:45,447 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-10-04 12:30:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:45,447 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 12:30:45,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:30:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 12:30:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 12:30:45,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:45,448 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-10-04 12:30:45,448 INFO L423 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:45,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-10-04 12:30:45,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:45,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:45,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:45,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:30:45,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:46,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:46,847 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-04 12:30:46,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:30:46,872 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:30:46,873 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:46,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:46,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:46,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 12:30:46,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:30:46,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:30:46,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 12:30:46,908 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-10-04 12:30:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:48,758 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 12:30:48,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:30:48,759 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-10-04 12:30:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:48,759 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:30:48,760 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 12:30:48,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 12:30:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 12:30:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-04 12:30:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 12:30:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-04 12:30:48,764 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-10-04 12:30:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:48,764 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-04 12:30:48,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:30:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-04 12:30:48,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 12:30:48,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:48,765 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-10-04 12:30:48,765 INFO L423 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:48,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:48,765 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-10-04 12:30:48,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:48,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:48,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:48,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:48,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:50,173 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-04 12:30:50,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:50,173 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-04 12:30:50,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:30:50,206 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-04 12:30:50,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:50,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:50,220 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-04 12:30:50,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:50,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 12:30:50,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 12:30:50,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 12:30:50,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:30:50,242 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-10-04 12:30:51,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:51,981 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-04 12:30:51,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 12:30:51,982 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-10-04 12:30:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:51,982 INFO L225 Difference]: With dead ends: 56 [2018-10-04 12:30:51,983 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:30:51,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:30:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:30:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 12:30:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 12:30:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-04 12:30:51,987 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-10-04 12:30:51,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:51,988 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-04 12:30:51,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 12:30:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-04 12:30:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 12:30:51,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:51,988 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-10-04 12:30:51,989 INFO L423 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:51,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-10-04 12:30:51,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:51,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:53,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:53,383 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-04 12:30:53,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:30:53,406 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:30:53,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:53,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:53,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:53,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 12:30:53,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 12:30:53,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 12:30:53,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 12:30:53,463 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-10-04 12:30:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:55,421 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-04 12:30:55,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:30:55,421 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-10-04 12:30:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:55,422 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:30:55,422 INFO L226 Difference]: Without dead ends: 56 [2018-10-04 12:30:55,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 12:30:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-04 12:30:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-04 12:30:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 12:30:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-04 12:30:55,428 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-10-04 12:30:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:55,428 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-04 12:30:55,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 12:30:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-04 12:30:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-04 12:30:55,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:55,429 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-10-04 12:30:55,429 INFO L423 AbstractCegarLoop]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:55,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:55,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-10-04 12:30:55,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:55,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:55,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:55,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:55,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:56,921 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-04 12:30:56,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:56,922 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-04 12:30:56,929 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:30:56,960 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-10-04 12:30:56,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:56,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:56,976 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-04 12:30:56,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:56,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 12:30:56,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 12:30:56,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 12:30:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:30:56,997 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-10-04 12:30:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:58,944 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-04 12:30:58,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:30:58,945 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-10-04 12:30:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:58,946 INFO L225 Difference]: With dead ends: 58 [2018-10-04 12:30:58,946 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:30:58,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:30:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:30:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 12:30:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:30:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 12:30:58,951 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-10-04 12:30:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:58,951 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 12:30:58,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 12:30:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 12:30:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 12:30:58,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:58,952 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-10-04 12:30:58,952 INFO L423 AbstractCegarLoop]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:58,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-10-04 12:30:58,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:58,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:58,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:58,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:00,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:00,729 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-04 12:31:00,735 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:31:00,763 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-04 12:31:00,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:00,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:00,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:00,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 12:31:00,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 12:31:00,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 12:31:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 12:31:00,798 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-10-04 12:31:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:02,689 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 12:31:02,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 12:31:02,689 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-10-04 12:31:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:02,690 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:31:02,690 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 12:31:02,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 12:31:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 12:31:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-04 12:31:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-04 12:31:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-04 12:31:02,694 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-10-04 12:31:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:02,695 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-04 12:31:02,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 12:31:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-04 12:31:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 12:31:02,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:02,695 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-10-04 12:31:02,695 INFO L423 AbstractCegarLoop]: === Iteration 56 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:02,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:02,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-10-04 12:31:02,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:02,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:02,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:02,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:02,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:04,643 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-04 12:31:04,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:04,644 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-04 12:31:04,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:31:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:04,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:04,686 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-04 12:31:04,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:04,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 12:31:04,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 12:31:04,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 12:31:04,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:31:04,707 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-10-04 12:31:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:06,670 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-04 12:31:06,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 12:31:06,671 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-10-04 12:31:06,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:06,672 INFO L225 Difference]: With dead ends: 60 [2018-10-04 12:31:06,672 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:31:06,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:31:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:31:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 12:31:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 12:31:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-04 12:31:06,677 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-10-04 12:31:06,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:06,677 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-04 12:31:06,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 12:31:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-04 12:31:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 12:31:06,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:06,678 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-10-04 12:31:06,678 INFO L423 AbstractCegarLoop]: === Iteration 57 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:06,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:06,678 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-10-04 12:31:06,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:06,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:06,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:06,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:31:06,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:08,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:08,375 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-04 12:31:08,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:31:08,401 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:31:08,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:08,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:08,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:08,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 12:31:08,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 12:31:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 12:31:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 12:31:08,436 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-10-04 12:31:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:10,664 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 12:31:10,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 12:31:10,664 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-10-04 12:31:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:10,665 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:31:10,665 INFO L226 Difference]: Without dead ends: 60 [2018-10-04 12:31:10,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 12:31:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-04 12:31:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-10-04 12:31:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-04 12:31:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-04 12:31:10,670 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-10-04 12:31:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:10,671 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-04 12:31:10,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 12:31:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-04 12:31:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-04 12:31:10,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:10,671 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-10-04 12:31:10,672 INFO L423 AbstractCegarLoop]: === Iteration 58 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:10,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:10,672 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-10-04 12:31:10,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:10,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:10,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:10,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:10,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:12,319 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-04 12:31:12,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:12,319 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-04 12:31:12,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:31:12,363 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-10-04 12:31:12,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:12,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:12,378 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-04 12:31:12,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:12,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 12:31:12,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 12:31:12,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 12:31:12,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:31:12,401 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-10-04 12:31:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:14,720 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-04 12:31:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 12:31:14,721 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-10-04 12:31:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:14,722 INFO L225 Difference]: With dead ends: 62 [2018-10-04 12:31:14,722 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 12:31:14,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:31:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 12:31:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 12:31:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 12:31:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 12:31:14,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-10-04 12:31:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:14,728 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 12:31:14,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 12:31:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 12:31:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 12:31:14,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:14,729 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-10-04 12:31:14,729 INFO L423 AbstractCegarLoop]: === Iteration 59 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:14,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:14,730 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-10-04 12:31:14,730 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:14,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:14,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:14,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:14,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:16,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:16,637 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:31:16,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:31:16,661 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:31:16,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:16,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:16,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:16,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 12:31:16,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 12:31:16,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 12:31:16,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 12:31:16,698 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-10-04 12:31:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:18,887 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 12:31:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 12:31:18,888 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-10-04 12:31:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:18,889 INFO L225 Difference]: With dead ends: 63 [2018-10-04 12:31:18,889 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 12:31:18,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 12:31:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 12:31:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-10-04 12:31:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 12:31:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-04 12:31:18,893 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-10-04 12:31:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:18,893 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-04 12:31:18,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 12:31:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-04 12:31:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 12:31:18,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:18,894 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-10-04 12:31:18,894 INFO L423 AbstractCegarLoop]: === Iteration 60 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:18,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-10-04 12:31:18,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:18,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:18,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:18,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:18,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:20,917 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-04 12:31:20,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:20,918 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:31:20,925 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:31:20,955 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-04 12:31:20,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:20,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:20,973 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-04 12:31:20,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:20,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-04 12:31:20,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 12:31:20,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 12:31:20,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:31:20,994 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-10-04 12:31:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:23,224 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-04 12:31:23,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 12:31:23,224 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-10-04 12:31:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:23,225 INFO L225 Difference]: With dead ends: 64 [2018-10-04 12:31:23,225 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:31:23,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:31:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:31:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 12:31:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 12:31:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-04 12:31:23,230 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-10-04 12:31:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:23,230 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-04 12:31:23,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 12:31:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-04 12:31:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 12:31:23,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:23,230 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-10-04 12:31:23,231 INFO L423 AbstractCegarLoop]: === Iteration 61 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:23,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:23,231 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-10-04 12:31:23,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:23,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:23,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:23,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:23,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:25,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:25,398 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:31:25,406 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:31:25,437 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 12:31:25,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:25,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:25,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:25,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 12:31:25,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 12:31:25,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 12:31:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 12:31:25,492 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-10-04 12:31:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:28,313 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 12:31:28,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 12:31:28,314 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-10-04 12:31:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:28,314 INFO L225 Difference]: With dead ends: 65 [2018-10-04 12:31:28,315 INFO L226 Difference]: Without dead ends: 64 [2018-10-04 12:31:28,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 12:31:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-04 12:31:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-10-04 12:31:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 12:31:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-04 12:31:28,318 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-10-04 12:31:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:28,318 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-04 12:31:28,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 12:31:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-04 12:31:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 12:31:28,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:28,319 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-10-04 12:31:28,319 INFO L423 AbstractCegarLoop]: === Iteration 62 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:28,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:28,319 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-10-04 12:31:28,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:28,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:28,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:28,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:28,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:30,457 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-04 12:31:30,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:30,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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:31:30,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:31:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:30,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:30,501 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-04 12:31:30,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:30,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-04 12:31:30,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 12:31:30,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 12:31:30,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:31:30,522 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-10-04 12:31:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:32,932 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-04 12:31:32,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 12:31:32,933 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-10-04 12:31:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:32,934 INFO L225 Difference]: With dead ends: 66 [2018-10-04 12:31:32,934 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 12:31:32,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:31:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 12:31:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-04 12:31:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 12:31:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-04 12:31:32,938 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-10-04 12:31:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:32,938 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-04 12:31:32,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 12:31:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-04 12:31:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 12:31:32,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:32,939 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-10-04 12:31:32,940 INFO L423 AbstractCegarLoop]: === Iteration 63 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:32,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:32,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-10-04 12:31:32,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:32,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:32,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:32,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:31:32,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:35,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:35,231 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:31:35,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:31:35,258 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:31:35,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:35,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:35,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:35,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 12:31:35,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 12:31:35,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 12:31:35,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 12:31:35,307 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-10-04 12:31:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:37,851 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-04 12:31:37,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 12:31:37,851 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-10-04 12:31:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:37,852 INFO L225 Difference]: With dead ends: 67 [2018-10-04 12:31:37,852 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 12:31:37,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 12:31:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 12:31:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-04 12:31:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 12:31:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-04 12:31:37,857 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-10-04 12:31:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:37,857 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-04 12:31:37,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 12:31:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-04 12:31:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 12:31:37,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:37,858 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-10-04 12:31:37,858 INFO L423 AbstractCegarLoop]: === Iteration 64 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:37,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:37,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-10-04 12:31:37,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:37,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:37,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:37,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:40,179 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-04 12:31:40,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:40,179 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:31:40,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:31:40,220 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-10-04 12:31:40,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:40,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:40,239 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-04 12:31:40,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:40,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-04 12:31:40,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 12:31:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 12:31:40,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:31:40,271 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-10-04 12:31:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:43,157 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-04 12:31:43,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 12:31:43,157 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-10-04 12:31:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:43,158 INFO L225 Difference]: With dead ends: 68 [2018-10-04 12:31:43,159 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 12:31:43,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:31:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 12:31:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-04 12:31:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 12:31:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-04 12:31:43,164 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-10-04 12:31:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:43,164 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-04 12:31:43,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 12:31:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-04 12:31:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:31:43,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:43,165 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-10-04 12:31:43,165 INFO L423 AbstractCegarLoop]: === Iteration 65 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:43,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:43,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-10-04 12:31:43,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:43,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:43,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:43,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:43,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:45,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:45,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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:31:45,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:31:45,484 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:31:45,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:45,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:45,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:45,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 12:31:45,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 12:31:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 12:31:45,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 12:31:45,534 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-10-04 12:31:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:48,289 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-04 12:31:48,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 12:31:48,290 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-10-04 12:31:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:48,291 INFO L225 Difference]: With dead ends: 69 [2018-10-04 12:31:48,291 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 12:31:48,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 12:31:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 12:31:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 12:31:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 12:31:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-04 12:31:48,295 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-10-04 12:31:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:48,295 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-04 12:31:48,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 12:31:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-04 12:31:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 12:31:48,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:48,296 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-10-04 12:31:48,296 INFO L423 AbstractCegarLoop]: === Iteration 66 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:48,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-10-04 12:31:48,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:48,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:48,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:48,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:48,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:50,678 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-04 12:31:50,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:50,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:31:50,689 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:31:50,727 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-10-04 12:31:50,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:50,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:50,744 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-04 12:31:50,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:50,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-04 12:31:50,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 12:31:50,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 12:31:50,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:31:50,765 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-10-04 12:31:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:53,481 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-04 12:31:53,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 12:31:53,481 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-10-04 12:31:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:53,482 INFO L225 Difference]: With dead ends: 70 [2018-10-04 12:31:53,482 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:31:53,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:31:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:31:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-04 12:31:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 12:31:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-04 12:31:53,487 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-10-04 12:31:53,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:53,487 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-04 12:31:53,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 12:31:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-04 12:31:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:31:53,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:53,488 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-10-04 12:31:53,488 INFO L423 AbstractCegarLoop]: === Iteration 67 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:53,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-10-04 12:31:53,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:53,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:53,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:56,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:56,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:31:56,154 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:31:56,187 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-10-04 12:31:56,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:56,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:56,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:56,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 12:31:56,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 12:31:56,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 12:31:56,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 12:31:56,228 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-10-04 12:31:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:59,067 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-04 12:31:59,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 12:31:59,067 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-10-04 12:31:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:59,068 INFO L225 Difference]: With dead ends: 71 [2018-10-04 12:31:59,068 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 12:31:59,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 12:31:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 12:31:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-04 12:31:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-04 12:31:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-04 12:31:59,073 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-10-04 12:31:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:59,074 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-04 12:31:59,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 12:31:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-04 12:31:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-04 12:31:59,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:59,074 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-10-04 12:31:59,075 INFO L423 AbstractCegarLoop]: === Iteration 68 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:59,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:59,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-10-04 12:31:59,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:59,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:59,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:01,561 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-04 12:32:01,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:01,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:01,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:01,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:01,604 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-04 12:32:01,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:01,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-04 12:32:01,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 12:32:01,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 12:32:01,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:32:01,625 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-10-04 12:32:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:04,537 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-04 12:32:04,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 12:32:04,538 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-10-04 12:32:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:04,539 INFO L225 Difference]: With dead ends: 72 [2018-10-04 12:32:04,539 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 12:32:04,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:32:04,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 12:32:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 12:32:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 12:32:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-04 12:32:04,543 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-10-04 12:32:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:04,543 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-04 12:32:04,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 12:32:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-04 12:32:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 12:32:04,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:04,544 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-10-04 12:32:04,544 INFO L423 AbstractCegarLoop]: === Iteration 69 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:04,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:04,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-10-04 12:32:04,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:04,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:04,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:07,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:07,214 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:07,241 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:07,241 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:07,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:07,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:07,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 12:32:07,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 12:32:07,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 12:32:07,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 12:32:07,280 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-10-04 12:32:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:10,246 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-04 12:32:10,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 12:32:10,246 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-10-04 12:32:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:10,247 INFO L225 Difference]: With dead ends: 73 [2018-10-04 12:32:10,247 INFO L226 Difference]: Without dead ends: 72 [2018-10-04 12:32:10,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 12:32:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-04 12:32:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-10-04 12:32:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-04 12:32:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-04 12:32:10,252 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-10-04 12:32:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:10,252 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-04 12:32:10,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 12:32:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-04 12:32:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 12:32:10,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:10,253 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-10-04 12:32:10,253 INFO L423 AbstractCegarLoop]: === Iteration 70 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:10,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-10-04 12:32:10,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:10,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:10,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:10,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:10,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:12,814 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-04 12:32:12,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:12,815 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:12,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:12,860 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-04 12:32:12,860 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:12,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:12,879 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-04 12:32:12,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:12,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-04 12:32:12,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 12:32:12,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 12:32:12,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:32:12,901 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-10-04 12:32:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:16,118 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-04 12:32:16,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 12:32:16,118 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-10-04 12:32:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:16,119 INFO L225 Difference]: With dead ends: 74 [2018-10-04 12:32:16,119 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 12:32:16,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:32:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 12:32:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-04 12:32:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 12:32:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-04 12:32:16,124 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-10-04 12:32:16,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:16,125 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-04 12:32:16,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 12:32:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-04 12:32:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 12:32:16,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:16,125 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-10-04 12:32:16,126 INFO L423 AbstractCegarLoop]: === Iteration 71 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:16,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-10-04 12:32:16,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:16,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:16,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:16,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:16,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:18,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:18,470 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:18,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:18,502 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:18,502 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:18,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:18,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:18,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 12:32:18,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 12:32:18,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 12:32:18,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 12:32:18,541 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-10-04 12:32:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:22,136 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-04 12:32:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 12:32:22,137 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-10-04 12:32:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:22,138 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:32:22,138 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 12:32:22,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 12:32:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 12:32:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 12:32:22,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 12:32:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-04 12:32:22,144 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-10-04 12:32:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:22,144 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-04 12:32:22,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 12:32:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-04 12:32:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 12:32:22,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:22,145 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-10-04 12:32:22,145 INFO L423 AbstractCegarLoop]: === Iteration 72 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:22,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-10-04 12:32:22,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:22,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:22,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:22,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:22,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:24,806 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-04 12:32:24,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:24,807 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:24,814 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:24,957 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-04 12:32:24,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:24,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:25,002 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-04 12:32:25,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:25,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-04 12:32:25,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 12:32:25,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 12:32:25,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:32:25,024 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-10-04 12:32:29,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:29,003 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-04 12:32:29,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 12:32:29,004 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-10-04 12:32:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:29,004 INFO L225 Difference]: With dead ends: 76 [2018-10-04 12:32:29,005 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 12:32:29,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:32:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 12:32:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-04 12:32:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 12:32:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-04 12:32:29,011 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-10-04 12:32:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:29,011 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-04 12:32:29,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 12:32:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-04 12:32:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 12:32:29,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:29,012 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-10-04 12:32:29,012 INFO L423 AbstractCegarLoop]: === Iteration 73 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:29,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-10-04 12:32:29,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:29,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:29,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:33,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:33,344 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:33,352 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:33,808 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 12:32:33,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:33,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:33,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:33,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 12:32:33,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 12:32:33,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 12:32:33,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 12:32:33,921 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-10-04 12:32:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:37,439 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-04 12:32:37,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 12:32:37,439 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-10-04 12:32:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:37,440 INFO L225 Difference]: With dead ends: 77 [2018-10-04 12:32:37,440 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 12:32:37,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 12:32:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 12:32:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 12:32:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 12:32:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-04 12:32:37,446 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-10-04 12:32:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:37,446 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-04 12:32:37,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 12:32:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-04 12:32:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 12:32:37,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:37,447 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-10-04 12:32:37,447 INFO L423 AbstractCegarLoop]: === Iteration 74 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:37,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-10-04 12:32:37,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:37,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:37,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:40,575 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-04 12:32:40,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:40,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:40,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:40,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:40,630 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-04 12:32:40,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:40,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-04 12:32:40,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 12:32:40,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 12:32:40,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:32:40,663 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-10-04 12:32:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:44,312 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-04 12:32:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 12:32:44,312 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-10-04 12:32:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:44,313 INFO L225 Difference]: With dead ends: 78 [2018-10-04 12:32:44,313 INFO L226 Difference]: Without dead ends: 77 [2018-10-04 12:32:44,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:32:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-04 12:32:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-04 12:32:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 12:32:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-04 12:32:44,319 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-10-04 12:32:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:44,319 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-04 12:32:44,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 12:32:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-04 12:32:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 12:32:44,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:44,320 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-10-04 12:32:44,320 INFO L423 AbstractCegarLoop]: === Iteration 75 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:44,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-10-04 12:32:44,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:44,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:44,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:44,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:48,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:48,686 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:48,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:48,718 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:48,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:48,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:48,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:48,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-04 12:32:48,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 12:32:48,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 12:32:48,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 12:32:48,763 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-10-04 12:32:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:52,470 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-04 12:32:52,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 12:32:52,471 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-10-04 12:32:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:52,472 INFO L225 Difference]: With dead ends: 79 [2018-10-04 12:32:52,472 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 12:32:52,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 12:32:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 12:32:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-04 12:32:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 12:32:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-04 12:32:52,477 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-10-04 12:32:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:52,477 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-04 12:32:52,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 12:32:52,477 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-04 12:32:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 12:32:52,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:52,478 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-10-04 12:32:52,478 INFO L423 AbstractCegarLoop]: === Iteration 76 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:52,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:52,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-10-04 12:32:52,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:52,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:52,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:52,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:52,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:55,143 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-04 12:32:55,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:55,143 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:55,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:55,190 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-10-04 12:32:55,190 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:55,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:55,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-04 12:32:55,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:55,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-04 12:32:55,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 12:32:55,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 12:32:55,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:32:55,233 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-10-04 12:32:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:59,019 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-04 12:32:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 12:32:59,019 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-10-04 12:32:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:59,020 INFO L225 Difference]: With dead ends: 80 [2018-10-04 12:32:59,020 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 12:32:59,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:32:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 12:32:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-04 12:32:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 12:32:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-04 12:32:59,025 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-10-04 12:32:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:59,026 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-04 12:32:59,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 12:32:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-04 12:32:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 12:32:59,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:59,026 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-10-04 12:32:59,026 INFO L423 AbstractCegarLoop]: === Iteration 77 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:59,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-10-04 12:32:59,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:59,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:59,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:59,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:59,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:02,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:02,904 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:02,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:02,933 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:02,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:02,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:02,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:02,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-04 12:33:02,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 12:33:02,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 12:33:02,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 12:33:02,989 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-10-04 12:33:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:06,791 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-04 12:33:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 12:33:06,792 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-10-04 12:33:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:06,792 INFO L225 Difference]: With dead ends: 81 [2018-10-04 12:33:06,792 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 12:33:06,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 12:33:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 12:33:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 12:33:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 12:33:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-04 12:33:06,796 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-10-04 12:33:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:06,797 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-04 12:33:06,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 12:33:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-04 12:33:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 12:33:06,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:06,797 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-10-04 12:33:06,797 INFO L423 AbstractCegarLoop]: === Iteration 78 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:06,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:06,798 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-10-04 12:33:06,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:06,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:06,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:06,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:09,730 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-04 12:33:09,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:09,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:09,737 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:09,775 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-10-04 12:33:09,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:09,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:09,849 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-04 12:33:09,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:09,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-04 12:33:09,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 12:33:09,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 12:33:09,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:33:09,878 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-10-04 12:33:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:13,870 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-04 12:33:13,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-04 12:33:13,871 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-10-04 12:33:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:13,872 INFO L225 Difference]: With dead ends: 82 [2018-10-04 12:33:13,872 INFO L226 Difference]: Without dead ends: 81 [2018-10-04 12:33:13,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:33:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-04 12:33:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-04 12:33:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-04 12:33:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-04 12:33:13,877 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-10-04 12:33:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:13,878 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-04 12:33:13,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 12:33:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-04 12:33:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 12:33:13,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:13,879 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-10-04 12:33:13,879 INFO L423 AbstractCegarLoop]: === Iteration 79 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:13,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-10-04 12:33:13,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:13,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:13,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:16,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:16,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:16,791 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:16,847 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2018-10-04 12:33:16,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:16,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:16,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:16,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-04 12:33:16,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 12:33:16,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 12:33:16,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 12:33:16,913 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-10-04 12:33:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:20,976 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-04 12:33:20,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-04 12:33:20,976 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-10-04 12:33:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:20,977 INFO L225 Difference]: With dead ends: 83 [2018-10-04 12:33:20,977 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 12:33:20,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 12:33:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 12:33:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-04 12:33:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 12:33:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-04 12:33:20,981 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-10-04 12:33:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:20,981 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-04 12:33:20,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 12:33:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-04 12:33:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 12:33:20,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:20,982 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-10-04 12:33:20,982 INFO L423 AbstractCegarLoop]: === Iteration 80 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:20,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:20,982 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-10-04 12:33:20,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:20,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:20,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:20,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:20,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:24,198 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-04 12:33:24,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:24,198 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:24,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:24,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:24,307 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-04 12:33:24,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:24,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-04 12:33:24,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 12:33:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 12:33:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:33:24,340 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-10-04 12:33:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:28,528 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-04 12:33:28,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 12:33:28,529 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-10-04 12:33:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:28,530 INFO L225 Difference]: With dead ends: 84 [2018-10-04 12:33:28,530 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 12:33:28,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:33:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 12:33:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 12:33:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 12:33:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-04 12:33:28,537 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-10-04 12:33:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:28,537 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-04 12:33:28,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 12:33:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-04 12:33:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-04 12:33:28,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:28,538 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-10-04 12:33:28,538 INFO L423 AbstractCegarLoop]: === Iteration 81 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:28,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:28,538 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-10-04 12:33:28,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:28,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:28,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:28,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:28,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:31,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:31,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:31,700 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:31,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:31,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:31,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:31,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-04 12:33:31,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 12:33:31,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 12:33:31,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 12:33:31,757 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. Received shutdown request... [2018-10-04 12:33:34,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:33:34,276 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:33:34,282 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:33:34,283 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:33:34 BoogieIcfgContainer [2018-10-04 12:33:34,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:33:34,283 INFO L168 Benchmark]: Toolchain (without parser) took 242320.24 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -130.0 MB). Free memory was 1.5 GB in the beginning and 955.5 MB in the end (delta: 510.2 MB). Peak memory consumption was 380.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:33:34,285 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-04 12:33:34,285 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.10 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-04 12:33:34,285 INFO L168 Benchmark]: Boogie Preprocessor took 19.72 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-04 12:33:34,286 INFO L168 Benchmark]: RCFGBuilder took 245.11 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-04 12:33:34,286 INFO L168 Benchmark]: TraceAbstraction took 242011.13 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -130.0 MB). Free memory was 1.4 GB in the beginning and 955.5 MB in the end (delta: 489.0 MB). Peak memory consumption was 359.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:33:34,288 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.19 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 40.10 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 19.72 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 245.11 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 242011.13 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -130.0 MB). Free memory was 1.4 GB in the beginning and 955.5 MB in the end (delta: 489.0 MB). Peak memory consumption was 359.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (83states) and FLOYD_HOARE automaton (currently 49 states, 83 states before enhancement), while ReachableStatesComputation was computing reachable states (47 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 241.9s OverallTime, 81 OverallIterations, 80 TraceHistogramMax, 121.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 162 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 184168 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6641 GetRequests, 3240 SyntacticMatches, 80 SemanticMatches, 3321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 111.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=80, 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.3s AutomataMinimizationTime, 80 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 114.3s InterpolantComputationTime, 6802 NumberOfCodeBlocks, 6802 NumberOfCodeBlocksAsserted, 981 NumberOfCheckSat, 6641 ConstructedInterpolants, 0 QuantifiedInterpolants, 2526167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6880 ConjunctsInSsa, 6720 ConjunctsInUnsatCore, 161 InterpolantComputations, 1 PerfectInterpolantSequences, 0/177120 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/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-33-34-300.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-33-34-300.csv Completed graceful shutdown