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-133090d [2018-10-04 09:23:43,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:23:43,831 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:23:43,842 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:23:43,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:23:43,844 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:23:43,845 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:23:43,847 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:23:43,849 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:23:43,849 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:23:43,850 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:23:43,850 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:23:43,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:23:43,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:23:43,856 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:23:43,860 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:23:43,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:23:43,862 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:23:43,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:23:43,868 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:23:43,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:23:43,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:23:43,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:23:43,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:23:43,874 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:23:43,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:23:43,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:23:43,876 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:23:43,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:23:43,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:23:43,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:23:43,881 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:23:43,881 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:23:43,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:23:43,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:23:43,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:23:43,884 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 09:23:43,900 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:23:43,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:23:43,901 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:23:43,901 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:23:43,902 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:23:43,902 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:23:43,902 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:23:43,903 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:23:43,903 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:23:43,903 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:23:43,903 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:23:43,903 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:23:43,903 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:23:43,904 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:23:43,904 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:23:43,904 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:23:43,904 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:23:43,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:23:43,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:23:43,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:23:43,905 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:23:43,905 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:23:43,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:23:43,906 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:23:43,906 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:23:43,906 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:23:43,906 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:23:43,907 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:23:43,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:23:43,907 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:23:43,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:23:43,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:23:43,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:23:43,991 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:23:43,995 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:23:43,995 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 09:23:43,996 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl' [2018-10-04 09:23:44,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:23:44,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:23:44,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:23:44,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:23:44,051 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:23:44,074 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 09:23:44" (1/1) ... [2018-10-04 09:23:44,086 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 09:23:44" (1/1) ... [2018-10-04 09:23:44,091 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:23:44,091 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:23:44,091 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:23:44,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:23:44,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:23:44,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:23:44,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:23:44,106 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 09:23:44" (1/1) ... [2018-10-04 09:23:44,106 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 09:23:44" (1/1) ... [2018-10-04 09:23:44,107 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 09:23:44" (1/1) ... [2018-10-04 09:23:44,107 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 09:23:44" (1/1) ... [2018-10-04 09:23:44,111 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 09:23:44" (1/1) ... [2018-10-04 09:23:44,114 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 09:23:44" (1/1) ... [2018-10-04 09:23:44,117 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 09:23:44" (1/1) ... [2018-10-04 09:23:44,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:23:44,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:23:44,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:23:44,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:23:44,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:23:44" (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 09:23:44,188 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-10-04 09:23:44,189 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-10-04 09:23:44,350 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:23:44,351 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:23:44 BoogieIcfgContainer [2018-10-04 09:23:44,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:23:44,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:23:44,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:23:44,355 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:23:44,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:23:44" (1/2) ... [2018-10-04 09:23:44,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c07cadc and model type DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:23:44, skipping insertion in model container [2018-10-04 09:23:44,357 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 09:23:44" (2/2) ... [2018-10-04 09:23:44,359 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-10-04 09:23:44,368 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:23:44,376 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:23:44,423 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:23:44,424 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:23:44,424 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:23:44,424 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:23:44,425 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:23:44,425 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:23:44,425 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:23:44,425 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:23:44,425 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:23:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-04 09:23:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-04 09:23:44,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:44,446 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-04 09:23:44,448 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:44,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:44,454 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-04 09:23:44,457 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:44,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:44,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:44,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:44,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:44,625 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 09:23:44,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:23:44,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 09:23:44,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:23:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:23:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:23:44,648 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-04 09:23:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:44,692 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 09:23:44,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:23:44,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-04 09:23:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:44,707 INFO L225 Difference]: With dead ends: 9 [2018-10-04 09:23:44,708 INFO L226 Difference]: Without dead ends: 4 [2018-10-04 09:23:44,712 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 09:23:44,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-04 09:23:44,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-04 09:23:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-04 09:23:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-04 09:23:44,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-04 09:23:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:44,756 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-04 09:23:44,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:23:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-04 09:23:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 09:23:44,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:44,757 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 09:23:44,757 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:44,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:44,758 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-04 09:23:44,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:44,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:44,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:44,948 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 09:23:44,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:44,949 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 09:23:44,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:44,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:45,005 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 09:23:45,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:45,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-10-04 09:23:45,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:23:45,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:23:45,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:23:45,028 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-10-04 09:23:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:45,065 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-04 09:23:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:23:45,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-10-04 09:23:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:45,068 INFO L225 Difference]: With dead ends: 6 [2018-10-04 09:23:45,069 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 09:23:45,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:23:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 09:23:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 09:23:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 09:23:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 09:23:45,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 09:23:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:45,077 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 09:23:45,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:23:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 09:23:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 09:23:45,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:45,078 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-04 09:23:45,079 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:45,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-04 09:23:45,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:45,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:45,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:45,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:45,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:45,181 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 09:23:45,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:45,182 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 09:23:45,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:23:45,198 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:23:45,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:45,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:45,228 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 09:23:45,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:45,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 09:23:45,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:23:45,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:23:45,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:23:45,251 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-10-04 09:23:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:45,325 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-04 09:23:45,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:23:45,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-04 09:23:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:45,326 INFO L225 Difference]: With dead ends: 7 [2018-10-04 09:23:45,326 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 09:23:45,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:23:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 09:23:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 09:23:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 09:23:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 09:23:45,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 09:23:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:45,330 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 09:23:45,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:23:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 09:23:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:23:45,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:45,331 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-04 09:23:45,331 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:45,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:45,332 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-04 09:23:45,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:45,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:45,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:45,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:45,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:45,506 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 09:23:45,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:45,506 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 09:23:45,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:23:45,573 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 09:23:45,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:45,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:45,636 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 09:23:45,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:45,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:23:45,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:23:45,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:23:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:23:45,671 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-10-04 09:23:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:45,811 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 09:23:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:23:45,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-04 09:23:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:45,812 INFO L225 Difference]: With dead ends: 8 [2018-10-04 09:23:45,812 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:23:45,813 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 09:23:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:23:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 09:23:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 09:23:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 09:23:45,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 09:23:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:45,816 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 09:23:45,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:23:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 09:23:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:23:45,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:45,817 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-04 09:23:45,817 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:45,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:45,817 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-04 09:23:45,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:45,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:45,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:45,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:45,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:45,931 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 09:23:45,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:45,931 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 09:23:45,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:23:45,959 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:23:45,959 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:45,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:45,973 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 09:23:45,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:45,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:23:45,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:23:45,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:23:45,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:23:45,994 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-10-04 09:23:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:46,144 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 09:23:46,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:23:46,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-04 09:23:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:46,145 INFO L225 Difference]: With dead ends: 9 [2018-10-04 09:23:46,145 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 09:23:46,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:23:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 09:23:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 09:23:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 09:23:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 09:23:46,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 09:23:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:46,150 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 09:23:46,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:23:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 09:23:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:23:46,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:46,151 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-04 09:23:46,151 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:46,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-04 09:23:46,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:46,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:46,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:46,299 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 09:23:46,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:46,300 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 09:23:46,309 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:23:46,316 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 09:23:46,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:46,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:46,326 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 09:23:46,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:46,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:23:46,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:23:46,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:23:46,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:23:46,348 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-10-04 09:23:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:46,456 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 09:23:46,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:23:46,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-04 09:23:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:46,457 INFO L225 Difference]: With dead ends: 10 [2018-10-04 09:23:46,457 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 09:23:46,458 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 09:23:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 09:23:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 09:23:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:23:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 09:23:46,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 09:23:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:46,462 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 09:23:46,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:23:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 09:23:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:23:46,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:46,463 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-04 09:23:46,464 INFO L423 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:46,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:46,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-04 09:23:46,464 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:46,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:46,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:46,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:46,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:46,646 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 09:23:46,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:46,647 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 09:23:46,657 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:23:46,665 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 09:23:46,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:46,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:46,680 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 09:23:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:46,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:23:46,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:23:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:23:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:23:46,702 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-10-04 09:23:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:47,101 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 09:23:47,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:23:47,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-10-04 09:23:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:47,103 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:23:47,103 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 09:23:47,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:23:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 09:23:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 09:23:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 09:23:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 09:23:47,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 09:23:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:47,108 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 09:23:47,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:23:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 09:23:47,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:23:47,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:47,109 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-04 09:23:47,109 INFO L423 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:47,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:47,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-04 09:23:47,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:47,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:47,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:47,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:47,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:47,284 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 09:23:47,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:47,284 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 09:23:47,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:47,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:47,308 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 09:23:47,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:47,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:23:47,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:23:47,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:23:47,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-04 09:23:47,330 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-10-04 09:23:47,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:47,476 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 09:23:47,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:23:47,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-10-04 09:23:47,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:47,477 INFO L225 Difference]: With dead ends: 12 [2018-10-04 09:23:47,477 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 09:23:47,478 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 09:23:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 09:23:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 09:23:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 09:23:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 09:23:47,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 09:23:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:47,482 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 09:23:47,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:23:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 09:23:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:23:47,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:47,483 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-04 09:23:47,483 INFO L423 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:47,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-04 09:23:47,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:47,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:47,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:47,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:47,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:47,773 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 09:23:47,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:47,773 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 09:23:47,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:23:47,814 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:23:47,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:47,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:47,826 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 09:23:47,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:47,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:23:47,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:23:47,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:23:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:23:47,849 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-10-04 09:23:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:47,960 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 09:23:47,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:23:47,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-10-04 09:23:47,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:47,961 INFO L225 Difference]: With dead ends: 13 [2018-10-04 09:23:47,961 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 09:23:47,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-04 09:23:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 09:23:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 09:23:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:23:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 09:23:47,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 09:23:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:47,969 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 09:23:47,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:23:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 09:23:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:23:47,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:47,970 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-04 09:23:47,971 INFO L423 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:47,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-04 09:23:47,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:47,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:47,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:47,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:48,154 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 09:23:48,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:48,155 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 09:23:48,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:23:48,190 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 09:23:48,190 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:48,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:48,205 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 09:23:48,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:48,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:23:48,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 09:23:48,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 09:23:48,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-04 09:23:48,231 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-10-04 09:23:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:48,358 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 09:23:48,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:23:48,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-04 09:23:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:48,359 INFO L225 Difference]: With dead ends: 14 [2018-10-04 09:23:48,359 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 09:23:48,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-04 09:23:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 09:23:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 09:23:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 09:23:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 09:23:48,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-04 09:23:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:48,363 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 09:23:48,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 09:23:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 09:23:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:23:48,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:48,364 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-04 09:23:48,364 INFO L423 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:48,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-04 09:23:48,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:48,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:48,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:48,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:48,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:48,577 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 09:23:48,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:48,578 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 09:23:48,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:23:48,605 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:23:48,605 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:48,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:48,629 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 09:23:48,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:48,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 09:23:48,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 09:23:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 09:23:48,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-04 09:23:48,651 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-10-04 09:23:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:48,775 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 09:23:48,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:23:48,776 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-04 09:23:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:48,778 INFO L225 Difference]: With dead ends: 15 [2018-10-04 09:23:48,778 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 09:23:48,779 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 09:23:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 09:23:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 09:23:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:23:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-04 09:23:48,784 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-04 09:23:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:48,784 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-04 09:23:48,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 09:23:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-04 09:23:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:23:48,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:48,785 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-04 09:23:48,786 INFO L423 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:48,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:48,786 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-04 09:23:48,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:48,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:48,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:48,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:48,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:49,002 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 09:23:49,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:49,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 09:23:49,018 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:23:49,032 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:23:49,032 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:49,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:49,045 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 09:23:49,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:49,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 09:23:49,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 09:23:49,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 09:23:49,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-04 09:23:49,067 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-10-04 09:23:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:49,307 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-04 09:23:49,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:23:49,308 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 09:23:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:49,309 INFO L225 Difference]: With dead ends: 16 [2018-10-04 09:23:49,309 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 09:23:49,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-04 09:23:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 09:23:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-04 09:23:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 09:23:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-04 09:23:49,313 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-04 09:23:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:49,313 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-04 09:23:49,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 09:23:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-04 09:23:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:23:49,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:49,314 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-04 09:23:49,315 INFO L423 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:49,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:49,315 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-04 09:23:49,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:49,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:49,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:49,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:49,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:49,584 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 09:23:49,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:49,585 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 09:23:49,592 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:23:49,603 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:23:49,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:49,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:49,622 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 09:23:49,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:49,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 09:23:49,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 09:23:49,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 09:23:49,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-04 09:23:49,646 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-10-04 09:23:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:49,860 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-04 09:23:49,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:23:49,860 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-04 09:23:49,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:49,861 INFO L225 Difference]: With dead ends: 17 [2018-10-04 09:23:49,862 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 09:23:49,862 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 09:23:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 09:23:49,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 09:23:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:23:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 09:23:49,867 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-04 09:23:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:49,867 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 09:23:49,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 09:23:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 09:23:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:23:49,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:49,868 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-04 09:23:49,868 INFO L423 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:49,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-04 09:23:49,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:49,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:49,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:50,122 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 09:23:50,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:50,123 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:23:50,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:50,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:50,154 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 09:23:50,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:50,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 09:23:50,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 09:23:50,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 09:23:50,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-04 09:23:50,176 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-10-04 09:23:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:50,432 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-04 09:23:50,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:23:50,432 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-04 09:23:50,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:50,433 INFO L225 Difference]: With dead ends: 18 [2018-10-04 09:23:50,433 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 09:23:50,434 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 09:23:50,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 09:23:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 09:23:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 09:23:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 09:23:50,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-04 09:23:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:50,439 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 09:23:50,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 09:23:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 09:23:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:23:50,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:50,440 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-04 09:23:50,440 INFO L423 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:50,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-04 09:23:50,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:50,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:50,735 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 09:23:50,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:50,736 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 09:23:50,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:23:50,759 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:23:50,760 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:50,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:50,783 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 09:23:50,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:50,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 09:23:50,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:23:50,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:23:50,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-04 09:23:50,815 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-10-04 09:23:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:51,255 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 09:23:51,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:23:51,255 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 09:23:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:51,256 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:23:51,256 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 09:23:51,257 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 09:23:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 09:23:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-04 09:23:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:23:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-04 09:23:51,262 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-04 09:23:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:51,262 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-04 09:23:51,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:23:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-04 09:23:51,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:23:51,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:51,263 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-04 09:23:51,263 INFO L423 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:51,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:51,264 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-04 09:23:51,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:51,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:51,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:51,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:51,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:51,554 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 09:23:51,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:51,555 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 09:23:51,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:23:51,583 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:23:51,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:51,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:51,601 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 09:23:51,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:51,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 09:23:51,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 09:23:51,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 09:23:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-04 09:23:51,624 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-10-04 09:23:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:51,826 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 09:23:51,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:23:51,827 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-10-04 09:23:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:51,827 INFO L225 Difference]: With dead ends: 20 [2018-10-04 09:23:51,828 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 09:23:51,829 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 09:23:51,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 09:23:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-04 09:23:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 09:23:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-04 09:23:51,833 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-04 09:23:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:51,834 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-04 09:23:51,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 09:23:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-04 09:23:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:23:51,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:51,834 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-04 09:23:51,835 INFO L423 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:51,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-04 09:23:51,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:51,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:51,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:51,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:51,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:52,150 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 09:23:52,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:52,150 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 09:23:52,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:23:52,164 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:23:52,164 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:52,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:52,178 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 09:23:52,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:52,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 09:23:52,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 09:23:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 09:23:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-04 09:23:52,208 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-10-04 09:23:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:52,501 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 09:23:52,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 09:23:52,501 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-04 09:23:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:52,502 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:23:52,502 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 09:23:52,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-04 09:23:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 09:23:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 09:23:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:23:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-04 09:23:52,509 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-04 09:23:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:52,509 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-04 09:23:52,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 09:23:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-04 09:23:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:23:52,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:52,510 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-04 09:23:52,510 INFO L423 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:52,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-04 09:23:52,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:52,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:52,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:52,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:52,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:53,035 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 09:23:53,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:53,035 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 09:23:53,043 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:23:53,052 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 09:23:53,052 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:53,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:53,062 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 09:23:53,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:53,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 09:23:53,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 09:23:53,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 09:23:53,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-04 09:23:53,091 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-10-04 09:23:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:53,390 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-04 09:23:53,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 09:23:53,390 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-10-04 09:23:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:53,391 INFO L225 Difference]: With dead ends: 22 [2018-10-04 09:23:53,391 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:23:53,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-04 09:23:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:23:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 09:23:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 09:23:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 09:23:53,397 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-04 09:23:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:53,398 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 09:23:53,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 09:23:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 09:23:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:23:53,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:53,399 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-04 09:23:53,399 INFO L423 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:53,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:53,399 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-04 09:23:53,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:53,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:53,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:53,783 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 09:23:53,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:53,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 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 09:23:53,793 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:23:53,842 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 09:23:53,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:53,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:53,855 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 09:23:53,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:53,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 09:23:53,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 09:23:53,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 09:23:53,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-04 09:23:53,878 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-10-04 09:23:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:54,192 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 09:23:54,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:23:54,193 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-10-04 09:23:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:54,194 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:23:54,194 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 09:23:54,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-04 09:23:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 09:23:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 09:23:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:23:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 09:23:54,199 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-04 09:23:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:54,199 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 09:23:54,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 09:23:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 09:23:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 09:23:54,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:54,200 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-04 09:23:54,201 INFO L423 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:54,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-04 09:23:54,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:54,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:54,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:54,704 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 09:23:54,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:54,705 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 09:23:54,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:54,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:54,757 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 09:23:54,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:54,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 09:23:54,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 09:23:54,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 09:23:54,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-04 09:23:54,786 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-10-04 09:23:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:55,127 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-04 09:23:55,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:23:55,127 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-10-04 09:23:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:55,128 INFO L225 Difference]: With dead ends: 24 [2018-10-04 09:23:55,129 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:23:55,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-04 09:23:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:23:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 09:23:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 09:23:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-04 09:23:55,135 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-04 09:23:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:55,135 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-04 09:23:55,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 09:23:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-04 09:23:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 09:23:55,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:55,136 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-04 09:23:55,136 INFO L423 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:55,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:55,137 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-04 09:23:55,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:55,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:55,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:55,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:55,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:55,771 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 09:23:55,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:55,771 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:23:55,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:23:55,789 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:23:55,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:55,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:55,799 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 09:23:55,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:55,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 09:23:55,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 09:23:55,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 09:23:55,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-04 09:23:55,831 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-10-04 09:23:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:56,225 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 09:23:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:23:56,225 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-10-04 09:23:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:56,226 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:23:56,226 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 09:23:56,227 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 09:23:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 09:23:56,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 09:23:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:23:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-04 09:23:56,232 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-04 09:23:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:56,233 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-04 09:23:56,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 09:23:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-04 09:23:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 09:23:56,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:56,234 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-04 09:23:56,234 INFO L423 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:56,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-04 09:23:56,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:56,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:56,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:56,774 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 09:23:56,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:56,775 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 09:23:56,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:23:56,797 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 09:23:56,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:56,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:56,819 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 09:23:56,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:56,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 09:23:56,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 09:23:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 09:23:56,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-04 09:23:56,846 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-10-04 09:23:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:57,251 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 09:23:57,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:23:57,254 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-10-04 09:23:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:57,255 INFO L225 Difference]: With dead ends: 26 [2018-10-04 09:23:57,255 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:23:57,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-04 09:23:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:23:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 09:23:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 09:23:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 09:23:57,260 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-04 09:23:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:57,260 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 09:23:57,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 09:23:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 09:23:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 09:23:57,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:57,261 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-04 09:23:57,261 INFO L423 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:57,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-04 09:23:57,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:57,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:57,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:57,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:57,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:57,780 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 09:23:57,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:57,780 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 09:23:57,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:23:57,797 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:23:57,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:57,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:57,808 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 09:23:57,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:57,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 09:23:57,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 09:23:57,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 09:23:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-04 09:23:57,837 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-10-04 09:23:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:58,288 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 09:23:58,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 09:23:58,288 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-10-04 09:23:58,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:58,289 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:23:58,289 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 09:23:58,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-04 09:23:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 09:23:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 09:23:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:23:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 09:23:58,296 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-04 09:23:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:58,296 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 09:23:58,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 09:23:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 09:23:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 09:23:58,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:58,297 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-04 09:23:58,297 INFO L423 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:58,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:58,297 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-04 09:23:58,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:58,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:58,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:58,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:58,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:58,754 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 09:23:58,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:58,755 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 09:23:58,764 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:23:58,777 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 09:23:58,778 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:58,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:58,789 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 09:23:58,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:58,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 09:23:58,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 09:23:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 09:23:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-04 09:23:58,822 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-10-04 09:23:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:59,756 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-04 09:23:59,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 09:23:59,757 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-10-04 09:23:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:59,758 INFO L225 Difference]: With dead ends: 28 [2018-10-04 09:23:59,758 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:23:59,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-04 09:23:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:23:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 09:23:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 09:23:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 09:23:59,762 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-04 09:23:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:59,762 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 09:23:59,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 09:23:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 09:23:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:23:59,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:59,763 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-04 09:23:59,763 INFO L423 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:59,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-04 09:23:59,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:59,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:59,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:59,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:59,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:00,249 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 09:24:00,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:00,249 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 09:24:00,258 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:24:00,272 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 09:24:00,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:00,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:00,282 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 09:24:00,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:00,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 09:24:00,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 09:24:00,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 09:24:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-04 09:24:00,303 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-10-04 09:24:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:00,790 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-04 09:24:00,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 09:24:00,791 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-10-04 09:24:00,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:00,791 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:24:00,791 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 09:24:00,792 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 09:24:00,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 09:24:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-04 09:24:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:24:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-04 09:24:00,798 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-04 09:24:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:00,798 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-04 09:24:00,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 09:24:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-04 09:24:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 09:24:00,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:00,799 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-04 09:24:00,799 INFO L423 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:00,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-04 09:24:00,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:00,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:00,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:00,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:00,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:01,267 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 09:24:01,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:01,267 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 09:24:01,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:01,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:01,295 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 09:24:01,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:01,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 09:24:01,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 09:24:01,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 09:24:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-04 09:24:01,316 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-10-04 09:24:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:01,806 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 09:24:01,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 09:24:01,806 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-10-04 09:24:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:01,807 INFO L225 Difference]: With dead ends: 30 [2018-10-04 09:24:01,807 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:24:01,808 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 09:24:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:24:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 09:24:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 09:24:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 09:24:01,813 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-04 09:24:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:01,813 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 09:24:01,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 09:24:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 09:24:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:24:01,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:01,814 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-04 09:24:01,814 INFO L423 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:01,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:01,814 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-04 09:24:01,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:01,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:01,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:02,281 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 09:24:02,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:02,281 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 09:24:02,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:24:02,297 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:24:02,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:02,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:02,318 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 09:24:02,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:02,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 09:24:02,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 09:24:02,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 09:24:02,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-04 09:24:02,349 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-10-04 09:24:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:02,950 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 09:24:02,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 09:24:02,951 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-10-04 09:24:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:02,951 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:24:02,951 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 09:24:02,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-04 09:24:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 09:24:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 09:24:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:24:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-04 09:24:02,956 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-04 09:24:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:02,956 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-04 09:24:02,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 09:24:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-04 09:24:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 09:24:02,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:02,957 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-04 09:24:02,957 INFO L423 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:02,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-04 09:24:02,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:02,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:02,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:02,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:03,500 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 09:24:03,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:03,501 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 09:24:03,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:24:03,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 09:24:03,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:03,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:03,541 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 09:24:03,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:03,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 09:24:03,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 09:24:03,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 09:24:03,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-04 09:24:03,567 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-10-04 09:24:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:04,272 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-04 09:24:04,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:24:04,273 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-10-04 09:24:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:04,274 INFO L225 Difference]: With dead ends: 32 [2018-10-04 09:24:04,274 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:24:04,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-04 09:24:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:24:04,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 09:24:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 09:24:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 09:24:04,279 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-04 09:24:04,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:04,279 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 09:24:04,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 09:24:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 09:24:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:24:04,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:04,280 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-04 09:24:04,280 INFO L423 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:04,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:04,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-04 09:24:04,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:04,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:04,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:04,859 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 09:24:04,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:04,859 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 09:24:04,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:24:04,877 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:24:04,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:04,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:04,891 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 09:24:04,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:04,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 09:24:04,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 09:24:04,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 09:24:04,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-04 09:24:04,917 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-10-04 09:24:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:05,472 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-04 09:24:05,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 09:24:05,472 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-10-04 09:24:05,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:05,473 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:24:05,473 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 09:24:05,474 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 09:24:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 09:24:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 09:24:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:24:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 09:24:05,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-04 09:24:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:05,479 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 09:24:05,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 09:24:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 09:24:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 09:24:05,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:05,480 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-04 09:24:05,480 INFO L423 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:05,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-04 09:24:05,481 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:05,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:05,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:05,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:06,100 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 09:24:06,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:06,101 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 09:24:06,109 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:24:06,124 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 09:24:06,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:06,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:06,145 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 09:24:06,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:06,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 09:24:06,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 09:24:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 09:24:06,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-04 09:24:06,172 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-10-04 09:24:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:06,816 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-04 09:24:06,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 09:24:06,817 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-10-04 09:24:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:06,818 INFO L225 Difference]: With dead ends: 34 [2018-10-04 09:24:06,818 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:24:06,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-04 09:24:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:24:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 09:24:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 09:24:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 09:24:06,824 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-04 09:24:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:06,825 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 09:24:06,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 09:24:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 09:24:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 09:24:06,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:06,825 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-04 09:24:06,826 INFO L423 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:06,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:06,826 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-04 09:24:06,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:06,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:06,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:06,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:06,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:07,465 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 09:24:07,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:07,465 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 09:24:07,474 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:24:07,493 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 09:24:07,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:07,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:07,518 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 09:24:07,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:07,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 09:24:07,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 09:24:07,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 09:24:07,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 09:24:07,549 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-10-04 09:24:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:08,360 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 09:24:08,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 09:24:08,361 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-10-04 09:24:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:08,362 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:24:08,362 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 09:24:08,363 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 09:24:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 09:24:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 09:24:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:24:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-04 09:24:08,366 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-04 09:24:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:08,367 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-04 09:24:08,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 09:24:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-04 09:24:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 09:24:08,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:08,367 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-04 09:24:08,368 INFO L423 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:08,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:08,368 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-04 09:24:08,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:08,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:08,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:09,859 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 09:24:09,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:09,859 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 09:24:09,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:09,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:09,896 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 09:24:09,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:09,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 09:24:09,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 09:24:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 09:24:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 09:24:09,922 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-10-04 09:24:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:10,648 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 09:24:10,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 09:24:10,648 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-10-04 09:24:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:10,649 INFO L225 Difference]: With dead ends: 36 [2018-10-04 09:24:10,649 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:24:10,650 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 09:24:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:24:10,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 09:24:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 09:24:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-04 09:24:10,654 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-04 09:24:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:10,655 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-04 09:24:10,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 09:24:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-04 09:24:10,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:24:10,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:10,656 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-04 09:24:10,656 INFO L423 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:10,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:10,656 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-04 09:24:10,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:10,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:10,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:10,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:10,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:11,295 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 09:24:11,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:11,295 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 09:24:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:24:11,314 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:24:11,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:11,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:11,364 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 09:24:11,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:11,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 09:24:11,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 09:24:11,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 09:24:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 09:24:11,397 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-10-04 09:24:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:12,222 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-04 09:24:12,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 09:24:12,223 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-10-04 09:24:12,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:12,223 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:24:12,224 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 09:24:12,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 09:24:12,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 09:24:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 09:24:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 09:24:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 09:24:12,229 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-04 09:24:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:12,229 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 09:24:12,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 09:24:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 09:24:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 09:24:12,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:12,230 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-04 09:24:12,230 INFO L423 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:12,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-04 09:24:12,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:12,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:12,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:12,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:12,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:13,427 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 09:24:13,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:13,428 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 09:24:13,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:24:13,452 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 09:24:13,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:13,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:13,463 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 09:24:13,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:13,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 09:24:13,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 09:24:13,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 09:24:13,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 09:24:13,486 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-10-04 09:24:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:14,260 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-04 09:24:14,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 09:24:14,261 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-10-04 09:24:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:14,261 INFO L225 Difference]: With dead ends: 38 [2018-10-04 09:24:14,262 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:24:14,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 09:24:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:24:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 09:24:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 09:24:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 09:24:14,266 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-04 09:24:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:14,267 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 09:24:14,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 09:24:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 09:24:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:24:14,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:14,267 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-04 09:24:14,268 INFO L423 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:14,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-04 09:24:14,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:14,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:15,209 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 09:24:15,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:15,210 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 09:24:15,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:24:15,231 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:24:15,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:15,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:15,249 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 09:24:15,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:15,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 09:24:15,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 09:24:15,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 09:24:15,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 09:24:15,276 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-10-04 09:24:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:16,070 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 09:24:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 09:24:16,071 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-10-04 09:24:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:16,071 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:24:16,071 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 09:24:16,072 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 09:24:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 09:24:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 09:24:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 09:24:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-04 09:24:16,076 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-04 09:24:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:16,076 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-04 09:24:16,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 09:24:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-04 09:24:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 09:24:16,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:16,076 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-04 09:24:16,077 INFO L423 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:16,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-04 09:24:16,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:16,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:16,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:16,902 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 09:24:16,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:16,902 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 09:24:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:24:16,926 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 09:24:16,926 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:16,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:16,940 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 09:24:16,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:16,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 09:24:16,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 09:24:16,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 09:24:16,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 09:24:16,963 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-10-04 09:24:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:17,795 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 09:24:17,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 09:24:17,796 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-10-04 09:24:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:17,797 INFO L225 Difference]: With dead ends: 40 [2018-10-04 09:24:17,797 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:24:17,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 09:24:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:24:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 09:24:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 09:24:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-04 09:24:17,802 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-04 09:24:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:17,802 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-04 09:24:17,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 09:24:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-04 09:24:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 09:24:17,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:17,803 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-04 09:24:17,803 INFO L423 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:17,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-04 09:24:17,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:17,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:17,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:17,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:17,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:19,008 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 09:24:19,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:19,009 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 09:24:19,017 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:24:19,037 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 09:24:19,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:19,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:19,049 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 09:24:19,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:19,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 09:24:19,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 09:24:19,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 09:24:19,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 09:24:19,070 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-10-04 09:24:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:19,948 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 09:24:19,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 09:24:19,949 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-10-04 09:24:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:19,950 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:24:19,950 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 09:24:19,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 09:24:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 09:24:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 09:24:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 09:24:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-04 09:24:19,954 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-04 09:24:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:19,955 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-04 09:24:19,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 09:24:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-04 09:24:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 09:24:19,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:19,955 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-04 09:24:19,956 INFO L423 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:19,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-04 09:24:19,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:19,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:21,343 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 09:24:21,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:21,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 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 09:24:21,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:21,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:21,373 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 09:24:21,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:21,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 09:24:21,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 09:24:21,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 09:24:21,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 09:24:21,395 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-10-04 09:24:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:22,325 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-04 09:24:22,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 09:24:22,326 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-10-04 09:24:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:22,327 INFO L225 Difference]: With dead ends: 42 [2018-10-04 09:24:22,327 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:24:22,328 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 09:24:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:24:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 09:24:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 09:24:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 09:24:22,331 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-04 09:24:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:22,331 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 09:24:22,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 09:24:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 09:24:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 09:24:22,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:22,332 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-04 09:24:22,332 INFO L423 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:22,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-04 09:24:22,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:22,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:22,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:23,906 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 09:24:23,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:23,907 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 09:24:23,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:24:23,928 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:24:23,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:23,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:23,940 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 09:24:23,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:23,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 09:24:23,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 09:24:23,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 09:24:23,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 09:24:23,962 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-10-04 09:24:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:24,956 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 09:24:24,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 09:24:24,956 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-10-04 09:24:24,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:24,957 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:24:24,957 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 09:24:24,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 09:24:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 09:24:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 09:24:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 09:24:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 09:24:24,961 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-04 09:24:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:24,961 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 09:24:24,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 09:24:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 09:24:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:24:24,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:24,962 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-04 09:24:24,962 INFO L423 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:24,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:24,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-04 09:24:24,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:24,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:24,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:24,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:24,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:25,995 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 09:24:25,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:25,995 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) [2018-10-04 09:24:26,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:24:26,064 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 09:24:26,064 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:26,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:26,077 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 09:24:26,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:26,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 09:24:26,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 09:24:26,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 09:24:26,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 09:24:26,101 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-10-04 09:24:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:27,156 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-04 09:24:27,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 09:24:27,157 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-10-04 09:24:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:27,157 INFO L225 Difference]: With dead ends: 44 [2018-10-04 09:24:27,157 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:24:27,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 09:24:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:24:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:24:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:24:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-04 09:24:27,162 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-04 09:24:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:27,163 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-04 09:24:27,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 09:24:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-04 09:24:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 09:24:27,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:27,163 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-04 09:24:27,164 INFO L423 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:27,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-04 09:24:27,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:27,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:27,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:28,086 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 09:24:28,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:28,086 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 09:24:28,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:24:28,108 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:24:28,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:28,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:28,119 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 09:24:28,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:28,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 09:24:28,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 09:24:28,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 09:24:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 09:24:28,140 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-10-04 09:24:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:29,397 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 09:24:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 09:24:29,397 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-10-04 09:24:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:29,398 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:24:29,398 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 09:24:29,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 09:24:29,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 09:24:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 09:24:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 09:24:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-04 09:24:29,402 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-04 09:24:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:29,402 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-04 09:24:29,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 09:24:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-04 09:24:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 09:24:29,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:29,403 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-04 09:24:29,403 INFO L423 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:29,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:29,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-04 09:24:29,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:29,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:29,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:29,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:29,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:30,378 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 09:24:30,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:30,378 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 09:24:30,387 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:24:30,409 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 09:24:30,409 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:30,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:30,421 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 09:24:30,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:30,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 09:24:30,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 09:24:30,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 09:24:30,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 09:24:30,442 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-10-04 09:24:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:31,564 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 09:24:31,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 09:24:31,565 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-10-04 09:24:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:31,566 INFO L225 Difference]: With dead ends: 46 [2018-10-04 09:24:31,566 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:24:31,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 09:24:31,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:24:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 09:24:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 09:24:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 09:24:31,571 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-04 09:24:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:31,571 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 09:24:31,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 09:24:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 09:24:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:24:31,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:31,571 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-04 09:24:31,571 INFO L423 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:31,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-04 09:24:31,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:31,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:31,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:31,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:31,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:32,587 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 09:24:32,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:32,588 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 09:24:32,595 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:24:32,617 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 09:24:32,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:32,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:32,631 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 09:24:32,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:32,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 09:24:32,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 09:24:32,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 09:24:32,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 09:24:32,653 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-10-04 09:24:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:34,027 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 09:24:34,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 09:24:34,027 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-10-04 09:24:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:34,028 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:24:34,028 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 09:24:34,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 09:24:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 09:24:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 09:24:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 09:24:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 09:24:34,033 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-04 09:24:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:34,033 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 09:24:34,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 09:24:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 09:24:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 09:24:34,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:34,034 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-04 09:24:34,034 INFO L423 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:34,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:34,035 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-04 09:24:34,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:34,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:34,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:34,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:35,387 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 09:24:35,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:35,387 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 09:24:35,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:35,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:35,419 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 09:24:35,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:35,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 09:24:35,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 09:24:35,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 09:24:35,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 09:24:35,440 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-10-04 09:24:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:36,669 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-04 09:24:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 09:24:36,669 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-10-04 09:24:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:36,670 INFO L225 Difference]: With dead ends: 48 [2018-10-04 09:24:36,670 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:24:36,671 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 09:24:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:24:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 09:24:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 09:24:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 09:24:36,675 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-04 09:24:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:36,676 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 09:24:36,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 09:24:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 09:24:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 09:24:36,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:36,677 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-04 09:24:36,677 INFO L423 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:36,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:36,677 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-04 09:24:36,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:36,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:36,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:36,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:36,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:37,740 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 09:24:37,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:37,740 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 09:24:37,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:24:37,764 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:24:37,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:37,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:37,776 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 09:24:37,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:37,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 09:24:37,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 09:24:37,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 09:24:37,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 09:24:37,797 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-10-04 09:24:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:39,208 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-04 09:24:39,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 09:24:39,208 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-10-04 09:24:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:39,209 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:24:39,209 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 09:24:39,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 09:24:39,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 09:24:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-04 09:24:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 09:24:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-04 09:24:39,213 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-10-04 09:24:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:39,213 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-04 09:24:39,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 09:24:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-04 09:24:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 09:24:39,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:39,214 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-10-04 09:24:39,214 INFO L423 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:39,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:39,214 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-10-04 09:24:39,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:39,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:39,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:40,370 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 09:24:40,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:40,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:24:40,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:24:40,414 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-04 09:24:40,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:40,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:40,450 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 09:24:40,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:40,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 09:24:40,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 09:24:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 09:24:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 09:24:40,471 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-10-04 09:24:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:41,840 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-04 09:24:41,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 09:24:41,840 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-10-04 09:24:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:41,841 INFO L225 Difference]: With dead ends: 50 [2018-10-04 09:24:41,841 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:24:41,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 09:24:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:24:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-04 09:24:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 09:24:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 09:24:41,846 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-10-04 09:24:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:41,847 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 09:24:41,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 09:24:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 09:24:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 09:24:41,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:41,847 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-10-04 09:24:41,848 INFO L423 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:41,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:41,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-10-04 09:24:41,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:41,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:41,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:41,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:41,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:43,085 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 09:24:43,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:43,085 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 09:24:43,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:24:43,106 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:24:43,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:43,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:43,120 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 09:24:43,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:43,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 09:24:43,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 09:24:43,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 09:24:43,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 09:24:43,141 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-10-04 09:24:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:44,710 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 09:24:44,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 09:24:44,711 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-10-04 09:24:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:44,712 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:24:44,712 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 09:24:44,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 09:24:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 09:24:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 09:24:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 09:24:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-04 09:24:44,716 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-10-04 09:24:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:44,716 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-04 09:24:44,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 09:24:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-04 09:24:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 09:24:44,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:44,717 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-10-04 09:24:44,717 INFO L423 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:44,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:44,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-10-04 09:24:44,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:44,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:44,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:44,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:44,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:45,858 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 09:24:45,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:45,858 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 09:24:45,871 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:24:45,893 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 09:24:45,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:45,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:45,908 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 09:24:45,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:45,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 09:24:45,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 09:24:45,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 09:24:45,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 09:24:45,938 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-10-04 09:24:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:47,531 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-04 09:24:47,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 09:24:47,531 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-10-04 09:24:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:47,532 INFO L225 Difference]: With dead ends: 52 [2018-10-04 09:24:47,532 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:24:47,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 09:24:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:24:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 09:24:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 09:24:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 09:24:47,537 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-10-04 09:24:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:47,538 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 09:24:47,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 09:24:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 09:24:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 09:24:47,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:47,538 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-10-04 09:24:47,538 INFO L423 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:47,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-10-04 09:24:47,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:47,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:47,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:47,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:47,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:49,244 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 09:24:49,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:49,244 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 09:24:49,252 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:24:49,276 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 09:24:49,276 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:49,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:49,321 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 09:24:49,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:49,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 09:24:49,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 09:24:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 09:24:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 09:24:49,342 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-10-04 09:24:50,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:50,866 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-04 09:24:50,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 09:24:50,867 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-10-04 09:24:50,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:50,868 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:24:50,868 INFO L226 Difference]: Without dead ends: 52 [2018-10-04 09:24:50,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-04 09:24:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-04 09:24:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-04 09:24:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 09:24:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-04 09:24:50,874 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-10-04 09:24:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:50,874 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-04 09:24:50,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 09:24:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-04 09:24:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 09:24:50,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:50,875 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-10-04 09:24:50,875 INFO L423 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:50,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-10-04 09:24:50,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:50,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:50,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:50,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:50,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:52,152 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 09:24:52,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:52,152 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 09:24:52,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:52,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:52,191 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 09:24:52,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:52,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 09:24:52,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 09:24:52,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 09:24:52,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 09:24:52,212 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-10-04 09:24:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:53,806 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-04 09:24:53,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 09:24:53,807 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-10-04 09:24:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:53,807 INFO L225 Difference]: With dead ends: 54 [2018-10-04 09:24:53,808 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:24:53,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 09:24:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:24:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 09:24:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 09:24:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 09:24:53,812 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-10-04 09:24:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:53,813 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 09:24:53,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 09:24:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 09:24:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 09:24:53,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:53,813 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-10-04 09:24:53,814 INFO L423 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:53,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:53,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-10-04 09:24:53,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:53,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:53,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:53,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:53,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:55,666 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 09:24:55,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:55,667 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 09:24:55,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:24:55,693 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:24:55,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:55,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:55,707 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 09:24:55,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:55,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 09:24:55,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 09:24:55,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 09:24:55,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 09:24:55,729 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-10-04 09:24:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:57,425 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 09:24:57,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 09:24:57,426 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-10-04 09:24:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:57,427 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:24:57,427 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 09:24:57,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 09:24:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 09:24:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-04 09:24:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-04 09:24:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-04 09:24:57,431 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-10-04 09:24:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:57,431 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-04 09:24:57,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 09:24:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-04 09:24:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 09:24:57,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:57,432 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-10-04 09:24:57,432 INFO L423 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:57,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:57,432 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-10-04 09:24:57,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:57,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:57,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:57,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:57,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:00,090 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 09:25:00,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:00,090 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 09:25:00,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:25:00,123 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-04 09:25:00,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:00,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:00,139 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 09:25:00,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:00,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 09:25:00,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 09:25:00,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 09:25:00,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 09:25:00,161 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-10-04 09:25:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:01,899 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-04 09:25:01,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 09:25:01,900 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-10-04 09:25:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:01,901 INFO L225 Difference]: With dead ends: 56 [2018-10-04 09:25:01,901 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:25:01,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 09:25:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:25:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-04 09:25:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 09:25:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-04 09:25:01,905 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-10-04 09:25:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:01,905 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-04 09:25:01,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 09:25:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-04 09:25:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-04 09:25:01,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:01,906 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-10-04 09:25:01,906 INFO L423 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:01,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:01,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-10-04 09:25:01,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:01,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:01,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:01,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:01,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:03,388 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 09:25:03,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:03,389 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 09:25:03,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:25:03,413 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:25:03,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:03,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:03,430 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 09:25:03,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:03,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 09:25:03,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 09:25:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 09:25:03,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 09:25:03,451 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-10-04 09:25:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:05,398 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-04 09:25:05,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 09:25:05,398 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-10-04 09:25:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:05,399 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:25:05,399 INFO L226 Difference]: Without dead ends: 56 [2018-10-04 09:25:05,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 09:25:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-04 09:25:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-04 09:25:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 09:25:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-04 09:25:05,406 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-10-04 09:25:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:05,406 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-04 09:25:05,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 09:25:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-04 09:25:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-04 09:25:05,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:05,407 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-10-04 09:25:05,407 INFO L423 AbstractCegarLoop]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:05,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-10-04 09:25:05,408 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:05,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:05,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:05,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:07,013 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 09:25:07,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:07,014 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 09:25:07,023 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:25:07,055 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-10-04 09:25:07,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:07,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:07,070 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 09:25:07,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:07,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 09:25:07,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 09:25:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 09:25:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 09:25:07,091 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-10-04 09:25:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:08,946 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-04 09:25:08,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 09:25:08,947 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-10-04 09:25:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:08,948 INFO L225 Difference]: With dead ends: 58 [2018-10-04 09:25:08,948 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:25:08,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 09:25:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:25:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 09:25:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:25:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 09:25:08,952 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-10-04 09:25:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:08,952 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 09:25:08,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 09:25:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 09:25:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 09:25:08,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:08,953 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-10-04 09:25:08,953 INFO L423 AbstractCegarLoop]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:08,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:08,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-10-04 09:25:08,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:08,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:08,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:08,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:08,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:10,788 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 09:25:10,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:10,789 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 09:25:10,796 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:25:10,822 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-04 09:25:10,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:10,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:10,837 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 09:25:10,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:10,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 09:25:10,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 09:25:10,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 09:25:10,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 09:25:10,858 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-10-04 09:25:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:12,776 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 09:25:12,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 09:25:12,777 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-10-04 09:25:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:12,778 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:25:12,778 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 09:25:12,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-04 09:25:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 09:25:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-04 09:25:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-04 09:25:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-04 09:25:12,782 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-10-04 09:25:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:12,782 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-04 09:25:12,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 09:25:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-04 09:25:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 09:25:12,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:12,783 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-10-04 09:25:12,783 INFO L423 AbstractCegarLoop]: === Iteration 56 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:12,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-10-04 09:25:12,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:12,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:12,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:15,202 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 09:25:15,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:15,202 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 09:25:15,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:25:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:15,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:15,240 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 09:25:15,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:15,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 09:25:15,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 09:25:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 09:25:15,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 09:25:15,261 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-10-04 09:25:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:17,261 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-04 09:25:17,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 09:25:17,261 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-10-04 09:25:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:17,262 INFO L225 Difference]: With dead ends: 60 [2018-10-04 09:25:17,262 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:25:17,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 09:25:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:25:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-04 09:25:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-04 09:25:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-04 09:25:17,267 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-10-04 09:25:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:17,267 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-04 09:25:17,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 09:25:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-04 09:25:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 09:25:17,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:17,268 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-10-04 09:25:17,268 INFO L423 AbstractCegarLoop]: === Iteration 57 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:17,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-10-04 09:25:17,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:17,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:17,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:25:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:18,885 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 09:25:18,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:18,886 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 09:25:18,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:25:18,913 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:25:18,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:18,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:18,928 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 09:25:18,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:18,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 09:25:18,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 09:25:18,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 09:25:18,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 09:25:18,949 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-10-04 09:25:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:21,193 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 09:25:21,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 09:25:21,194 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-10-04 09:25:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:21,195 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:25:21,195 INFO L226 Difference]: Without dead ends: 60 [2018-10-04 09:25:21,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 09:25:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-04 09:25:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-10-04 09:25:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-04 09:25:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-04 09:25:21,200 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-10-04 09:25:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:21,200 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-04 09:25:21,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 09:25:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-04 09:25:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-04 09:25:21,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:21,201 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-10-04 09:25:21,201 INFO L423 AbstractCegarLoop]: === Iteration 58 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:21,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:21,201 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-10-04 09:25:21,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:21,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:21,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:21,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:21,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:22,887 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 09:25:22,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:22,887 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 09:25:22,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:25:22,933 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-10-04 09:25:22,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:22,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:22,953 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 09:25:22,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:22,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 09:25:22,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 09:25:22,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 09:25:22,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 09:25:22,976 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-10-04 09:25:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:25,304 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-04 09:25:25,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 09:25:25,304 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-10-04 09:25:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:25,305 INFO L225 Difference]: With dead ends: 62 [2018-10-04 09:25:25,305 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 09:25:25,306 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 09:25:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 09:25:25,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 09:25:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 09:25:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 09:25:25,311 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-10-04 09:25:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:25,311 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 09:25:25,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 09:25:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 09:25:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 09:25:25,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:25,312 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-10-04 09:25:25,312 INFO L423 AbstractCegarLoop]: === Iteration 59 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:25,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:25,312 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-10-04 09:25:25,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:25,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:25,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:25,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:27,184 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 09:25:27,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:27,184 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 09:25:27,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:25:27,210 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:25:27,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:27,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:27,226 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 09:25:27,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:27,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 09:25:27,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 09:25:27,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 09:25:27,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 09:25:27,248 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-10-04 09:25:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:29,456 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 09:25:29,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 09:25:29,456 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-10-04 09:25:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:29,457 INFO L225 Difference]: With dead ends: 63 [2018-10-04 09:25:29,457 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 09:25:29,458 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 09:25:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 09:25:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-10-04 09:25:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 09:25:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-04 09:25:29,462 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-10-04 09:25:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:29,462 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-04 09:25:29,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 09:25:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-04 09:25:29,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 09:25:29,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:29,462 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-10-04 09:25:29,463 INFO L423 AbstractCegarLoop]: === Iteration 60 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:29,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:29,463 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-10-04 09:25:29,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:29,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:29,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:29,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:31,657 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 09:25:31,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:31,657 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 09:25:31,665 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:25:31,697 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-04 09:25:31,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:31,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:31,719 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 09:25:31,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:31,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-04 09:25:31,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 09:25:31,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 09:25:31,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 09:25:31,741 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-10-04 09:25:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:34,019 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-04 09:25:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 09:25:34,019 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-10-04 09:25:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:34,020 INFO L225 Difference]: With dead ends: 64 [2018-10-04 09:25:34,021 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 09:25:34,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 09:25:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 09:25:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 09:25:34,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 09:25:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-04 09:25:34,025 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-10-04 09:25:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:34,025 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-04 09:25:34,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 09:25:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-04 09:25:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 09:25:34,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:34,025 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-10-04 09:25:34,026 INFO L423 AbstractCegarLoop]: === Iteration 61 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:34,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-10-04 09:25:34,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:34,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:34,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:34,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:34,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:36,332 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 09:25:36,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:36,332 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 09:25:36,341 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:25:36,373 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 09:25:36,373 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:36,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:36,398 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 09:25:36,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:36,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 09:25:36,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-04 09:25:36,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-04 09:25:36,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 09:25:36,430 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-10-04 09:25:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:39,295 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 09:25:39,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 09:25:39,296 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-10-04 09:25:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:39,297 INFO L225 Difference]: With dead ends: 65 [2018-10-04 09:25:39,297 INFO L226 Difference]: Without dead ends: 64 [2018-10-04 09:25:39,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-04 09:25:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-04 09:25:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-10-04 09:25:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 09:25:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-04 09:25:39,301 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-10-04 09:25:39,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:39,302 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-04 09:25:39,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-04 09:25:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-04 09:25:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 09:25:39,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:39,302 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-10-04 09:25:39,302 INFO L423 AbstractCegarLoop]: === Iteration 62 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:39,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:39,303 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-10-04 09:25:39,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:39,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:39,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:39,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:39,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:41,496 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 09:25:41,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:41,497 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 09:25:41,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:25:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:41,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:41,539 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 09:25:41,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:41,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-04 09:25:41,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 09:25:41,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 09:25:41,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 09:25:41,560 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-10-04 09:25:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:43,997 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-04 09:25:43,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 09:25:43,997 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-10-04 09:25:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:43,998 INFO L225 Difference]: With dead ends: 66 [2018-10-04 09:25:43,998 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 09:25:43,999 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 09:25:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 09:25:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-04 09:25:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 09:25:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-04 09:25:44,004 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-10-04 09:25:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:44,004 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-04 09:25:44,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 09:25:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-04 09:25:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 09:25:44,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:44,005 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-10-04 09:25:44,005 INFO L423 AbstractCegarLoop]: === Iteration 63 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:44,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-10-04 09:25:44,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:44,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:44,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:44,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:25:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:46,220 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 09:25:46,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:46,220 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 09:25:46,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:25:46,248 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:25:46,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:46,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:46,265 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 09:25:46,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:46,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 09:25:46,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 09:25:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 09:25:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 09:25:46,297 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-10-04 09:25:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:48,869 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-04 09:25:48,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 09:25:48,869 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-10-04 09:25:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:48,870 INFO L225 Difference]: With dead ends: 67 [2018-10-04 09:25:48,870 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 09:25:48,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 09:25:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 09:25:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-04 09:25:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 09:25:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-04 09:25:48,876 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-10-04 09:25:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:48,876 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-04 09:25:48,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 09:25:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-04 09:25:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 09:25:48,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:48,877 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-10-04 09:25:48,877 INFO L423 AbstractCegarLoop]: === Iteration 64 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:48,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-10-04 09:25:48,878 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:48,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:48,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:48,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:48,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:51,157 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 09:25:51,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:51,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 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 09:25:51,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:25:51,199 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-10-04 09:25:51,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:51,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:51,220 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 09:25:51,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:51,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-04 09:25:51,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 09:25:51,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 09:25:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 09:25:51,255 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-10-04 09:25:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:54,263 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-04 09:25:54,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 09:25:54,264 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-10-04 09:25:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:54,265 INFO L225 Difference]: With dead ends: 68 [2018-10-04 09:25:54,265 INFO L226 Difference]: Without dead ends: 67 [2018-10-04 09:25:54,266 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 09:25:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-04 09:25:54,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-04 09:25:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 09:25:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-04 09:25:54,270 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-10-04 09:25:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:54,270 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-04 09:25:54,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 09:25:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-04 09:25:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 09:25:54,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:54,271 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-10-04 09:25:54,271 INFO L423 AbstractCegarLoop]: === Iteration 65 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:54,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:54,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-10-04 09:25:54,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:54,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:54,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:56,621 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 09:25:56,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:56,621 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 09:25:56,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:25:56,648 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:25:56,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:56,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:56,666 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 09:25:56,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:56,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 09:25:56,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-04 09:25:56,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-04 09:25:56,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 09:25:56,696 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-10-04 09:25:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:59,416 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-04 09:25:59,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 09:25:59,417 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-10-04 09:25:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:59,417 INFO L225 Difference]: With dead ends: 69 [2018-10-04 09:25:59,417 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 09:25:59,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 09:25:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 09:25:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 09:25:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 09:25:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-04 09:25:59,422 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-10-04 09:25:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:59,423 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-04 09:25:59,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-04 09:25:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-04 09:25:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 09:25:59,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:59,424 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-10-04 09:25:59,424 INFO L423 AbstractCegarLoop]: === Iteration 66 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:59,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:59,424 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-10-04 09:25:59,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:59,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:59,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:59,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:59,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:01,806 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 09:26:01,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:01,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 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 09:26:01,814 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:26:01,847 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-10-04 09:26:01,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:26:01,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:01,866 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 09:26:01,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:01,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-04 09:26:01,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 09:26:01,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 09:26:01,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 09:26:01,887 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-10-04 09:26:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:04,639 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-04 09:26:04,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 09:26:04,640 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-10-04 09:26:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:04,641 INFO L225 Difference]: With dead ends: 70 [2018-10-04 09:26:04,641 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 09:26:04,642 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 09:26:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 09:26:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-04 09:26:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 09:26:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-04 09:26:04,646 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-10-04 09:26:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:04,646 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-04 09:26:04,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 09:26:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-04 09:26:04,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 09:26:04,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:04,647 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-10-04 09:26:04,647 INFO L423 AbstractCegarLoop]: === Iteration 67 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:04,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:04,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-10-04 09:26:04,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:04,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:04,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:26:04,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:07,443 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 09:26:07,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:07,443 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 09:26:07,452 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:26:07,486 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-10-04 09:26:07,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:26:07,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:07,509 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 09:26:07,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:07,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 09:26:07,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 09:26:07,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 09:26:07,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 09:26:07,532 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-10-04 09:26:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:10,418 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-04 09:26:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 09:26:10,419 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-10-04 09:26:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:10,419 INFO L225 Difference]: With dead ends: 71 [2018-10-04 09:26:10,420 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 09:26:10,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 09:26:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 09:26:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-04 09:26:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-04 09:26:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-04 09:26:10,424 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-10-04 09:26:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:10,424 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-04 09:26:10,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 09:26:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-04 09:26:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-04 09:26:10,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:10,425 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-10-04 09:26:10,425 INFO L423 AbstractCegarLoop]: === Iteration 68 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:10,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-10-04 09:26:10,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:10,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:10,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:10,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:26:10,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:12,952 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 09:26:12,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:12,953 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 09:26:12,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:26:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:12,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:13,000 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 09:26:13,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:13,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-04 09:26:13,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 09:26:13,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 09:26:13,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 09:26:13,021 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-10-04 09:26:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:16,053 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-04 09:26:16,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 09:26:16,054 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-10-04 09:26:16,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:16,054 INFO L225 Difference]: With dead ends: 72 [2018-10-04 09:26:16,054 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 09:26:16,055 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 09:26:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 09:26:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 09:26:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 09:26:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-04 09:26:16,057 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-10-04 09:26:16,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:16,058 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-04 09:26:16,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 09:26:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-04 09:26:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 09:26:16,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:16,058 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-10-04 09:26:16,058 INFO L423 AbstractCegarLoop]: === Iteration 69 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:16,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-10-04 09:26:16,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:16,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:16,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:16,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:26:16,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:18,391 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 09:26:18,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:18,391 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 09:26:18,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:26:18,421 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:26:18,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:26:18,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:18,439 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 09:26:18,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:18,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 09:26:18,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-04 09:26:18,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-04 09:26:18,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 09:26:18,462 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-10-04 09:26:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:21,664 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-04 09:26:21,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 09:26:21,664 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-10-04 09:26:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:21,665 INFO L225 Difference]: With dead ends: 73 [2018-10-04 09:26:21,665 INFO L226 Difference]: Without dead ends: 72 [2018-10-04 09:26:21,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 09:26:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-04 09:26:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-10-04 09:26:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-04 09:26:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-04 09:26:21,670 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-10-04 09:26:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:21,670 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-04 09:26:21,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-04 09:26:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-04 09:26:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 09:26:21,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:21,671 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-10-04 09:26:21,671 INFO L423 AbstractCegarLoop]: === Iteration 70 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:21,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-10-04 09:26:21,671 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:21,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:21,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:26:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:24,008 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 09:26:24,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:24,008 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 09:26:24,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:26:24,072 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-04 09:26:24,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:26:24,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:24,090 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 09:26:24,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:24,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-04 09:26:24,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 09:26:24,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 09:26:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 09:26:24,112 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-10-04 09:26:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:27,402 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-04 09:26:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 09:26:27,402 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-10-04 09:26:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:27,403 INFO L225 Difference]: With dead ends: 74 [2018-10-04 09:26:27,403 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 09:26:27,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 09:26:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 09:26:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-04 09:26:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 09:26:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-04 09:26:27,409 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-10-04 09:26:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:27,409 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-04 09:26:27,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 09:26:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-04 09:26:27,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 09:26:27,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:27,410 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-10-04 09:26:27,410 INFO L423 AbstractCegarLoop]: === Iteration 71 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:27,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:27,410 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-10-04 09:26:27,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:27,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:27,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:27,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:26:27,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:29,846 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 09:26:29,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:29,846 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 09:26:29,854 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:26:29,877 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:26:29,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:26:29,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:29,903 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 09:26:29,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:29,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 09:26:29,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-04 09:26:29,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-04 09:26:29,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 09:26:29,925 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-10-04 09:26:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:33,294 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-04 09:26:33,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 09:26:33,295 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-10-04 09:26:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:33,296 INFO L225 Difference]: With dead ends: 75 [2018-10-04 09:26:33,296 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 09:26:33,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 09:26:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 09:26:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 09:26:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 09:26:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-04 09:26:33,302 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-10-04 09:26:33,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:33,302 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-04 09:26:33,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-04 09:26:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-04 09:26:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 09:26:33,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:33,303 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-10-04 09:26:33,303 INFO L423 AbstractCegarLoop]: === Iteration 72 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:33,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-10-04 09:26:33,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:33,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:26:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:36,223 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 09:26:36,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:36,223 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 09:26:36,230 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:26:36,708 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-04 09:26:36,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:26:36,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:36,778 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 09:26:36,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:36,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-04 09:26:36,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 09:26:36,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 09:26:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 09:26:36,801 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-10-04 09:26:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:41,011 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-04 09:26:41,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 09:26:41,011 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-10-04 09:26:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:41,012 INFO L225 Difference]: With dead ends: 76 [2018-10-04 09:26:41,012 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 09:26:41,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 09:26:41,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 09:26:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-04 09:26:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 09:26:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-04 09:26:41,018 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-10-04 09:26:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:41,019 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-04 09:26:41,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 09:26:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-04 09:26:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 09:26:41,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:41,019 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-10-04 09:26:41,020 INFO L423 AbstractCegarLoop]: === Iteration 73 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:41,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-10-04 09:26:41,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:41,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:41,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:41,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:26:41,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:44,226 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 09:26:44,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:44,226 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 09:26:44,234 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:26:44,375 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 09:26:44,375 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:26:44,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:44,442 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 09:26:44,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:44,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 09:26:44,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 09:26:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 09:26:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 09:26:44,477 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-10-04 09:26:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:48,102 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-04 09:26:48,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 09:26:48,103 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-10-04 09:26:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:48,104 INFO L225 Difference]: With dead ends: 77 [2018-10-04 09:26:48,104 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 09:26:48,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-04 09:26:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 09:26:48,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 09:26:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 09:26:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-04 09:26:48,109 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-10-04 09:26:48,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:48,110 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-04 09:26:48,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 09:26:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-04 09:26:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 09:26:48,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:48,110 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-10-04 09:26:48,111 INFO L423 AbstractCegarLoop]: === Iteration 74 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:48,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-10-04 09:26:48,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:48,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:48,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:48,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:26:48,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:50,793 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 09:26:50,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:50,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 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 09:26:50,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:26:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:50,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:50,858 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 09:26:50,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:50,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-04 09:26:50,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 09:26:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 09:26:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 09:26:50,891 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-10-04 09:26:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:54,597 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-04 09:26:54,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 09:26:54,597 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-10-04 09:26:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:54,598 INFO L225 Difference]: With dead ends: 78 [2018-10-04 09:26:54,599 INFO L226 Difference]: Without dead ends: 77 [2018-10-04 09:26:54,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 09:26:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-04 09:26:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-04 09:26:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 09:26:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-04 09:26:54,604 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-10-04 09:26:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:54,604 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-04 09:26:54,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 09:26:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-04 09:26:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 09:26:54,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:54,605 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-10-04 09:26:54,605 INFO L423 AbstractCegarLoop]: === Iteration 75 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:54,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-10-04 09:26:54,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:54,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:54,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:26:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:59,160 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 09:26:59,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:59,161 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 09:26:59,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:26:59,198 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:26:59,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:26:59,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:59,222 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 09:26:59,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:59,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-04 09:26:59,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-04 09:26:59,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-04 09:26:59,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 09:26:59,244 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-10-04 09:27:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:27:02,973 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-04 09:27:02,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 09:27:02,974 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-10-04 09:27:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:27:02,975 INFO L225 Difference]: With dead ends: 79 [2018-10-04 09:27:02,975 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 09:27:02,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 09:27:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 09:27:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-04 09:27:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 09:27:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-04 09:27:02,978 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-10-04 09:27:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:27:02,978 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-04 09:27:02,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-04 09:27:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-04 09:27:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 09:27:02,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:27:02,979 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-10-04 09:27:02,979 INFO L423 AbstractCegarLoop]: === Iteration 76 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:27:02,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:27:02,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-10-04 09:27:02,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:27:02,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:27:02,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:02,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:27:02,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:27:05,665 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 09:27:05,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:27:05,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 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 09:27:05,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:27:05,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-10-04 09:27:05,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:27:05,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:27:05,737 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 09:27:05,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:27:05,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-04 09:27:05,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 09:27:05,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 09:27:05,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 09:27:05,759 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-10-04 09:27:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:27:09,545 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-04 09:27:09,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 09:27:09,546 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-10-04 09:27:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:27:09,547 INFO L225 Difference]: With dead ends: 80 [2018-10-04 09:27:09,547 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 09:27:09,547 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 09:27:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 09:27:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-04 09:27:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-04 09:27:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-04 09:27:09,551 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-10-04 09:27:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:27:09,551 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-04 09:27:09,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 09:27:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-04 09:27:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 09:27:09,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:27:09,552 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-10-04 09:27:09,552 INFO L423 AbstractCegarLoop]: === Iteration 77 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:27:09,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:27:09,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-10-04 09:27:09,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:27:09,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:27:09,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:09,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:27:09,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:27:13,468 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 09:27:13,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:27:13,469 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 09:27:13,475 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:27:13,498 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:27:13,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:27:13,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:27:13,520 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 09:27:13,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:27:13,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-04 09:27:13,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 09:27:13,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 09:27:13,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 09:27:13,541 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-10-04 09:27:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:27:17,300 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-04 09:27:17,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 09:27:17,300 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-10-04 09:27:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:27:17,301 INFO L225 Difference]: With dead ends: 81 [2018-10-04 09:27:17,301 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 09:27:17,301 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 09:27:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 09:27:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 09:27:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 09:27:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-04 09:27:17,305 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-10-04 09:27:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:27:17,305 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-04 09:27:17,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 09:27:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-04 09:27:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 09:27:17,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:27:17,305 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-10-04 09:27:17,306 INFO L423 AbstractCegarLoop]: === Iteration 78 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:27:17,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:27:17,306 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-10-04 09:27:17,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:27:17,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:27:17,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:17,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:27:17,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:27:20,391 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 09:27:20,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:27:20,391 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 09:27:20,398 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:27:20,437 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-10-04 09:27:20,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:27:20,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:27:20,508 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 09:27:20,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:27:20,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-04 09:27:20,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 09:27:20,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 09:27:20,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 09:27:20,537 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-10-04 09:27:24,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:27:24,618 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-04 09:27:24,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-04 09:27:24,618 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-10-04 09:27:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:27:24,619 INFO L225 Difference]: With dead ends: 82 [2018-10-04 09:27:24,619 INFO L226 Difference]: Without dead ends: 81 [2018-10-04 09:27:24,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 09:27:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-04 09:27:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-04 09:27:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-04 09:27:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-04 09:27:24,624 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-10-04 09:27:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:27:24,625 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-04 09:27:24,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 09:27:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-04 09:27:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 09:27:24,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:27:24,625 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-10-04 09:27:24,626 INFO L423 AbstractCegarLoop]: === Iteration 79 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:27:24,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:27:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-10-04 09:27:24,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:27:24,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:27:24,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:24,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:27:24,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:27:27,632 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 09:27:27,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:27:27,633 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 09:27:27,639 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:27:27,782 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2018-10-04 09:27:27,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:27:27,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:27:27,826 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 09:27:27,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:27:27,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-04 09:27:27,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 09:27:27,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 09:27:27,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 09:27:27,848 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-10-04 09:27:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:27:31,838 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-04 09:27:31,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-04 09:27:31,839 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-10-04 09:27:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:27:31,840 INFO L225 Difference]: With dead ends: 83 [2018-10-04 09:27:31,840 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 09:27:31,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-04 09:27:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 09:27:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-04 09:27:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 09:27:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-04 09:27:31,845 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-10-04 09:27:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:27:31,845 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-04 09:27:31,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 09:27:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-04 09:27:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 09:27:31,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:27:31,846 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-10-04 09:27:31,846 INFO L423 AbstractCegarLoop]: === Iteration 80 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:27:31,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:27:31,846 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-10-04 09:27:31,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:27:31,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:27:31,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:31,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:27:31,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:27:35,735 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 09:27:35,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:27:35,735 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 09:27:35,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:27:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:27:35,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:27:35,809 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 09:27:35,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:27:35,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-04 09:27:35,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 09:27:35,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 09:27:35,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 09:27:35,830 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-10-04 09:27:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:27:40,128 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-04 09:27:40,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 09:27:40,128 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-10-04 09:27:40,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:27:40,129 INFO L225 Difference]: With dead ends: 84 [2018-10-04 09:27:40,130 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 09:27:40,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 09:27:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 09:27:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 09:27:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 09:27:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-04 09:27:40,136 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-10-04 09:27:40,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:27:40,136 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-04 09:27:40,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 09:27:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-04 09:27:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-04 09:27:40,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:27:40,137 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-10-04 09:27:40,137 INFO L423 AbstractCegarLoop]: === Iteration 81 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:27:40,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:27:40,138 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-10-04 09:27:40,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:27:40,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:27:40,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:40,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:27:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:27:43,817 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 09:27:43,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:27:43,817 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 09:27:43,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:27:43,852 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:27:43,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:27:43,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:27:43,880 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 09:27:43,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:27:43,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-04 09:27:43,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-04 09:27:43,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-04 09:27:43,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 09:27:43,901 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. Received shutdown request... [2018-10-04 09:27:46,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 09:27:46,929 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 09:27:46,936 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 09:27:46,936 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:27:46 BoogieIcfgContainer [2018-10-04 09:27:46,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:27:46,937 INFO L168 Benchmark]: Toolchain (without parser) took 242889.24 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -95.4 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 344.4 MB). Peak memory consumption was 248.9 MB. Max. memory is 7.1 GB. [2018-10-04 09:27:46,938 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 09:27:46,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.66 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 09:27:46,939 INFO L168 Benchmark]: Boogie Preprocessor took 24.13 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 09:27:46,939 INFO L168 Benchmark]: RCFGBuilder took 232.25 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 09:27:46,940 INFO L168 Benchmark]: TraceAbstraction took 242584.24 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -95.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 323.2 MB). Peak memory consumption was 227.8 MB. Max. memory is 7.1 GB. [2018-10-04 09:27:46,942 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.21 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 44.66 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 24.13 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 232.25 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 242584.24 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -95.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 323.2 MB). Peak memory consumption was 227.8 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 63 states, 83 states before enhancement), while ReachableStatesComputation was computing reachable states (61 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 242.5s OverallTime, 81 OverallIterations, 80 TraceHistogramMax, 123.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 162 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 185302 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 102.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6641 GetRequests, 3240 SyntacticMatches, 80 SemanticMatches, 3321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 110.0s 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.5s SatisfiabilityAnalysisTime, 112.7s 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_09-27-46-951.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_09-27-46-951.csv Completed graceful shutdown