java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:39:43,743 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:39:43,745 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:39:43,757 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:39:43,757 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:39:43,758 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:39:43,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:39:43,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:39:43,763 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:39:43,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:39:43,764 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:39:43,764 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:39:43,765 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:39:43,766 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:39:43,768 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:39:43,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:39:43,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:39:43,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:39:43,773 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:39:43,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:39:43,776 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:39:43,777 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:39:43,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:39:43,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:39:43,780 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:39:43,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:39:43,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:39:43,783 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:39:43,784 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:39:43,785 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:39:43,785 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:39:43,786 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:39:43,786 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:39:43,786 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:39:43,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:39:43,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:39:43,789 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:39:43,807 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:39:43,807 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:39:43,808 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:39:43,810 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:39:43,810 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:39:43,811 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:39:43,811 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:39:43,811 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:39:43,811 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:39:43,812 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:39:43,813 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:39:43,813 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:39:43,813 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:39:43,813 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:39:43,813 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:39:43,814 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:39:43,814 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:39:43,814 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:39:43,814 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:39:43,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:39:43,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:39:43,816 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:39:43,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:39:43,816 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:39:43,817 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:39:43,817 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:39:43,817 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:39:43,817 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:39:43,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:39:43,818 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:39:43,818 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:39:43,884 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:39:43,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:39:43,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:39:43,908 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:39:43,908 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:39:43,909 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl [2018-10-01 00:39:43,910 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl' [2018-10-01 00:39:43,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:39:43,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:39:43,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:39:43,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:39:43,966 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:39:43,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/1) ... [2018-10-01 00:39:43,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/1) ... [2018-10-01 00:39:44,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:39:44,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:39:44,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:39:44,008 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:39:44,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/1) ... [2018-10-01 00:39:44,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/1) ... [2018-10-01 00:39:44,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/1) ... [2018-10-01 00:39:44,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/1) ... [2018-10-01 00:39:44,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/1) ... [2018-10-01 00:39:44,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/1) ... [2018-10-01 00:39:44,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/1) ... [2018-10-01 00:39:44,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:39:44,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:39:44,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:39:44,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:39:44,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:39:44,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:39:44,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:39:44,268 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:39:44,269 INFO L202 PluginConnector]: Adding new model const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:39:44 BoogieIcfgContainer [2018-10-01 00:39:44,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:39:44,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:39:44,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:39:44,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:39:44,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:43" (1/2) ... [2018-10-01 00:39:44,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8b61a1 and model type const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:39:44, skipping insertion in model container [2018-10-01 00:39:44,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:39:44" (2/2) ... [2018-10-01 00:39:44,277 INFO L112 eAbstractionObserver]: Analyzing ICFG const1.i_3.bpl [2018-10-01 00:39:44,287 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:39:44,295 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:39:44,344 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:39:44,345 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:39:44,345 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:39:44,346 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:39:44,346 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:39:44,346 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:39:44,346 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:39:44,346 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:39:44,346 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:39:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-01 00:39:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:39:44,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:44,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:39:44,370 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:44,377 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-01 00:39:44,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:44,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:44,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:44,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:44,569 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:44,569 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:39:44,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:44,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:44,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:44,590 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-01 00:39:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:44,730 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-01 00:39:44,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:44,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-01 00:39:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:44,745 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:39:44,745 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:39:44,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:39:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:39:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 00:39:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:39:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-01 00:39:44,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-01 00:39:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:44,812 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-01 00:39:44,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-01 00:39:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:39:44,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:44,813 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-01 00:39:44,814 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:44,814 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-01 00:39:44,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:44,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:44,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:44,913 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:44,913 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:44,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:44,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:45,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:45,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:39:45,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:39:45,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:39:45,097 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:45,097 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-01 00:39:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:45,204 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-01 00:39:45,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:39:45,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-01 00:39:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:45,206 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:39:45,206 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 00:39:45,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 00:39:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 00:39:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:39:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 00:39:45,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-01 00:39:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:45,212 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-01 00:39:45,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:39:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 00:39:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:39:45,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:45,213 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-01 00:39:45,214 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:45,214 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-01 00:39:45,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:45,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:45,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:45,337 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:45,337 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:45,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:45,376 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:45,377 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:45,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:45,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:45,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:39:45,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:39:45,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:39:45,504 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:45,504 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-01 00:39:45,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:45,878 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-01 00:39:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:39:45,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-01 00:39:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:45,880 INFO L225 Difference]: With dead ends: 13 [2018-10-01 00:39:45,880 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:39:45,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:39:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:39:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:39:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 00:39:45,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-01 00:39:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:45,885 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-01 00:39:45,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:39:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 00:39:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:39:45,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:45,886 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-01 00:39:45,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:45,887 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:45,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-01 00:39:45,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:45,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:45,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:45,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:45,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:45,985 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:45,985 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:45,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:46,043 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:39:46,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:46,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:46,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:46,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:39:46,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:39:46,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:39:46,138 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:46,138 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-01 00:39:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:46,417 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-01 00:39:46,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:39:46,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-01 00:39:46,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:46,419 INFO L225 Difference]: With dead ends: 15 [2018-10-01 00:39:46,419 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:39:46,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:39:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-01 00:39:46,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-01 00:39:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-01 00:39:46,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-01 00:39:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:46,425 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-01 00:39:46,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:39:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-01 00:39:46,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:39:46,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:46,427 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-01 00:39:46,427 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:46,427 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-01 00:39:46,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:46,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:46,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:46,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:46,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:46,551 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:46,552 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:46,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:46,570 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:46,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:46,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:46,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:46,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:39:46,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:39:46,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:39:46,865 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:46,865 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-01 00:39:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:47,291 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-01 00:39:47,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:39:47,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-01 00:39:47,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:47,292 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:39:47,292 INFO L226 Difference]: Without dead ends: 15 [2018-10-01 00:39:47,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:39:47,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-01 00:39:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-01 00:39:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-01 00:39:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-01 00:39:47,298 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-01 00:39:47,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:47,298 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-01 00:39:47,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:39:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-01 00:39:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:39:47,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:47,299 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-01 00:39:47,300 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:47,300 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:47,300 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-01 00:39:47,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:47,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:47,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:47,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:47,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:47,434 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:47,435 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:47,443 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:47,468 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:39:47,468 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:47,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:47,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:47,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:39:47,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:39:47,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:39:47,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:47,555 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-01 00:39:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:47,929 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-01 00:39:47,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:39:47,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-01 00:39:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:47,931 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:39:47,931 INFO L226 Difference]: Without dead ends: 17 [2018-10-01 00:39:47,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-01 00:39:47,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-01 00:39:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-01 00:39:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-01 00:39:47,936 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-01 00:39:47,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:47,937 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-01 00:39:47,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:39:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-01 00:39:47,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:39:47,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:47,938 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-01 00:39:47,938 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:47,938 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:47,939 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-01 00:39:47,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:47,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:47,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:47,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:47,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:48,165 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:48,165 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:48,178 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:48,206 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:39:48,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:48,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:48,326 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:48,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:39:48,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:39:48,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:39:48,327 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:48,327 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-01 00:39:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:48,618 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-01 00:39:48,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:39:48,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-01 00:39:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:48,623 INFO L225 Difference]: With dead ends: 21 [2018-10-01 00:39:48,624 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:39:48,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:39:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-01 00:39:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:39:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-01 00:39:48,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-01 00:39:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:48,631 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-01 00:39:48,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:39:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-01 00:39:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:39:48,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:48,632 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-01 00:39:48,632 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:48,632 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-01 00:39:48,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:48,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:48,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:48,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:48,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:49,023 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:49,024 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:49,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:49,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:49,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:49,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:39:49,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:39:49,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:39:49,138 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:49,138 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-01 00:39:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:49,670 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-01 00:39:49,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:39:49,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-01 00:39:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:49,672 INFO L225 Difference]: With dead ends: 23 [2018-10-01 00:39:49,672 INFO L226 Difference]: Without dead ends: 21 [2018-10-01 00:39:49,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:39:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-01 00:39:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-01 00:39:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:39:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-01 00:39:49,678 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-01 00:39:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:49,678 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-01 00:39:49,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:39:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-01 00:39:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:39:49,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:49,679 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-01 00:39:49,680 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:49,680 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:49,680 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-01 00:39:49,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:49,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:49,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:49,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:49,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:49,852 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:49,853 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:49,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:49,879 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:49,879 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:49,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:49,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:49,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-01 00:39:49,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:39:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:39:49,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:49,968 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-01 00:39:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:50,379 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-01 00:39:50,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:39:50,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:39:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:50,380 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:39:50,381 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 00:39:50,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 00:39:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-01 00:39:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 00:39:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-01 00:39:50,387 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-01 00:39:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:50,387 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-01 00:39:50,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:39:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-01 00:39:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:39:50,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:50,388 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-01 00:39:50,389 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:50,389 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:50,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-01 00:39:50,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:50,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:50,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:50,557 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:50,557 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:50,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:50,689 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-01 00:39:50,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:50,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:50,796 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:50,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-01 00:39:50,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:39:50,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:39:50,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:50,798 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-10-01 00:39:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:51,329 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-01 00:39:51,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:39:51,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-01 00:39:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:51,331 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:39:51,331 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 00:39:51,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 00:39:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-01 00:39:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:39:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-01 00:39:51,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-01 00:39:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:51,337 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-01 00:39:51,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:39:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-01 00:39:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:39:51,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:51,338 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-10-01 00:39:51,338 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:51,338 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:51,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-10-01 00:39:51,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:51,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:51,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:51,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:51,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:51,757 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:51,757 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:51,765 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:51,797 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:51,798 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:51,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:52,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:52,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-01 00:39:52,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:39:52,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:39:52,050 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:52,050 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-10-01 00:39:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:52,855 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-01 00:39:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:39:52,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-10-01 00:39:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:52,857 INFO L225 Difference]: With dead ends: 29 [2018-10-01 00:39:52,857 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:39:52,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:39:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:39:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-01 00:39:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:39:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-01 00:39:52,863 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-01 00:39:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:52,864 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-01 00:39:52,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:39:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-01 00:39:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:39:52,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:52,865 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-10-01 00:39:52,865 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:52,865 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:52,866 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-10-01 00:39:52,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:52,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:52,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:52,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:52,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:53,057 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:53,057 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:53,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:56,715 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-01 00:39:56,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:56,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:56,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:56,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:39:56,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:39:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:39:56,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:56,875 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-01 00:39:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:57,540 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-01 00:39:57,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:39:57,543 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-01 00:39:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:57,543 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:39:57,543 INFO L226 Difference]: Without dead ends: 29 [2018-10-01 00:39:57,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-01 00:39:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-01 00:39:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:39:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-01 00:39:57,549 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-01 00:39:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:57,549 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-01 00:39:57,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:39:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-01 00:39:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:39:57,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:57,550 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-10-01 00:39:57,550 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:57,550 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-10-01 00:39:57,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:57,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:57,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:57,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:57,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:57,815 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:57,815 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:57,833 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:57,945 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:39:57,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:57,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:58,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:58,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:39:58,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:39:58,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:39:58,388 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:58,388 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-10-01 00:39:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:59,207 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-01 00:39:59,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:39:59,207 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-10-01 00:39:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:59,208 INFO L225 Difference]: With dead ends: 33 [2018-10-01 00:39:59,208 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:39:59,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:39:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:39:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-01 00:39:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:39:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-01 00:39:59,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-01 00:39:59,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:59,215 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-01 00:39:59,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:39:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-01 00:39:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:39:59,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:59,216 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-10-01 00:39:59,216 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:59,216 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:59,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-10-01 00:39:59,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:59,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:59,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:59,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:59,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:59,574 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:59,574 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:59,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:59,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:59,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:59,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:39:59,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:39:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:39:59,827 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:59,827 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-01 00:40:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:00,795 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-01 00:40:00,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:40:00,796 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-01 00:40:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:00,797 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:40:00,797 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:40:00,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:40:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-01 00:40:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:40:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-01 00:40:00,804 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-01 00:40:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:00,804 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-01 00:40:00,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:40:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-01 00:40:00,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:40:00,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:00,806 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-10-01 00:40:00,806 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:00,806 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-10-01 00:40:00,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:00,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:00,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:00,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:00,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:01,127 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-01 00:40:01,128 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:01,128 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:01,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:01,198 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:01,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:01,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:01,972 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-01 00:40:02,001 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:02,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:40:02,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:40:02,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:40:02,002 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:02,002 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-10-01 00:40:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:03,045 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-01 00:40:03,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:40:03,045 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-10-01 00:40:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:03,046 INFO L225 Difference]: With dead ends: 37 [2018-10-01 00:40:03,046 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:40:03,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:40:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:40:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:40:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:40:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-01 00:40:03,053 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-01 00:40:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:03,053 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-01 00:40:03,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:40:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-01 00:40:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:40:03,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:03,054 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-10-01 00:40:03,055 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:03,055 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-10-01 00:40:03,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:03,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:03,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:03,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:03,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:03,508 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:03,508 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:03,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:03,782 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-01 00:40:03,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:03,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:03,892 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:03,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:40:03,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:40:03,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:40:03,892 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:03,893 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-10-01 00:40:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:05,026 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-01 00:40:05,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:40:05,029 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-10-01 00:40:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:05,029 INFO L225 Difference]: With dead ends: 39 [2018-10-01 00:40:05,030 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:40:05,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:40:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-01 00:40:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:40:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-01 00:40:05,034 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-01 00:40:05,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:05,034 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-01 00:40:05,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:40:05,035 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-01 00:40:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:40:05,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:05,035 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-10-01 00:40:05,036 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:05,036 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-10-01 00:40:05,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:05,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:05,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:05,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:05,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:05,811 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:05,811 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:05,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:05,836 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:05,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:05,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:05,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:05,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-01 00:40:05,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:40:05,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:40:05,941 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:05,941 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-10-01 00:40:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:07,106 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-01 00:40:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:40:07,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-10-01 00:40:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:07,114 INFO L225 Difference]: With dead ends: 41 [2018-10-01 00:40:07,114 INFO L226 Difference]: Without dead ends: 39 [2018-10-01 00:40:07,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:40:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-01 00:40:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-01 00:40:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-01 00:40:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-01 00:40:07,121 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-01 00:40:07,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:07,122 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-01 00:40:07,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:40:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-01 00:40:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 00:40:07,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:07,123 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-10-01 00:40:07,123 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:07,123 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:07,123 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-10-01 00:40:07,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:07,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:07,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:07,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:07,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:07,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:07,591 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:07,598 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:38,182 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-01 00:40:38,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:38,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:38,333 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:38,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-01 00:40:38,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:40:38,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:40:38,333 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:38,334 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-10-01 00:40:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:39,612 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-01 00:40:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:40:39,612 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-10-01 00:40:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:39,613 INFO L225 Difference]: With dead ends: 43 [2018-10-01 00:40:39,613 INFO L226 Difference]: Without dead ends: 41 [2018-10-01 00:40:39,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-01 00:40:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-01 00:40:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:40:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-01 00:40:39,620 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-01 00:40:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:39,620 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-01 00:40:39,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:40:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-01 00:40:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 00:40:39,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:39,621 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-10-01 00:40:39,621 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:39,622 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:39,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-10-01 00:40:39,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:39,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:39,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:40,166 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:40,166 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:40,174 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:50,160 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 00:40:50,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:50,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:50,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:50,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-01 00:40:50,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:40:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:40:50,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:50,489 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-10-01 00:40:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:52,217 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-01 00:40:52,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:40:52,218 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-10-01 00:40:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:52,219 INFO L225 Difference]: With dead ends: 45 [2018-10-01 00:40:52,219 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:40:52,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:40:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:40:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-01 00:40:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-01 00:40:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-01 00:40:52,224 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-01 00:40:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:52,224 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-01 00:40:52,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:40:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-01 00:40:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 00:40:52,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:52,225 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-10-01 00:40:52,226 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:52,226 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:52,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-10-01 00:40:52,226 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:52,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:52,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:52,544 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:52,544 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:52,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:52,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:52,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:52,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-01 00:40:52,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:40:52,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:40:52,712 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:52,712 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-10-01 00:40:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:54,252 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-01 00:40:54,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:40:54,253 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-10-01 00:40:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:54,254 INFO L225 Difference]: With dead ends: 47 [2018-10-01 00:40:54,254 INFO L226 Difference]: Without dead ends: 45 [2018-10-01 00:40:54,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:40:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-01 00:40:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-01 00:40:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-01 00:40:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-01 00:40:54,261 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-01 00:40:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:54,262 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-01 00:40:54,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:40:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-01 00:40:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 00:40:54,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:54,263 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-10-01 00:40:54,263 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:54,263 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:54,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-10-01 00:40:54,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:54,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:54,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:54,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:54,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:54,633 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:54,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:54,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:54,667 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:54,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:54,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:54,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:54,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-01 00:40:54,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:40:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:40:54,795 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:54,795 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-10-01 00:40:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:56,585 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-01 00:40:56,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:40:56,586 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-10-01 00:40:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:56,587 INFO L225 Difference]: With dead ends: 49 [2018-10-01 00:40:56,587 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 00:40:56,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 00:40:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-01 00:40:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 00:40:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-01 00:40:56,594 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-01 00:40:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:56,595 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-01 00:40:56,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:40:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-01 00:40:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 00:40:56,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:56,595 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-10-01 00:40:56,596 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:56,596 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-10-01 00:40:56,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:56,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:56,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:56,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:56,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:57,763 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:57,763 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:57,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:05,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-01 00:41:05,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:05,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:06,047 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:06,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-01 00:41:06,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:41:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:41:06,047 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:06,048 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-10-01 00:41:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:07,786 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-01 00:41:07,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:41:07,790 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-10-01 00:41:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:07,790 INFO L225 Difference]: With dead ends: 51 [2018-10-01 00:41:07,791 INFO L226 Difference]: Without dead ends: 49 [2018-10-01 00:41:07,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:41:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-01 00:41:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-01 00:41:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-01 00:41:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-01 00:41:07,796 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-01 00:41:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:07,796 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-01 00:41:07,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:41:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-01 00:41:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 00:41:07,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:07,797 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-10-01 00:41:07,797 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:07,797 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:07,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-10-01 00:41:07,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:07,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:07,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:08,835 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:08,835 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:08,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:08,865 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:08,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:08,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:08,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:08,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-01 00:41:08,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-01 00:41:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-01 00:41:08,966 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:08,967 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-10-01 00:41:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:11,049 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-01 00:41:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:41:11,050 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-10-01 00:41:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:11,050 INFO L225 Difference]: With dead ends: 53 [2018-10-01 00:41:11,051 INFO L226 Difference]: Without dead ends: 51 [2018-10-01 00:41:11,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:41:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-01 00:41:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-01 00:41:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-01 00:41:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-01 00:41:11,058 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-01 00:41:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:11,059 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-01 00:41:11,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-01 00:41:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-01 00:41:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 00:41:11,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:11,060 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-10-01 00:41:11,060 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:11,060 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-10-01 00:41:11,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:11,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:11,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:11,615 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:11,622 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:42:35,907 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-01 00:42:35,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:35,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:36,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:36,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-01 00:42:36,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:42:36,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:42:36,246 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:36,246 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-10-01 00:42:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:38,533 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-01 00:42:38,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:42:38,534 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-10-01 00:42:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:38,535 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:42:38,535 INFO L226 Difference]: Without dead ends: 53 [2018-10-01 00:42:38,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:42:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-01 00:42:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-01 00:42:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 00:42:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-01 00:42:38,541 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-01 00:42:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:38,541 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-01 00:42:38,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:42:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-01 00:42:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:42:38,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:38,542 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-10-01 00:42:38,542 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:38,542 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:38,542 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-10-01 00:42:38,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:38,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:38,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:38,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:38,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:39,535 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:39,535 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:39,542 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:43:03,381 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 00:43:03,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:03,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:03,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:03,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-01 00:43:03,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-01 00:43:03,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-01 00:43:03,732 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:03,732 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-10-01 00:43:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:06,067 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-01 00:43:06,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:43:06,067 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-10-01 00:43:06,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:06,068 INFO L225 Difference]: With dead ends: 57 [2018-10-01 00:43:06,068 INFO L226 Difference]: Without dead ends: 55 [2018-10-01 00:43:06,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:43:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-01 00:43:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-01 00:43:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-01 00:43:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-01 00:43:06,077 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-01 00:43:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:06,077 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-01 00:43:06,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-01 00:43:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-01 00:43:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-01 00:43:06,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:06,078 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-10-01 00:43:06,078 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:06,079 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-10-01 00:43:06,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:06,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:06,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:06,841 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:06,841 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:06,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:06,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:07,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:07,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-01 00:43:07,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:43:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:43:07,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:07,030 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-10-01 00:43:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:09,602 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-01 00:43:09,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:43:09,603 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-10-01 00:43:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:09,604 INFO L225 Difference]: With dead ends: 59 [2018-10-01 00:43:09,604 INFO L226 Difference]: Without dead ends: 57 [2018-10-01 00:43:09,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:43:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-01 00:43:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-01 00:43:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-01 00:43:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-01 00:43:09,610 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-01 00:43:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:09,610 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-01 00:43:09,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:43:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-01 00:43:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-01 00:43:09,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:09,611 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-10-01 00:43:09,611 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:09,612 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:09,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-10-01 00:43:09,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:09,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:09,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:09,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:09,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:11,504 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:11,505 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:11,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:43:11,542 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:43:11,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:11,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:11,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:11,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-01 00:43:11,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-01 00:43:11,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-01 00:43:11,688 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:11,688 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-10-01 00:43:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:14,435 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-01 00:43:14,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:43:14,436 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-10-01 00:43:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:14,437 INFO L225 Difference]: With dead ends: 61 [2018-10-01 00:43:14,437 INFO L226 Difference]: Without dead ends: 59 [2018-10-01 00:43:14,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:43:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-01 00:43:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-01 00:43:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 00:43:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-01 00:43:14,442 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-01 00:43:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:14,442 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-01 00:43:14,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-01 00:43:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-01 00:43:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 00:43:14,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:14,443 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-10-01 00:43:14,443 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:14,443 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:14,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-10-01 00:43:14,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:14,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:14,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:14,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:14,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:15,532 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:15,532 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:15,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:43:25,456 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-01 00:43:25,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:25,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:25,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:25,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-01 00:43:25,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:43:25,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:43:25,870 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:25,870 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-10-01 00:43:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:28,669 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-01 00:43:28,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:43:28,669 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-10-01 00:43:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:28,670 INFO L225 Difference]: With dead ends: 63 [2018-10-01 00:43:28,670 INFO L226 Difference]: Without dead ends: 61 [2018-10-01 00:43:28,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:43:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-01 00:43:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-01 00:43:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-01 00:43:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-01 00:43:28,676 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-01 00:43:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:28,677 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-01 00:43:28,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:43:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-01 00:43:28,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-01 00:43:28,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:28,677 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-10-01 00:43:28,678 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:28,678 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:28,678 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-10-01 00:43:28,678 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:28,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:28,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:28,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:29,482 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:29,483 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:29,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:43:29,516 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:43:29,516 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:29,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:29,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:29,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-01 00:43:29,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-01 00:43:29,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-01 00:43:29,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:29,683 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-10-01 00:43:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:32,774 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-01 00:43:32,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:43:32,774 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-10-01 00:43:32,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:32,775 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:43:32,775 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 00:43:32,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:43:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 00:43:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-01 00:43:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:43:32,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-01 00:43:32,782 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-01 00:43:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:32,782 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-01 00:43:32,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-01 00:43:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-01 00:43:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 00:43:32,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:32,783 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-10-01 00:43:32,783 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:32,783 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-10-01 00:43:32,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:32,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:32,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:32,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:32,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:33,444 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:33,444 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:33,451 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:46:10,610 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-01 00:46:10,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:10,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:11,097 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:11,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-01 00:46:11,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:46:11,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:46:11,098 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:11,098 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-10-01 00:46:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:14,410 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-01 00:46:14,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:46:14,411 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-10-01 00:46:14,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:14,411 INFO L225 Difference]: With dead ends: 67 [2018-10-01 00:46:14,412 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:46:14,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:46:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:46:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-01 00:46:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-01 00:46:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-01 00:46:14,416 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-10-01 00:46:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:14,417 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-01 00:46:14,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:46:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-01 00:46:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-01 00:46:14,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:14,417 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-10-01 00:46:14,417 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:14,417 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:14,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-10-01 00:46:14,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:14,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:14,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:14,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:15,362 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:15,363 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:15,372 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:47:24,013 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-01 00:47:24,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:24,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:24,394 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:24,394 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-01 00:47:24,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-01 00:47:24,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-01 00:47:24,395 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:24,395 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-10-01 00:47:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:27,976 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-01 00:47:27,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:47:27,977 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-10-01 00:47:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:27,977 INFO L225 Difference]: With dead ends: 69 [2018-10-01 00:47:27,978 INFO L226 Difference]: Without dead ends: 67 [2018-10-01 00:47:27,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:47:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-01 00:47:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-01 00:47:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 00:47:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-01 00:47:27,983 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-10-01 00:47:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:27,983 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-01 00:47:27,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-01 00:47:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-01 00:47:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:47:27,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:27,984 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-10-01 00:47:27,984 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:27,984 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-10-01 00:47:27,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:27,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:27,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:27,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:29,147 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:29,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:29,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:47:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:29,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:29,571 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:29,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-01 00:47:29,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:47:29,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:47:29,572 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:29,572 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-10-01 00:47:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:33,387 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-01 00:47:33,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:47:33,388 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-10-01 00:47:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:33,389 INFO L225 Difference]: With dead ends: 71 [2018-10-01 00:47:33,389 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 00:47:33,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:47:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 00:47:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-01 00:47:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-01 00:47:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-01 00:47:33,394 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-10-01 00:47:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:33,395 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-01 00:47:33,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:47:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-01 00:47:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 00:47:33,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:33,396 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-10-01 00:47:33,396 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:33,396 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:33,396 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-10-01 00:47:33,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:33,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:33,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:47:33,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:34,776 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:34,776 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:34,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:47:34,816 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:47:34,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:34,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:35,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:35,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-01 00:47:35,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 00:47:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 00:47:35,079 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:35,079 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-10-01 00:47:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:38,947 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-01 00:47:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:47:38,947 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-10-01 00:47:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:38,948 INFO L225 Difference]: With dead ends: 73 [2018-10-01 00:47:38,948 INFO L226 Difference]: Without dead ends: 71 [2018-10-01 00:47:38,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:47:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-01 00:47:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-01 00:47:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-01 00:47:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-01 00:47:38,954 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-10-01 00:47:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:38,955 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-01 00:47:38,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 00:47:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-01 00:47:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-01 00:47:38,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:38,955 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-10-01 00:47:38,956 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:38,956 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-10-01 00:47:38,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:38,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:38,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:39,874 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:39,874 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:39,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:48:15,771 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-01 00:48:15,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:15,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:16,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:16,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-01 00:48:16,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:48:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:48:16,083 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:16,083 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-10-01 00:48:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:20,239 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-01 00:48:20,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:48:20,240 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-10-01 00:48:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:20,241 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:48:20,241 INFO L226 Difference]: Without dead ends: 73 [2018-10-01 00:48:20,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:48:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-01 00:48:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-01 00:48:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 00:48:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-01 00:48:20,247 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-10-01 00:48:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:20,248 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-01 00:48:20,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:48:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-01 00:48:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-01 00:48:20,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:20,249 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-10-01 00:48:20,249 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:20,249 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-10-01 00:48:20,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:20,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:20,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:21,710 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:21,711 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:21,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:48:21,751 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:48:21,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:21,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:21,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:21,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-01 00:48:21,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-01 00:48:21,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-01 00:48:21,924 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:21,924 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-10-01 00:48:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:26,385 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-01 00:48:26,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:48:26,386 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-10-01 00:48:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:26,386 INFO L225 Difference]: With dead ends: 77 [2018-10-01 00:48:26,387 INFO L226 Difference]: Without dead ends: 75 [2018-10-01 00:48:26,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:48:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-01 00:48:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-01 00:48:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 00:48:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-01 00:48:26,393 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-10-01 00:48:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:26,393 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-01 00:48:26,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-01 00:48:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-01 00:48:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-01 00:48:26,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:26,394 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-10-01 00:48:26,394 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:26,395 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:26,395 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-10-01 00:48:26,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:26,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:26,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:26,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:27,380 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:27,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:27,389 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:52:46,147 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-01 00:52:46,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:46,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:46,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:46,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-01 00:52:46,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:52:46,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:52:46,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:46,391 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-10-01 00:52:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:51,119 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-01 00:52:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:52:51,120 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-10-01 00:52:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:51,121 INFO L225 Difference]: With dead ends: 79 [2018-10-01 00:52:51,121 INFO L226 Difference]: Without dead ends: 77 [2018-10-01 00:52:51,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:52:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-01 00:52:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-01 00:52:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-01 00:52:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-01 00:52:51,127 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-10-01 00:52:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:51,127 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-01 00:52:51,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:52:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-01 00:52:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-01 00:52:51,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:51,128 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-10-01 00:52:51,128 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:51,128 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-10-01 00:52:51,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:51,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:51,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:51,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:51,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:52,449 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:52,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:52,456 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown