java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:38:24,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:38:24,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:38:24,757 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:38:24,757 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:38:24,758 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:38:24,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:38:24,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:38:24,763 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:38:24,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:38:24,764 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:38:24,765 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:38:24,765 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:38:24,766 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:38:24,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:38:24,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:38:24,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:38:24,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:38:24,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:38:24,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:38:24,775 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:38:24,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:38:24,779 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:38:24,779 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:38:24,779 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:38:24,780 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:38:24,781 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:38:24,782 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:38:24,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:38:24,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:38:24,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:38:24,788 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:38:24,788 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:38:24,789 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:38:24,790 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:38:24,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:38:24,792 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:38:24,806 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:38:24,806 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:38:24,807 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:38:24,807 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:38:24,810 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:38:24,810 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:38:24,810 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:38:24,811 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:38:24,811 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:38:24,811 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:38:24,811 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:38:24,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:38:24,812 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:38:24,812 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:38:24,812 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:38:24,812 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:38:24,812 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:38:24,813 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:38:24,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:38:24,813 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:38:24,813 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:38:24,813 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:38:24,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:38:24,814 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:38:24,814 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:38:24,814 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:38:24,815 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:38:24,815 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:38:24,815 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:38:24,815 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:38:24,815 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:38:24,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:38:24,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:38:24,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:38:24,901 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:38:24,902 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:38:24,903 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-10-01 00:38:24,903 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl' [2018-10-01 00:38:24,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:38:24,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:38:24,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:38:24,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:38:24,979 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:38:25,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (1/1) ... [2018-10-01 00:38:25,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (1/1) ... [2018-10-01 00:38:25,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:38:25,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:38:25,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:38:25,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:38:25,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (1/1) ... [2018-10-01 00:38:25,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (1/1) ... [2018-10-01 00:38:25,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (1/1) ... [2018-10-01 00:38:25,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (1/1) ... [2018-10-01 00:38:25,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (1/1) ... [2018-10-01 00:38:25,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (1/1) ... [2018-10-01 00:38:25,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (1/1) ... [2018-10-01 00:38:25,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:38:25,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:38:25,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:38:25,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:38:25,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (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:38:25,122 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-01 00:38:25,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:38:25,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:38:25,377 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:38:25,378 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:38:25 BoogieIcfgContainer [2018-10-01 00:38:25,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:38:25,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:38:25,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:38:25,385 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:38:25,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:38:24" (1/2) ... [2018-10-01 00:38:25,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a29a428 and model type nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:38:25, skipping insertion in model container [2018-10-01 00:38:25,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:38:25" (2/2) ... [2018-10-01 00:38:25,390 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-10-01 00:38:25,398 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:38:25,408 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:38:25,466 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:38:25,467 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:38:25,467 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:38:25,467 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:38:25,467 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:38:25,467 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:38:25,468 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:38:25,468 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:38:25,468 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:38:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-01 00:38:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 00:38:25,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:25,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-01 00:38:25,501 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:25,507 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-10-01 00:38:25,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:25,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:25,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:25,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:25,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:25,664 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:38:25,666 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:25,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:38:25,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:38:25,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:38:25,682 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:25,683 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-01 00:38:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:25,889 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-10-01 00:38:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:38:25,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-01 00:38:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:25,909 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:38:25,909 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:38:25,913 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:38:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:38:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-01 00:38:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-01 00:38:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-10-01 00:38:25,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-10-01 00:38:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:25,950 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-10-01 00:38:25,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:38:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-01 00:38:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:38:25,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:25,951 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:38:25,951 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:25,951 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:25,952 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-10-01 00:38:25,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:25,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:25,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:25,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:25,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:25,990 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:38:25,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:38:25,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:38:25,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:38:25,993 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:25,993 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2018-10-01 00:38:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:26,064 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-10-01 00:38:26,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:38:26,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-10-01 00:38:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:26,066 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:38:26,066 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:38:26,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:38:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 00:38:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:38:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-10-01 00:38:26,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-10-01 00:38:26,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:26,072 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-10-01 00:38:26,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:38:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-10-01 00:38:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:38:26,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:26,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-01 00:38:26,073 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:26,074 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-10-01 00:38:26,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:26,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:26,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:26,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:26,150 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:26,150 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:26,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:26,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:26,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:26,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:38:26,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:38:26,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:38:26,239 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:26,239 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-10-01 00:38:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:26,322 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-10-01 00:38:26,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:38:26,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-01 00:38:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:26,323 INFO L225 Difference]: With dead ends: 13 [2018-10-01 00:38:26,324 INFO L226 Difference]: Without dead ends: 8 [2018-10-01 00:38:26,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-01 00:38:26,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-01 00:38:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-01 00:38:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-01 00:38:26,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-10-01 00:38:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:26,328 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-01 00:38:26,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:38:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-01 00:38:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:38:26,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:26,329 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-01 00:38:26,329 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:26,330 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-10-01 00:38:26,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:26,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:26,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:26,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-01 00:38:26,448 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:26,448 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:38:26,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:38:26,485 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:38:26,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:26,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:38:26,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:26,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 7 [2018-10-01 00:38:26,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:38:26,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:38:26,609 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:26,609 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 7 states. [2018-10-01 00:38:27,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:27,396 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2018-10-01 00:38:27,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:38:27,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-01 00:38:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:27,398 INFO L225 Difference]: With dead ends: 24 [2018-10-01 00:38:27,398 INFO L226 Difference]: Without dead ends: 18 [2018-10-01 00:38:27,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:38:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-01 00:38:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-10-01 00:38:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-01 00:38:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-10-01 00:38:27,404 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2018-10-01 00:38:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:27,404 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-10-01 00:38:27,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:38:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-10-01 00:38:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:38:27,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:27,405 INFO L375 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-10-01 00:38:27,405 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:27,406 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 3 times [2018-10-01 00:38:27,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:27,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:27,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:27,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-01 00:38:27,507 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:27,507 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:38:27,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:38:27,534 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-01 00:38:27,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:27,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-01 00:38:27,584 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:27,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:38:27,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:38:27,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:38:27,586 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:27,586 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2018-10-01 00:38:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:28,052 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-10-01 00:38:28,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:38:28,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-01 00:38:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:28,055 INFO L225 Difference]: With dead ends: 24 [2018-10-01 00:38:28,056 INFO L226 Difference]: Without dead ends: 16 [2018-10-01 00:38:28,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-01 00:38:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-01 00:38:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-01 00:38:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-10-01 00:38:28,063 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-10-01 00:38:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:28,063 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-10-01 00:38:28,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:38:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-10-01 00:38:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:38:28,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:28,064 INFO L375 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-10-01 00:38:28,065 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:28,065 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 4 times [2018-10-01 00:38:28,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:28,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:28,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-01 00:38:28,150 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:28,150 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:28,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:38:28,181 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:38:28,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:28,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-01 00:38:28,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:28,285 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 10 [2018-10-01 00:38:28,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:38:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:38:28,286 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:28,286 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 10 states. [2018-10-01 00:38:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:28,801 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-10-01 00:38:28,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:38:28,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-10-01 00:38:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:28,803 INFO L225 Difference]: With dead ends: 40 [2018-10-01 00:38:28,803 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:38:28,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:38:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:38:28,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-10-01 00:38:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:38:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-10-01 00:38:28,810 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-10-01 00:38:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:28,810 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-10-01 00:38:28,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:38:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-10-01 00:38:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:38:28,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:28,812 INFO L375 BasicCegarLoop]: trace histogram [15, 3, 3, 1, 1, 1] [2018-10-01 00:38:28,812 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:28,813 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash 198739950, now seen corresponding path program 5 times [2018-10-01 00:38:28,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:28,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:28,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:28,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-01 00:38:29,018 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:29,018 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:38:29,026 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:38:29,049 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-01 00:38:29,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:29,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-01 00:38:29,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:29,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2018-10-01 00:38:29,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:38:29,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:38:29,208 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:29,209 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 12 states. [2018-10-01 00:38:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:29,763 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-10-01 00:38:29,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:38:29,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-10-01 00:38:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:29,766 INFO L225 Difference]: With dead ends: 60 [2018-10-01 00:38:29,766 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:38:29,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:38:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:38:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-10-01 00:38:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-01 00:38:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-10-01 00:38:29,776 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-10-01 00:38:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:29,776 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-10-01 00:38:29,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:38:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-10-01 00:38:29,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-01 00:38:29,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:29,778 INFO L375 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1] [2018-10-01 00:38:29,778 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:29,778 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:29,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1597467349, now seen corresponding path program 6 times [2018-10-01 00:38:29,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:29,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:29,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:29,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:29,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-10-01 00:38:29,887 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:29,887 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:29,904 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:38:29,970 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-01 00:38:29,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:29,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 251 proven. 21 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-01 00:38:30,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:30,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:38:30,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:38:30,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:38:30,027 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:30,027 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-10-01 00:38:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:30,101 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-10-01 00:38:30,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:38:30,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-10-01 00:38:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:30,102 INFO L225 Difference]: With dead ends: 67 [2018-10-01 00:38:30,102 INFO L226 Difference]: Without dead ends: 40 [2018-10-01 00:38:30,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:38:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-01 00:38:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-01 00:38:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-01 00:38:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-10-01 00:38:30,111 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2018-10-01 00:38:30,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:30,112 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-10-01 00:38:30,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:38:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-10-01 00:38:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 00:38:30,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:30,113 INFO L375 BasicCegarLoop]: trace histogram [28, 4, 4, 1, 1, 1] [2018-10-01 00:38:30,114 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:30,114 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:30,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1404785213, now seen corresponding path program 7 times [2018-10-01 00:38:30,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:30,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:30,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:30,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-01 00:38:30,264 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:30,264 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:38:30,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:30,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-10-01 00:38:30,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:30,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2018-10-01 00:38:30,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:38:30,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:38:30,430 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:30,430 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 15 states. [2018-10-01 00:38:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:31,648 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-10-01 00:38:31,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:38:31,648 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-10-01 00:38:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:31,650 INFO L225 Difference]: With dead ends: 93 [2018-10-01 00:38:31,651 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 00:38:31,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:38:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 00:38:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-10-01 00:38:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-01 00:38:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-10-01 00:38:31,664 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-10-01 00:38:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:31,664 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-10-01 00:38:31,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:38:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-10-01 00:38:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-01 00:38:31,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:31,666 INFO L375 BasicCegarLoop]: trace histogram [40, 5, 5, 1, 1, 1] [2018-10-01 00:38:31,667 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:31,667 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1154943019, now seen corresponding path program 8 times [2018-10-01 00:38:31,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:31,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:31,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:31,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:31,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 825 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-10-01 00:38:31,822 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:31,822 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:38:31,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:38:31,906 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:38:31,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:31,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-10-01 00:38:32,158 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:32,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2018-10-01 00:38:32,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:38:32,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:38:32,159 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:32,159 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 17 states. [2018-10-01 00:38:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:35,668 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-10-01 00:38:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:38:35,670 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-10-01 00:38:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:35,671 INFO L225 Difference]: With dead ends: 123 [2018-10-01 00:38:35,672 INFO L226 Difference]: Without dead ends: 80 [2018-10-01 00:38:35,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:38:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-01 00:38:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-10-01 00:38:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-01 00:38:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-10-01 00:38:35,688 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 53 [2018-10-01 00:38:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:35,688 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-10-01 00:38:35,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:38:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-10-01 00:38:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-01 00:38:35,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:35,691 INFO L375 BasicCegarLoop]: trace histogram [54, 6, 6, 1, 1, 1] [2018-10-01 00:38:35,691 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:35,691 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:35,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2076506525, now seen corresponding path program 9 times [2018-10-01 00:38:35,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:35,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:35,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:35,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:35,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-10-01 00:38:35,852 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:35,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 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:38:35,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:38:35,910 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-01 00:38:35,910 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:35,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-01 00:38:36,035 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:36,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 19 [2018-10-01 00:38:36,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:38:36,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:38:36,036 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:36,036 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 19 states. [2018-10-01 00:38:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:38,467 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-10-01 00:38:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-01 00:38:38,470 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-10-01 00:38:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:38,471 INFO L225 Difference]: With dead ends: 157 [2018-10-01 00:38:38,471 INFO L226 Difference]: Without dead ends: 99 [2018-10-01 00:38:38,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:38:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-01 00:38:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-10-01 00:38:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-01 00:38:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-10-01 00:38:38,487 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 69 [2018-10-01 00:38:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:38,487 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-10-01 00:38:38,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:38:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-10-01 00:38:38,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-01 00:38:38,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:38,489 INFO L375 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-10-01 00:38:38,489 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:38,490 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:38,490 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 10 times [2018-10-01 00:38:38,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:38,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:38,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:38,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:38,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-01 00:38:38,657 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:38,657 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:38,664 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:38:38,739 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:38:38,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:38,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-10-01 00:38:39,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:39,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:38:39,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:38:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:38:39,149 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:39,149 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2018-10-01 00:38:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:39,278 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-10-01 00:38:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:38:39,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-10-01 00:38:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:39,280 INFO L225 Difference]: With dead ends: 113 [2018-10-01 00:38:39,280 INFO L226 Difference]: Without dead ends: 111 [2018-10-01 00:38:39,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:38:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-01 00:38:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-10-01 00:38:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-01 00:38:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-10-01 00:38:39,300 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-10-01 00:38:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:39,300 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-10-01 00:38:39,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:38:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-10-01 00:38:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-01 00:38:39,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:39,302 INFO L375 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-10-01 00:38:39,302 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:39,303 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:39,303 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 11 times [2018-10-01 00:38:39,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:39,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:39,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:39,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:39,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-01 00:38:39,638 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:39,638 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:38:39,648 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:38:39,730 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-01 00:38:39,730 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:39,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-10-01 00:38:39,955 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:39,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-01 00:38:39,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:38:39,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:38:39,956 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:39,957 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2018-10-01 00:38:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:40,123 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-10-01 00:38:40,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:38:40,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-10-01 00:38:40,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:40,125 INFO L225 Difference]: With dead ends: 125 [2018-10-01 00:38:40,125 INFO L226 Difference]: Without dead ends: 123 [2018-10-01 00:38:40,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:38:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-01 00:38:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-10-01 00:38:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-01 00:38:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-10-01 00:38:40,152 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-10-01 00:38:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:40,152 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-10-01 00:38:40,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:38:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-10-01 00:38:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-01 00:38:40,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:40,154 INFO L375 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-10-01 00:38:40,155 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:40,155 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 12 times [2018-10-01 00:38:40,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:40,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:40,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-01 00:38:40,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:40,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:40,414 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:38:40,692 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-10-01 00:38:40,693 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:40,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-10-01 00:38:41,114 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:41,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-01 00:38:41,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:38:41,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:38:41,115 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:41,115 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2018-10-01 00:38:41,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:41,295 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-10-01 00:38:41,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:38:41,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-10-01 00:38:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:41,297 INFO L225 Difference]: With dead ends: 137 [2018-10-01 00:38:41,297 INFO L226 Difference]: Without dead ends: 135 [2018-10-01 00:38:41,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:38:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-01 00:38:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-10-01 00:38:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-01 00:38:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-10-01 00:38:41,333 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-10-01 00:38:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:41,333 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-10-01 00:38:41,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:38:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-10-01 00:38:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-01 00:38:41,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:41,340 INFO L375 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-10-01 00:38:41,340 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:41,340 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 13 times [2018-10-01 00:38:41,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:41,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:41,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:41,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-10-01 00:38:41,602 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:41,602 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:38:41,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:41,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-10-01 00:38:41,903 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:41,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-01 00:38:41,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:38:41,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:38:41,904 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:41,904 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2018-10-01 00:38:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:42,204 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-10-01 00:38:42,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:38:42,206 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-10-01 00:38:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:42,207 INFO L225 Difference]: With dead ends: 149 [2018-10-01 00:38:42,207 INFO L226 Difference]: Without dead ends: 147 [2018-10-01 00:38:42,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:38:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-01 00:38:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-10-01 00:38:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-01 00:38:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-10-01 00:38:42,235 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2018-10-01 00:38:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:42,235 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-10-01 00:38:42,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:38:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-10-01 00:38:42,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-01 00:38:42,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:42,237 INFO L375 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2018-10-01 00:38:42,237 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:42,238 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:42,238 INFO L82 PathProgramCache]: Analyzing trace with hash 804391985, now seen corresponding path program 14 times [2018-10-01 00:38:42,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:42,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:42,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:42,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:42,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-10-01 00:38:42,483 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:42,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 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:38:42,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:38:42,567 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:38:42,567 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:42,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-10-01 00:38:42,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:42,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:38:42,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:38:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:38:42,880 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:42,880 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2018-10-01 00:38:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:43,057 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-10-01 00:38:43,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:38:43,057 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2018-10-01 00:38:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:43,058 INFO L225 Difference]: With dead ends: 161 [2018-10-01 00:38:43,058 INFO L226 Difference]: Without dead ends: 159 [2018-10-01 00:38:43,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:38:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-01 00:38:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-10-01 00:38:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-01 00:38:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-10-01 00:38:43,083 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2018-10-01 00:38:43,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:43,084 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-10-01 00:38:43,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:38:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-10-01 00:38:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-01 00:38:43,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:43,086 INFO L375 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2018-10-01 00:38:43,086 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:43,086 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:43,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1919127163, now seen corresponding path program 15 times [2018-10-01 00:38:43,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:43,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:43,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:43,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-10-01 00:38:43,305 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:43,306 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:38:43,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:38:43,484 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-10-01 00:38:43,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:43,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-10-01 00:38:43,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:43,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:38:43,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:38:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:38:43,756 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:43,756 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2018-10-01 00:38:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:43,952 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-10-01 00:38:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:38:43,953 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-10-01 00:38:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:43,954 INFO L225 Difference]: With dead ends: 173 [2018-10-01 00:38:43,954 INFO L226 Difference]: Without dead ends: 171 [2018-10-01 00:38:43,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:38:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-01 00:38:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-10-01 00:38:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-01 00:38:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2018-10-01 00:38:43,980 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2018-10-01 00:38:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:43,980 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2018-10-01 00:38:43,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:38:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2018-10-01 00:38:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-01 00:38:43,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:43,982 INFO L375 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2018-10-01 00:38:43,983 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:43,983 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:43,983 INFO L82 PathProgramCache]: Analyzing trace with hash 243397061, now seen corresponding path program 16 times [2018-10-01 00:38:43,983 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:43,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:43,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:43,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:43,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-10-01 00:38:45,398 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:45,398 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:45,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:38:45,525 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:38:45,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:45,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-10-01 00:38:46,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:46,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:38:46,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:38:46,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:38:46,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:46,069 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2018-10-01 00:38:46,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:46,267 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-10-01 00:38:46,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:38:46,268 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-10-01 00:38:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:46,269 INFO L225 Difference]: With dead ends: 185 [2018-10-01 00:38:46,269 INFO L226 Difference]: Without dead ends: 183 [2018-10-01 00:38:46,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:38:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-01 00:38:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-10-01 00:38:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-01 00:38:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-10-01 00:38:46,298 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2018-10-01 00:38:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:46,299 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-10-01 00:38:46,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:38:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-10-01 00:38:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-01 00:38:46,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:46,300 INFO L375 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2018-10-01 00:38:46,300 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:46,300 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:46,301 INFO L82 PathProgramCache]: Analyzing trace with hash 184792591, now seen corresponding path program 17 times [2018-10-01 00:38:46,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:46,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:46,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:46,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:46,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-10-01 00:38:46,773 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:46,774 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:38:46,789 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:38:47,015 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2018-10-01 00:38:47,015 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:47,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-10-01 00:38:47,411 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:47,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:38:47,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:38:47,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:38:47,412 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:47,412 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2018-10-01 00:38:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:47,749 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-10-01 00:38:47,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:38:47,750 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2018-10-01 00:38:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:47,751 INFO L225 Difference]: With dead ends: 197 [2018-10-01 00:38:47,751 INFO L226 Difference]: Without dead ends: 195 [2018-10-01 00:38:47,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:38:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-01 00:38:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-10-01 00:38:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-01 00:38:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2018-10-01 00:38:47,785 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2018-10-01 00:38:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:47,785 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2018-10-01 00:38:47,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:38:47,786 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2018-10-01 00:38:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-01 00:38:47,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:47,787 INFO L375 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2018-10-01 00:38:47,787 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:47,787 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:47,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1864410279, now seen corresponding path program 18 times [2018-10-01 00:38:47,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:47,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:47,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:47,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:47,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-10-01 00:38:48,016 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:48,016 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:38:48,024 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:38:48,682 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) [2018-10-01 00:38:48,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:48,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-10-01 00:38:49,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:49,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:38:49,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:38:49,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:38:49,009 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:49,009 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2018-10-01 00:38:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:49,231 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-10-01 00:38:49,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:38:49,231 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-10-01 00:38:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:49,232 INFO L225 Difference]: With dead ends: 209 [2018-10-01 00:38:49,233 INFO L226 Difference]: Without dead ends: 207 [2018-10-01 00:38:49,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:38:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-01 00:38:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2018-10-01 00:38:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-01 00:38:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2018-10-01 00:38:49,274 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2018-10-01 00:38:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:49,274 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2018-10-01 00:38:49,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:38:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2018-10-01 00:38:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-01 00:38:49,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:49,276 INFO L375 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2018-10-01 00:38:49,276 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:49,276 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:49,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1957994077, now seen corresponding path program 19 times [2018-10-01 00:38:49,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:49,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:49,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:49,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:49,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-10-01 00:38:49,650 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:49,650 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:38:49,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:49,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-10-01 00:38:50,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:50,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-01 00:38:50,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:38:50,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:38:50,146 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:50,146 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2018-10-01 00:38:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:50,369 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-10-01 00:38:50,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:38:50,370 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2018-10-01 00:38:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:50,371 INFO L225 Difference]: With dead ends: 221 [2018-10-01 00:38:50,371 INFO L226 Difference]: Without dead ends: 219 [2018-10-01 00:38:50,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:38:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-01 00:38:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2018-10-01 00:38:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-01 00:38:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-10-01 00:38:50,413 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2018-10-01 00:38:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:50,414 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-10-01 00:38:50,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:38:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-10-01 00:38:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-01 00:38:50,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:50,415 INFO L375 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2018-10-01 00:38:50,416 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:50,416 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1203652845, now seen corresponding path program 20 times [2018-10-01 00:38:50,416 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:50,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:50,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:50,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:50,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-10-01 00:38:50,771 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:50,771 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:38:50,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:38:50,895 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:38:50,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:50,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-10-01 00:38:51,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:51,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-01 00:38:51,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:38:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:38:51,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:51,252 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2018-10-01 00:38:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:51,487 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-10-01 00:38:51,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:38:51,489 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-10-01 00:38:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:51,490 INFO L225 Difference]: With dead ends: 233 [2018-10-01 00:38:51,490 INFO L226 Difference]: Without dead ends: 231 [2018-10-01 00:38:51,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:38:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-01 00:38:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-10-01 00:38:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-01 00:38:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-10-01 00:38:51,538 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2018-10-01 00:38:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:51,539 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-10-01 00:38:51,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:38:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-10-01 00:38:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-01 00:38:51,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:51,540 INFO L375 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2018-10-01 00:38:51,540 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:51,540 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:51,540 INFO L82 PathProgramCache]: Analyzing trace with hash 367956279, now seen corresponding path program 21 times [2018-10-01 00:38:51,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:51,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:51,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:51,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:51,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-01 00:38:51,783 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:51,783 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:38:51,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:38:52,066 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 109 check-sat command(s) [2018-10-01 00:38:52,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:52,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-10-01 00:38:52,650 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:52,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-01 00:38:52,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:38:52,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:38:52,651 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:52,651 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2018-10-01 00:38:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:52,967 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-10-01 00:38:52,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:38:52,967 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2018-10-01 00:38:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:52,968 INFO L225 Difference]: With dead ends: 245 [2018-10-01 00:38:52,968 INFO L226 Difference]: Without dead ends: 243 [2018-10-01 00:38:52,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:38:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-01 00:38:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-10-01 00:38:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-01 00:38:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-10-01 00:38:53,018 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2018-10-01 00:38:53,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:53,018 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-10-01 00:38:53,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:38:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-10-01 00:38:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-01 00:38:53,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:53,020 INFO L375 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2018-10-01 00:38:53,020 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:53,020 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:53,021 INFO L82 PathProgramCache]: Analyzing trace with hash -405620095, now seen corresponding path program 22 times [2018-10-01 00:38:53,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:53,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:53,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:53,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:53,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-10-01 00:38:53,712 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:53,712 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:38:53,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:38:53,835 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:38:53,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:53,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-10-01 00:38:54,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:54,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-01 00:38:54,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:38:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:38:54,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:54,221 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2018-10-01 00:38:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:54,444 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-10-01 00:38:54,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:38:54,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2018-10-01 00:38:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:54,446 INFO L225 Difference]: With dead ends: 257 [2018-10-01 00:38:54,447 INFO L226 Difference]: Without dead ends: 255 [2018-10-01 00:38:54,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:38:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-01 00:38:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2018-10-01 00:38:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-01 00:38:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-10-01 00:38:54,516 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2018-10-01 00:38:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:54,517 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-10-01 00:38:54,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:38:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-10-01 00:38:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-01 00:38:54,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:54,518 INFO L375 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2018-10-01 00:38:54,519 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:54,519 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:54,519 INFO L82 PathProgramCache]: Analyzing trace with hash -241089333, now seen corresponding path program 23 times [2018-10-01 00:38:54,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:54,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:54,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:54,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-10-01 00:38:54,864 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:54,864 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:38:54,873 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:38:55,153 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 121 check-sat command(s) [2018-10-01 00:38:55,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:55,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-10-01 00:38:55,576 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:55,576 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-01 00:38:55,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:38:55,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:38:55,577 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:55,577 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2018-10-01 00:38:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:55,848 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-10-01 00:38:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:38:55,848 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2018-10-01 00:38:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:55,850 INFO L225 Difference]: With dead ends: 269 [2018-10-01 00:38:55,850 INFO L226 Difference]: Without dead ends: 267 [2018-10-01 00:38:55,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:38:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-01 00:38:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-10-01 00:38:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-01 00:38:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2018-10-01 00:38:55,906 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2018-10-01 00:38:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:55,907 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2018-10-01 00:38:55,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:38:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2018-10-01 00:38:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-01 00:38:55,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:55,908 INFO L375 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2018-10-01 00:38:55,909 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:55,909 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1238413333, now seen corresponding path program 24 times [2018-10-01 00:38:55,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:55,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:55,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-10-01 00:38:56,233 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:56,233 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:38:56,240 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:38:56,542 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 123 check-sat command(s) [2018-10-01 00:38:56,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:38:56,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:38:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-10-01 00:38:57,085 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:38:57,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-01 00:38:57,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:38:57,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:38:57,086 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:38:57,086 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2018-10-01 00:38:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:38:58,776 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-10-01 00:38:58,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:38:58,777 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2018-10-01 00:38:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:38:58,778 INFO L225 Difference]: With dead ends: 281 [2018-10-01 00:38:58,778 INFO L226 Difference]: Without dead ends: 279 [2018-10-01 00:38:58,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:38:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-01 00:38:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-10-01 00:38:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-01 00:38:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2018-10-01 00:38:58,872 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2018-10-01 00:38:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:38:58,873 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2018-10-01 00:38:58,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:38:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2018-10-01 00:38:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-01 00:38:58,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:38:58,874 INFO L375 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2018-10-01 00:38:58,875 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:38:58,875 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:38:58,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1994949537, now seen corresponding path program 25 times [2018-10-01 00:38:58,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:38:58,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:38:58,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:58,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:38:58,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:38:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-10-01 00:38:59,513 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:38:59,513 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:38:59,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:38:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:38:59,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-10-01 00:39:01,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:01,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-01 00:39:01,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-01 00:39:01,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-01 00:39:01,071 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:01,071 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2018-10-01 00:39:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:01,332 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2018-10-01 00:39:01,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:39:01,332 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2018-10-01 00:39:01,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:01,334 INFO L225 Difference]: With dead ends: 293 [2018-10-01 00:39:01,334 INFO L226 Difference]: Without dead ends: 291 [2018-10-01 00:39:01,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:39:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-01 00:39:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2018-10-01 00:39:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-01 00:39:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-10-01 00:39:01,428 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2018-10-01 00:39:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:01,428 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-10-01 00:39:01,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-01 00:39:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-10-01 00:39:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-01 00:39:01,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:01,430 INFO L375 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2018-10-01 00:39:01,430 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:01,430 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1785473449, now seen corresponding path program 26 times [2018-10-01 00:39:01,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:01,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:01,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:01,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:01,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-10-01 00:39:02,183 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:02,183 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:39:02,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:02,345 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:02,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:02,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-10-01 00:39:03,971 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:03,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-01 00:39:03,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:39:03,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:39:03,973 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:03,973 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2018-10-01 00:39:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:04,595 INFO L93 Difference]: Finished difference Result 305 states and 330 transitions. [2018-10-01 00:39:04,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:39:04,596 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2018-10-01 00:39:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:04,597 INFO L225 Difference]: With dead ends: 305 [2018-10-01 00:39:04,598 INFO L226 Difference]: Without dead ends: 303 [2018-10-01 00:39:04,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:39:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-01 00:39:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-10-01 00:39:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-01 00:39:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2018-10-01 00:39:04,677 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2018-10-01 00:39:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:04,678 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2018-10-01 00:39:04,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:39:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2018-10-01 00:39:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-01 00:39:04,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:04,679 INFO L375 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2018-10-01 00:39:04,679 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:04,680 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:04,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1795504115, now seen corresponding path program 27 times [2018-10-01 00:39:04,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:04,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:04,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:04,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-10-01 00:39:05,099 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:05,100 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:05,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:05,899 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 145 check-sat command(s) [2018-10-01 00:39:05,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:05,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:06,429 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-10-01 00:39:06,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:06,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-01 00:39:06,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-01 00:39:06,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-01 00:39:06,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:06,452 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2018-10-01 00:39:06,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:06,847 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-10-01 00:39:06,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:39:06,847 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2018-10-01 00:39:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:06,849 INFO L225 Difference]: With dead ends: 317 [2018-10-01 00:39:06,849 INFO L226 Difference]: Without dead ends: 315 [2018-10-01 00:39:06,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:39:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-01 00:39:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2018-10-01 00:39:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-01 00:39:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-10-01 00:39:06,969 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2018-10-01 00:39:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:06,969 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-10-01 00:39:06,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-01 00:39:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-10-01 00:39:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-01 00:39:06,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:06,974 INFO L375 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2018-10-01 00:39:06,975 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:06,975 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1784227645, now seen corresponding path program 28 times [2018-10-01 00:39:06,975 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:06,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:06,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:06,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-10-01 00:39:07,593 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:07,594 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:39:07,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:07,763 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:07,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:07,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-10-01 00:39:08,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:08,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-01 00:39:08,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:39:08,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:39:08,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:08,683 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2018-10-01 00:39:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:09,131 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-10-01 00:39:09,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:39:09,131 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2018-10-01 00:39:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:09,132 INFO L225 Difference]: With dead ends: 329 [2018-10-01 00:39:09,133 INFO L226 Difference]: Without dead ends: 327 [2018-10-01 00:39:09,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:39:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-01 00:39:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2018-10-01 00:39:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-01 00:39:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-10-01 00:39:09,234 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2018-10-01 00:39:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:09,234 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-10-01 00:39:09,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:39:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-10-01 00:39:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-01 00:39:09,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:09,236 INFO L375 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2018-10-01 00:39:09,236 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:09,237 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:09,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1243510663, now seen corresponding path program 29 times [2018-10-01 00:39:09,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:09,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-10-01 00:39:09,660 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:09,660 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:39:09,667 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:10,149 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 157 check-sat command(s) [2018-10-01 00:39:10,150 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:10,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-10-01 00:39:10,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:10,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-01 00:39:10,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-01 00:39:10,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-01 00:39:10,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:10,706 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2018-10-01 00:39:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:11,129 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-10-01 00:39:11,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:39:11,130 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2018-10-01 00:39:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:11,131 INFO L225 Difference]: With dead ends: 341 [2018-10-01 00:39:11,131 INFO L226 Difference]: Without dead ends: 339 [2018-10-01 00:39:11,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:39:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-01 00:39:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2018-10-01 00:39:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-01 00:39:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2018-10-01 00:39:11,236 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2018-10-01 00:39:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:11,237 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-10-01 00:39:11,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-01 00:39:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2018-10-01 00:39:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-01 00:39:11,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:11,238 INFO L375 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2018-10-01 00:39:11,238 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:11,239 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1907644207, now seen corresponding path program 30 times [2018-10-01 00:39:11,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:11,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:11,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:11,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:11,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-10-01 00:39:12,380 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:12,380 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:39:12,388 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:12,824 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 158 check-sat command(s) [2018-10-01 00:39:12,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:12,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-10-01 00:39:13,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:13,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-01 00:39:13,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:39:13,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:39:13,784 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:13,784 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2018-10-01 00:39:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:14,210 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-10-01 00:39:14,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:39:14,210 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2018-10-01 00:39:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:14,212 INFO L225 Difference]: With dead ends: 353 [2018-10-01 00:39:14,212 INFO L226 Difference]: Without dead ends: 351 [2018-10-01 00:39:14,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:39:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-01 00:39:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2018-10-01 00:39:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-01 00:39:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-10-01 00:39:14,318 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2018-10-01 00:39:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:14,318 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-10-01 00:39:14,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:39:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-10-01 00:39:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-01 00:39:14,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:14,321 INFO L375 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2018-10-01 00:39:14,321 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:14,321 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash -48809189, now seen corresponding path program 31 times [2018-10-01 00:39:14,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:14,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:14,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-10-01 00:39:15,404 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:15,404 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:39:15,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:15,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-10-01 00:39:16,849 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:16,850 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-01 00:39:16,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-01 00:39:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-01 00:39:16,850 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:16,851 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2018-10-01 00:39:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:17,301 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-10-01 00:39:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:39:17,301 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2018-10-01 00:39:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:17,303 INFO L225 Difference]: With dead ends: 365 [2018-10-01 00:39:17,303 INFO L226 Difference]: Without dead ends: 363 [2018-10-01 00:39:17,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:39:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-01 00:39:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2018-10-01 00:39:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-10-01 00:39:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2018-10-01 00:39:17,423 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2018-10-01 00:39:17,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:17,424 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2018-10-01 00:39:17,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-01 00:39:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2018-10-01 00:39:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-01 00:39:17,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:17,426 INFO L375 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2018-10-01 00:39:17,426 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:17,426 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1056419429, now seen corresponding path program 32 times [2018-10-01 00:39:17,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:17,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:17,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:17,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-10-01 00:39:17,840 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:17,840 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:39:17,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:18,055 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:18,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:18,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-10-01 00:39:18,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:18,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-01 00:39:18,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:39:18,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:39:18,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:18,965 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2018-10-01 00:39:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:19,375 INFO L93 Difference]: Finished difference Result 377 states and 408 transitions. [2018-10-01 00:39:19,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:39:19,376 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2018-10-01 00:39:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:19,377 INFO L225 Difference]: With dead ends: 377 [2018-10-01 00:39:19,377 INFO L226 Difference]: Without dead ends: 375 [2018-10-01 00:39:19,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:39:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-01 00:39:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2018-10-01 00:39:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-01 00:39:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2018-10-01 00:39:19,503 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2018-10-01 00:39:19,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:19,503 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2018-10-01 00:39:19,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:39:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2018-10-01 00:39:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-01 00:39:19,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:19,506 INFO L375 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2018-10-01 00:39:19,506 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:19,506 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2124645039, now seen corresponding path program 33 times [2018-10-01 00:39:19,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:19,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:19,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-10-01 00:39:19,958 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:19,958 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:19,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:20,532 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 181 check-sat command(s) [2018-10-01 00:39:20,532 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:20,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-10-01 00:39:21,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:21,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-01 00:39:21,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-01 00:39:21,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-01 00:39:21,179 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:21,179 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2018-10-01 00:39:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:21,716 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-10-01 00:39:21,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:39:21,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2018-10-01 00:39:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:21,718 INFO L225 Difference]: With dead ends: 389 [2018-10-01 00:39:21,718 INFO L226 Difference]: Without dead ends: 387 [2018-10-01 00:39:21,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:39:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-01 00:39:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-10-01 00:39:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-01 00:39:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2018-10-01 00:39:21,832 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2018-10-01 00:39:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:21,833 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2018-10-01 00:39:21,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-01 00:39:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2018-10-01 00:39:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-01 00:39:21,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:21,834 INFO L375 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2018-10-01 00:39:21,835 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:21,835 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash 152123385, now seen corresponding path program 34 times [2018-10-01 00:39:21,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:21,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:21,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:21,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:21,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-10-01 00:39:22,289 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:22,289 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:39:22,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:22,501 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:22,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:22,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-10-01 00:39:23,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:23,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-01 00:39:23,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:39:23,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:39:23,150 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:23,151 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2018-10-01 00:39:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:23,780 INFO L93 Difference]: Finished difference Result 401 states and 434 transitions. [2018-10-01 00:39:23,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:39:23,780 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2018-10-01 00:39:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:23,782 INFO L225 Difference]: With dead ends: 401 [2018-10-01 00:39:23,783 INFO L226 Difference]: Without dead ends: 399 [2018-10-01 00:39:23,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:39:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-01 00:39:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2018-10-01 00:39:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-01 00:39:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2018-10-01 00:39:23,935 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2018-10-01 00:39:23,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:23,936 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2018-10-01 00:39:23,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:39:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2018-10-01 00:39:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-01 00:39:23,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:23,938 INFO L375 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2018-10-01 00:39:23,938 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:23,939 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -310948285, now seen corresponding path program 35 times [2018-10-01 00:39:23,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:23,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:23,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-10-01 00:39:24,434 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:24,434 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:39:24,442 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:25,096 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 193 check-sat command(s) [2018-10-01 00:39:25,096 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:25,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-10-01 00:39:25,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:25,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-01 00:39:25,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 00:39:25,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 00:39:25,806 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:25,806 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2018-10-01 00:39:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:26,336 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-10-01 00:39:26,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:39:26,336 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2018-10-01 00:39:26,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:26,338 INFO L225 Difference]: With dead ends: 413 [2018-10-01 00:39:26,338 INFO L226 Difference]: Without dead ends: 411 [2018-10-01 00:39:26,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:39:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-01 00:39:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2018-10-01 00:39:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-01 00:39:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2018-10-01 00:39:26,471 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2018-10-01 00:39:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:26,471 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2018-10-01 00:39:26,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 00:39:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2018-10-01 00:39:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-01 00:39:26,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:26,474 INFO L375 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2018-10-01 00:39:26,474 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:26,474 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:26,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1655945843, now seen corresponding path program 36 times [2018-10-01 00:39:26,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:26,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:26,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-10-01 00:39:27,080 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:27,080 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:39:27,088 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:27,723 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 195 check-sat command(s) [2018-10-01 00:39:27,723 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:27,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-10-01 00:39:28,644 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:28,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-01 00:39:28,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:39:28,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:39:28,645 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:28,645 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2018-10-01 00:39:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:29,186 INFO L93 Difference]: Finished difference Result 425 states and 460 transitions. [2018-10-01 00:39:29,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:39:29,187 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2018-10-01 00:39:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:29,188 INFO L225 Difference]: With dead ends: 425 [2018-10-01 00:39:29,188 INFO L226 Difference]: Without dead ends: 423 [2018-10-01 00:39:29,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:39:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-01 00:39:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2018-10-01 00:39:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-10-01 00:39:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2018-10-01 00:39:29,354 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2018-10-01 00:39:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:29,354 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2018-10-01 00:39:29,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:39:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2018-10-01 00:39:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-01 00:39:29,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:29,356 INFO L375 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2018-10-01 00:39:29,356 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:29,357 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:29,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1941529129, now seen corresponding path program 37 times [2018-10-01 00:39:29,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:29,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:29,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:29,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:29,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-10-01 00:39:29,956 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:29,956 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:29,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:30,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-10-01 00:39:30,904 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:30,904 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-01 00:39:30,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-01 00:39:30,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-01 00:39:30,905 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:30,905 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2018-10-01 00:39:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:31,463 INFO L93 Difference]: Finished difference Result 437 states and 473 transitions. [2018-10-01 00:39:31,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:39:31,464 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2018-10-01 00:39:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:31,465 INFO L225 Difference]: With dead ends: 437 [2018-10-01 00:39:31,465 INFO L226 Difference]: Without dead ends: 435 [2018-10-01 00:39:31,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:39:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-01 00:39:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-10-01 00:39:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-01 00:39:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-10-01 00:39:31,612 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2018-10-01 00:39:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:31,612 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-10-01 00:39:31,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-01 00:39:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-10-01 00:39:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-10-01 00:39:31,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:31,615 INFO L375 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2018-10-01 00:39:31,615 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:31,615 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:31,615 INFO L82 PathProgramCache]: Analyzing trace with hash -799221983, now seen corresponding path program 38 times [2018-10-01 00:39:31,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:31,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:31,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:31,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:31,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-10-01 00:39:32,182 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:32,182 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:32,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:32,416 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:32,416 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:32,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-10-01 00:39:33,634 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:33,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-01 00:39:33,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:39:33,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:39:33,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:33,635 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2018-10-01 00:39:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:34,299 INFO L93 Difference]: Finished difference Result 449 states and 486 transitions. [2018-10-01 00:39:34,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:39:34,300 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2018-10-01 00:39:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:34,301 INFO L225 Difference]: With dead ends: 449 [2018-10-01 00:39:34,302 INFO L226 Difference]: Without dead ends: 447 [2018-10-01 00:39:34,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:39:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-01 00:39:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2018-10-01 00:39:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-01 00:39:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2018-10-01 00:39:34,469 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2018-10-01 00:39:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:34,469 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2018-10-01 00:39:34,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:39:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2018-10-01 00:39:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-01 00:39:34,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:34,472 INFO L375 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2018-10-01 00:39:34,472 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:34,473 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1044024981, now seen corresponding path program 39 times [2018-10-01 00:39:34,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:34,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:34,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-01 00:39:35,068 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:35,069 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:35,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:35,856 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 217 check-sat command(s) [2018-10-01 00:39:35,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:35,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-10-01 00:39:36,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:36,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-01 00:39:36,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-01 00:39:36,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-01 00:39:36,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:36,611 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2018-10-01 00:39:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:37,194 INFO L93 Difference]: Finished difference Result 461 states and 499 transitions. [2018-10-01 00:39:37,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:39:37,195 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2018-10-01 00:39:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:37,196 INFO L225 Difference]: With dead ends: 461 [2018-10-01 00:39:37,196 INFO L226 Difference]: Without dead ends: 459 [2018-10-01 00:39:37,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:39:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-01 00:39:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2018-10-01 00:39:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-10-01 00:39:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2018-10-01 00:39:37,374 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2018-10-01 00:39:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:37,374 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2018-10-01 00:39:37,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-01 00:39:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2018-10-01 00:39:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-10-01 00:39:37,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:37,376 INFO L375 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2018-10-01 00:39:37,377 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:37,377 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:37,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1695093579, now seen corresponding path program 40 times [2018-10-01 00:39:37,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:37,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:37,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:37,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:37,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-10-01 00:39:37,942 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:37,942 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:38,203 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:38,203 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:38,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-10-01 00:39:39,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:39,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-01 00:39:39,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-01 00:39:39,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-01 00:39:39,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:39,294 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2018-10-01 00:39:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:39,974 INFO L93 Difference]: Finished difference Result 473 states and 512 transitions. [2018-10-01 00:39:39,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 00:39:39,974 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2018-10-01 00:39:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:39,976 INFO L225 Difference]: With dead ends: 473 [2018-10-01 00:39:39,976 INFO L226 Difference]: Without dead ends: 471 [2018-10-01 00:39:39,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:39:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-01 00:39:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2018-10-01 00:39:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-01 00:39:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2018-10-01 00:39:40,206 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2018-10-01 00:39:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:40,207 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2018-10-01 00:39:40,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-01 00:39:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2018-10-01 00:39:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-01 00:39:40,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:40,209 INFO L375 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2018-10-01 00:39:40,210 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:40,210 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:40,210 INFO L82 PathProgramCache]: Analyzing trace with hash 413649151, now seen corresponding path program 41 times [2018-10-01 00:39:40,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:40,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:40,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:40,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:40,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-10-01 00:39:40,753 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:40,753 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:40,760 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:41,623 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 229 check-sat command(s) [2018-10-01 00:39:41,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:41,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-10-01 00:39:42,434 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:42,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-01 00:39:42,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-01 00:39:42,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-01 00:39:42,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:42,436 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2018-10-01 00:39:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:43,249 INFO L93 Difference]: Finished difference Result 485 states and 525 transitions. [2018-10-01 00:39:43,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:39:43,250 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2018-10-01 00:39:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:43,252 INFO L225 Difference]: With dead ends: 485 [2018-10-01 00:39:43,252 INFO L226 Difference]: Without dead ends: 483 [2018-10-01 00:39:43,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:39:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-10-01 00:39:43,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2018-10-01 00:39:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-01 00:39:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2018-10-01 00:39:43,470 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2018-10-01 00:39:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:43,470 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2018-10-01 00:39:43,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-01 00:39:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2018-10-01 00:39:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-10-01 00:39:43,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:43,472 INFO L375 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2018-10-01 00:39:43,472 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:43,473 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:43,473 INFO L82 PathProgramCache]: Analyzing trace with hash 432965193, now seen corresponding path program 42 times [2018-10-01 00:39:43,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:43,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:43,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:43,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:43,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-10-01 00:39:44,282 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:44,282 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:44,290 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:45,241 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 230 check-sat command(s) [2018-10-01 00:39:45,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:45,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-10-01 00:39:46,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:46,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-01 00:39:46,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-01 00:39:46,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-01 00:39:46,071 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:46,071 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2018-10-01 00:39:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:46,802 INFO L93 Difference]: Finished difference Result 497 states and 538 transitions. [2018-10-01 00:39:46,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:39:46,802 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2018-10-01 00:39:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:46,804 INFO L225 Difference]: With dead ends: 497 [2018-10-01 00:39:46,804 INFO L226 Difference]: Without dead ends: 495 [2018-10-01 00:39:46,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:39:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-01 00:39:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2018-10-01 00:39:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-01 00:39:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2018-10-01 00:39:47,008 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2018-10-01 00:39:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:47,008 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2018-10-01 00:39:47,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-01 00:39:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2018-10-01 00:39:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-10-01 00:39:47,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:47,011 INFO L375 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2018-10-01 00:39:47,011 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:47,011 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:47,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1067558035, now seen corresponding path program 43 times [2018-10-01 00:39:47,012 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:47,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:47,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:47,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:47,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-10-01 00:39:47,446 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:47,446 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:47,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:47,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-10-01 00:39:48,644 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:48,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-01 00:39:48,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-01 00:39:48,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-01 00:39:48,646 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:48,646 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2018-10-01 00:39:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:49,456 INFO L93 Difference]: Finished difference Result 509 states and 551 transitions. [2018-10-01 00:39:49,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:39:49,457 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2018-10-01 00:39:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:49,458 INFO L225 Difference]: With dead ends: 509 [2018-10-01 00:39:49,459 INFO L226 Difference]: Without dead ends: 507 [2018-10-01 00:39:49,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:39:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-10-01 00:39:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2018-10-01 00:39:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-10-01 00:39:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2018-10-01 00:39:49,667 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2018-10-01 00:39:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:49,667 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2018-10-01 00:39:49,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-01 00:39:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2018-10-01 00:39:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-10-01 00:39:49,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:49,669 INFO L375 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2018-10-01 00:39:49,669 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:49,669 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1919441955, now seen corresponding path program 44 times [2018-10-01 00:39:49,670 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:49,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:49,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-10-01 00:39:50,124 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:50,124 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:50,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:50,401 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:50,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:50,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-10-01 00:39:51,321 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:51,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-01 00:39:51,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-01 00:39:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-01 00:39:51,323 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:51,323 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2018-10-01 00:39:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:52,047 INFO L93 Difference]: Finished difference Result 521 states and 564 transitions. [2018-10-01 00:39:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 00:39:52,047 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2018-10-01 00:39:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:52,049 INFO L225 Difference]: With dead ends: 521 [2018-10-01 00:39:52,049 INFO L226 Difference]: Without dead ends: 519 [2018-10-01 00:39:52,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:39:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-10-01 00:39:52,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2018-10-01 00:39:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-10-01 00:39:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2018-10-01 00:39:52,262 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2018-10-01 00:39:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:52,262 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2018-10-01 00:39:52,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-01 00:39:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2018-10-01 00:39:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-10-01 00:39:52,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:52,264 INFO L375 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2018-10-01 00:39:52,265 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:52,265 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:52,265 INFO L82 PathProgramCache]: Analyzing trace with hash 157746215, now seen corresponding path program 45 times [2018-10-01 00:39:52,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:52,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:52,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:52,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:52,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-10-01 00:39:52,737 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:52,737 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:52,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:53,899 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 253 check-sat command(s) [2018-10-01 00:39:53,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:53,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-10-01 00:39:54,989 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:54,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-01 00:39:54,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-01 00:39:54,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-01 00:39:54,991 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:54,991 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2018-10-01 00:39:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:55,978 INFO L93 Difference]: Finished difference Result 533 states and 577 transitions. [2018-10-01 00:39:55,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 00:39:55,983 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2018-10-01 00:39:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:55,985 INFO L225 Difference]: With dead ends: 533 [2018-10-01 00:39:55,985 INFO L226 Difference]: Without dead ends: 531 [2018-10-01 00:39:55,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:39:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-01 00:39:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2018-10-01 00:39:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-01 00:39:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2018-10-01 00:39:56,261 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2018-10-01 00:39:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:56,261 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2018-10-01 00:39:56,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-01 00:39:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2018-10-01 00:39:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-01 00:39:56,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:56,263 INFO L375 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2018-10-01 00:39:56,264 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:56,264 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:56,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1527137649, now seen corresponding path program 46 times [2018-10-01 00:39:56,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:56,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:56,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:56,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:56,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-10-01 00:39:56,737 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:56,737 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:56,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:57,028 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:57,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:57,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-10-01 00:39:57,971 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:57,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-01 00:39:57,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 00:39:57,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 00:39:57,973 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:57,973 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2018-10-01 00:39:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:58,989 INFO L93 Difference]: Finished difference Result 545 states and 590 transitions. [2018-10-01 00:39:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 00:39:58,993 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2018-10-01 00:39:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:58,995 INFO L225 Difference]: With dead ends: 545 [2018-10-01 00:39:58,995 INFO L226 Difference]: Without dead ends: 543 [2018-10-01 00:39:58,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:39:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-10-01 00:39:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2018-10-01 00:39:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-10-01 00:39:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2018-10-01 00:39:59,292 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2018-10-01 00:39:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:59,292 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2018-10-01 00:39:59,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 00:39:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2018-10-01 00:39:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-10-01 00:39:59,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:59,295 INFO L375 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2018-10-01 00:39:59,295 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:59,295 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1823205307, now seen corresponding path program 47 times [2018-10-01 00:39:59,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:59,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:59,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:59,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:59,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-10-01 00:39:59,830 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:59,830 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:39:59,837 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:00,912 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 265 check-sat command(s) [2018-10-01 00:40:00,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:00,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-10-01 00:40:01,844 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:01,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-01 00:40:01,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-01 00:40:01,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-01 00:40:01,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:01,845 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2018-10-01 00:40:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:02,673 INFO L93 Difference]: Finished difference Result 557 states and 603 transitions. [2018-10-01 00:40:02,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:40:02,673 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2018-10-01 00:40:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:02,675 INFO L225 Difference]: With dead ends: 557 [2018-10-01 00:40:02,675 INFO L226 Difference]: Without dead ends: 555 [2018-10-01 00:40:02,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:40:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-10-01 00:40:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2018-10-01 00:40:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-01 00:40:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2018-10-01 00:40:02,955 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2018-10-01 00:40:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:02,956 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2018-10-01 00:40:02,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-01 00:40:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2018-10-01 00:40:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-10-01 00:40:02,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:02,958 INFO L375 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2018-10-01 00:40:02,958 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:02,958 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash 181299973, now seen corresponding path program 48 times [2018-10-01 00:40:02,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:02,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:02,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-10-01 00:40:03,505 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:03,506 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:03,513 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:04,655 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 267 check-sat command(s) [2018-10-01 00:40:04,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:04,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-10-01 00:40:05,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:05,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-01 00:40:05,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 00:40:05,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 00:40:05,640 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:05,640 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2018-10-01 00:40:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:06,477 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-10-01 00:40:06,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:40:06,478 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2018-10-01 00:40:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:06,480 INFO L225 Difference]: With dead ends: 569 [2018-10-01 00:40:06,480 INFO L226 Difference]: Without dead ends: 567 [2018-10-01 00:40:06,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:40:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-10-01 00:40:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2018-10-01 00:40:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-10-01 00:40:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2018-10-01 00:40:06,741 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2018-10-01 00:40:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:06,741 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2018-10-01 00:40:06,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 00:40:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2018-10-01 00:40:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-10-01 00:40:06,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:06,744 INFO L375 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2018-10-01 00:40:06,744 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:06,744 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2077995185, now seen corresponding path program 49 times [2018-10-01 00:40:06,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:06,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:06,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:06,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:06,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-10-01 00:40:07,262 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:07,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:07,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:07,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-10-01 00:40:08,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:08,565 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-01 00:40:08,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-01 00:40:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-01 00:40:08,566 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:08,566 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2018-10-01 00:40:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:09,478 INFO L93 Difference]: Finished difference Result 581 states and 629 transitions. [2018-10-01 00:40:09,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:40:09,478 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2018-10-01 00:40:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:09,480 INFO L225 Difference]: With dead ends: 581 [2018-10-01 00:40:09,480 INFO L226 Difference]: Without dead ends: 579 [2018-10-01 00:40:09,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:40:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-10-01 00:40:09,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2018-10-01 00:40:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-10-01 00:40:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2018-10-01 00:40:09,762 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2018-10-01 00:40:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:09,763 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2018-10-01 00:40:09,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-01 00:40:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2018-10-01 00:40:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-01 00:40:09,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:09,766 INFO L375 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2018-10-01 00:40:09,766 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:09,766 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:09,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1235489945, now seen corresponding path program 50 times [2018-10-01 00:40:09,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:09,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:09,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:09,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:09,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-10-01 00:40:10,291 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:10,291 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:10,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:10,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:10,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:10,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-10-01 00:40:11,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:11,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-01 00:40:11,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-01 00:40:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-01 00:40:11,686 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:11,686 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2018-10-01 00:40:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:12,584 INFO L93 Difference]: Finished difference Result 593 states and 642 transitions. [2018-10-01 00:40:12,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 00:40:12,584 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2018-10-01 00:40:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:12,586 INFO L225 Difference]: With dead ends: 593 [2018-10-01 00:40:12,586 INFO L226 Difference]: Without dead ends: 591 [2018-10-01 00:40:12,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:40:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-10-01 00:40:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2018-10-01 00:40:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-10-01 00:40:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2018-10-01 00:40:12,882 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2018-10-01 00:40:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:12,882 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2018-10-01 00:40:12,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-01 00:40:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2018-10-01 00:40:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-01 00:40:12,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:12,885 INFO L375 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2018-10-01 00:40:12,885 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:12,885 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1903936797, now seen corresponding path program 51 times [2018-10-01 00:40:12,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:12,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:12,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:12,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:12,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-10-01 00:40:13,579 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:13,579 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:13,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:14,909 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 289 check-sat command(s) [2018-10-01 00:40:14,910 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:14,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-10-01 00:40:15,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:15,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-01 00:40:15,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-01 00:40:15,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-01 00:40:15,962 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:15,962 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2018-10-01 00:40:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:16,925 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2018-10-01 00:40:16,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 00:40:16,925 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2018-10-01 00:40:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:16,927 INFO L225 Difference]: With dead ends: 605 [2018-10-01 00:40:16,927 INFO L226 Difference]: Without dead ends: 603 [2018-10-01 00:40:16,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:40:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-01 00:40:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2018-10-01 00:40:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-01 00:40:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2018-10-01 00:40:17,248 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2018-10-01 00:40:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:17,248 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2018-10-01 00:40:17,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-01 00:40:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2018-10-01 00:40:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2018-10-01 00:40:17,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:17,251 INFO L375 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2018-10-01 00:40:17,251 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:17,251 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -398769619, now seen corresponding path program 52 times [2018-10-01 00:40:17,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:17,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:17,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:17,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:17,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-10-01 00:40:17,843 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:17,844 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:17,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:18,170 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:18,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:18,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-10-01 00:40:19,292 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:19,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-01 00:40:19,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:40:19,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:40:19,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:19,294 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2018-10-01 00:40:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:20,266 INFO L93 Difference]: Finished difference Result 617 states and 668 transitions. [2018-10-01 00:40:20,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:40:20,267 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2018-10-01 00:40:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:20,269 INFO L225 Difference]: With dead ends: 617 [2018-10-01 00:40:20,269 INFO L226 Difference]: Without dead ends: 615 [2018-10-01 00:40:20,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:40:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-10-01 00:40:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2018-10-01 00:40:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-10-01 00:40:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2018-10-01 00:40:20,581 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2018-10-01 00:40:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:20,582 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2018-10-01 00:40:20,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:40:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2018-10-01 00:40:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-10-01 00:40:20,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:20,584 INFO L375 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2018-10-01 00:40:20,584 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:20,585 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:20,585 INFO L82 PathProgramCache]: Analyzing trace with hash -293623177, now seen corresponding path program 53 times [2018-10-01 00:40:20,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:20,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:20,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:20,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-10-01 00:40:21,170 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:21,170 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:21,179 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:22,541 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 301 check-sat command(s) [2018-10-01 00:40:22,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:22,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-10-01 00:40:23,870 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:23,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-01 00:40:23,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-01 00:40:23,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-01 00:40:23,872 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:23,872 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2018-10-01 00:40:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:24,870 INFO L93 Difference]: Finished difference Result 629 states and 681 transitions. [2018-10-01 00:40:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:40:24,871 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2018-10-01 00:40:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:24,873 INFO L225 Difference]: With dead ends: 629 [2018-10-01 00:40:24,873 INFO L226 Difference]: Without dead ends: 627 [2018-10-01 00:40:24,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:40:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-10-01 00:40:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2018-10-01 00:40:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-10-01 00:40:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2018-10-01 00:40:25,239 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2018-10-01 00:40:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:25,240 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2018-10-01 00:40:25,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-01 00:40:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2018-10-01 00:40:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-10-01 00:40:25,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:25,243 INFO L375 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2018-10-01 00:40:25,243 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:25,243 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:25,244 INFO L82 PathProgramCache]: Analyzing trace with hash -616041535, now seen corresponding path program 54 times [2018-10-01 00:40:25,244 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:25,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:25,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:25,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:25,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-10-01 00:40:25,905 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:25,905 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:25,911 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:27,346 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 302 check-sat command(s) [2018-10-01 00:40:27,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:27,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-10-01 00:40:28,510 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:28,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-01 00:40:28,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-01 00:40:28,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-01 00:40:28,511 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:28,511 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2018-10-01 00:40:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:29,527 INFO L93 Difference]: Finished difference Result 641 states and 694 transitions. [2018-10-01 00:40:29,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 00:40:29,527 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2018-10-01 00:40:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:29,530 INFO L225 Difference]: With dead ends: 641 [2018-10-01 00:40:29,530 INFO L226 Difference]: Without dead ends: 639 [2018-10-01 00:40:29,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:40:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-01 00:40:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2018-10-01 00:40:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-10-01 00:40:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2018-10-01 00:40:29,889 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2018-10-01 00:40:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:29,889 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2018-10-01 00:40:29,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-01 00:40:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2018-10-01 00:40:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-10-01 00:40:29,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:29,892 INFO L375 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2018-10-01 00:40:29,892 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:29,892 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:29,893 INFO L82 PathProgramCache]: Analyzing trace with hash 717921803, now seen corresponding path program 55 times [2018-10-01 00:40:29,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:29,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-10-01 00:40:30,561 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:30,561 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:30,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:30,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-10-01 00:40:32,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:32,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-01 00:40:32,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-01 00:40:32,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-01 00:40:32,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:32,069 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2018-10-01 00:40:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:33,118 INFO L93 Difference]: Finished difference Result 653 states and 707 transitions. [2018-10-01 00:40:33,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:40:33,118 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2018-10-01 00:40:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:33,120 INFO L225 Difference]: With dead ends: 653 [2018-10-01 00:40:33,120 INFO L226 Difference]: Without dead ends: 651 [2018-10-01 00:40:33,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:40:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-10-01 00:40:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2018-10-01 00:40:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-01 00:40:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2018-10-01 00:40:33,474 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2018-10-01 00:40:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:33,475 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2018-10-01 00:40:33,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-01 00:40:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2018-10-01 00:40:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-01 00:40:33,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:33,478 INFO L375 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2018-10-01 00:40:33,478 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:33,478 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:33,478 INFO L82 PathProgramCache]: Analyzing trace with hash 998123861, now seen corresponding path program 56 times [2018-10-01 00:40:33,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:33,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:33,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:33,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:33,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-10-01 00:40:34,118 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:34,118 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:34,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:34,461 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:34,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:34,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-10-01 00:40:35,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:35,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-01 00:40:35,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-01 00:40:35,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-01 00:40:35,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:35,934 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2018-10-01 00:40:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:37,120 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-10-01 00:40:37,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 00:40:37,121 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2018-10-01 00:40:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:37,123 INFO L225 Difference]: With dead ends: 665 [2018-10-01 00:40:37,123 INFO L226 Difference]: Without dead ends: 663 [2018-10-01 00:40:37,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:40:37,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-10-01 00:40:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2018-10-01 00:40:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-10-01 00:40:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2018-10-01 00:40:37,491 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2018-10-01 00:40:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:37,491 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2018-10-01 00:40:37,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-01 00:40:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2018-10-01 00:40:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-10-01 00:40:37,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:37,494 INFO L375 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2018-10-01 00:40:37,494 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:37,494 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash -300345953, now seen corresponding path program 57 times [2018-10-01 00:40:37,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:37,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:37,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:37,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:37,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-01 00:40:38,144 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:38,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:38,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:39,784 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 325 check-sat command(s) [2018-10-01 00:40:39,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:39,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-10-01 00:40:41,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:41,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-01 00:40:41,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-01 00:40:41,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-01 00:40:41,287 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:41,287 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2018-10-01 00:40:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:42,393 INFO L93 Difference]: Finished difference Result 677 states and 733 transitions. [2018-10-01 00:40:42,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-01 00:40:42,394 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2018-10-01 00:40:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:42,396 INFO L225 Difference]: With dead ends: 677 [2018-10-01 00:40:42,396 INFO L226 Difference]: Without dead ends: 675 [2018-10-01 00:40:42,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:40:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-10-01 00:40:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2018-10-01 00:40:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-10-01 00:40:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2018-10-01 00:40:42,782 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2018-10-01 00:40:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:42,782 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2018-10-01 00:40:42,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-01 00:40:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2018-10-01 00:40:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-10-01 00:40:42,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:42,785 INFO L375 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2018-10-01 00:40:42,785 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:42,785 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1167188713, now seen corresponding path program 58 times [2018-10-01 00:40:42,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:42,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:42,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:42,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:42,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-10-01 00:40:43,450 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:43,450 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:43,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:43,816 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:43,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:43,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-10-01 00:40:45,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:45,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-01 00:40:45,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-01 00:40:45,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-01 00:40:45,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:45,069 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2018-10-01 00:40:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:46,276 INFO L93 Difference]: Finished difference Result 689 states and 746 transitions. [2018-10-01 00:40:46,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-01 00:40:46,276 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2018-10-01 00:40:46,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:46,278 INFO L225 Difference]: With dead ends: 689 [2018-10-01 00:40:46,278 INFO L226 Difference]: Without dead ends: 687 [2018-10-01 00:40:46,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:40:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-10-01 00:40:46,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2018-10-01 00:40:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-10-01 00:40:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2018-10-01 00:40:46,676 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2018-10-01 00:40:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:46,676 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2018-10-01 00:40:46,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-01 00:40:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2018-10-01 00:40:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-10-01 00:40:46,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:46,680 INFO L375 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2018-10-01 00:40:46,680 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:46,681 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash 119476531, now seen corresponding path program 59 times [2018-10-01 00:40:46,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:46,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:46,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:46,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:46,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-01 00:40:47,363 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:47,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:47,371 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:49,072 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 337 check-sat command(s) [2018-10-01 00:40:49,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:49,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-10-01 00:40:50,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:50,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-01 00:40:50,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-01 00:40:50,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-01 00:40:50,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:50,332 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2018-10-01 00:40:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:51,623 INFO L93 Difference]: Finished difference Result 701 states and 759 transitions. [2018-10-01 00:40:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-01 00:40:51,624 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2018-10-01 00:40:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:51,626 INFO L225 Difference]: With dead ends: 701 [2018-10-01 00:40:51,626 INFO L226 Difference]: Without dead ends: 699 [2018-10-01 00:40:51,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:40:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-10-01 00:40:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2018-10-01 00:40:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-10-01 00:40:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2018-10-01 00:40:52,095 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2018-10-01 00:40:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:52,095 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2018-10-01 00:40:52,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-01 00:40:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2018-10-01 00:40:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-10-01 00:40:52,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:52,099 INFO L375 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2018-10-01 00:40:52,099 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:52,099 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:52,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1513562237, now seen corresponding path program 60 times [2018-10-01 00:40:52,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:52,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:52,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:52,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:52,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-10-01 00:40:52,801 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:52,801 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:52,809 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:54,594 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 339 check-sat command(s) [2018-10-01 00:40:54,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:54,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-10-01 00:40:56,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:56,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-01 00:40:56,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-01 00:40:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-01 00:40:56,237 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:56,237 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2018-10-01 00:40:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:57,496 INFO L93 Difference]: Finished difference Result 713 states and 772 transitions. [2018-10-01 00:40:57,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-01 00:40:57,496 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2018-10-01 00:40:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:57,499 INFO L225 Difference]: With dead ends: 713 [2018-10-01 00:40:57,499 INFO L226 Difference]: Without dead ends: 711 [2018-10-01 00:40:57,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 687 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:40:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-10-01 00:40:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2018-10-01 00:40:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-01 00:40:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2018-10-01 00:40:57,943 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2018-10-01 00:40:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:57,944 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2018-10-01 00:40:57,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-01 00:40:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2018-10-01 00:40:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-01 00:40:57,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:57,947 INFO L375 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2018-10-01 00:40:57,947 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:57,947 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:57,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1754304711, now seen corresponding path program 61 times [2018-10-01 00:40:57,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:57,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:57,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:57,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:57,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-10-01 00:40:58,686 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:58,686 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:58,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:59,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-10-01 00:41:00,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:00,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-01 00:41:00,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-01 00:41:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-01 00:41:00,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:00,351 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2018-10-01 00:41:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:01,654 INFO L93 Difference]: Finished difference Result 725 states and 785 transitions. [2018-10-01 00:41:01,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-01 00:41:01,655 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2018-10-01 00:41:01,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:01,657 INFO L225 Difference]: With dead ends: 725 [2018-10-01 00:41:01,657 INFO L226 Difference]: Without dead ends: 723 [2018-10-01 00:41:01,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:41:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-10-01 00:41:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2018-10-01 00:41:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-10-01 00:41:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2018-10-01 00:41:02,140 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2018-10-01 00:41:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:02,140 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2018-10-01 00:41:02,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-01 00:41:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2018-10-01 00:41:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-10-01 00:41:02,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:02,144 INFO L375 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2018-10-01 00:41:02,144 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:02,145 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash -31333871, now seen corresponding path program 62 times [2018-10-01 00:41:02,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:02,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-10-01 00:41:02,891 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:02,891 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:02,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:03,301 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:03,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:03,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-10-01 00:41:04,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:04,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-01 00:41:04,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-01 00:41:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-01 00:41:04,622 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:04,622 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2018-10-01 00:41:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:05,911 INFO L93 Difference]: Finished difference Result 737 states and 798 transitions. [2018-10-01 00:41:05,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-01 00:41:05,911 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2018-10-01 00:41:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:05,914 INFO L225 Difference]: With dead ends: 737 [2018-10-01 00:41:05,914 INFO L226 Difference]: Without dead ends: 735 [2018-10-01 00:41:05,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:41:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-10-01 00:41:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2018-10-01 00:41:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-01 00:41:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2018-10-01 00:41:06,404 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2018-10-01 00:41:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:06,405 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2018-10-01 00:41:06,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-01 00:41:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2018-10-01 00:41:06,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-10-01 00:41:06,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:06,409 INFO L375 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2018-10-01 00:41:06,409 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:06,409 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash 690066523, now seen corresponding path program 63 times [2018-10-01 00:41:06,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:06,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:06,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:06,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:06,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-10-01 00:41:07,210 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:07,210 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:07,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:09,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 361 check-sat command(s) [2018-10-01 00:41:09,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:09,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-10-01 00:41:10,535 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:10,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-01 00:41:10,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-01 00:41:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-01 00:41:10,537 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:10,537 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2018-10-01 00:41:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:11,895 INFO L93 Difference]: Finished difference Result 749 states and 811 transitions. [2018-10-01 00:41:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-01 00:41:11,896 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2018-10-01 00:41:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:11,898 INFO L225 Difference]: With dead ends: 749 [2018-10-01 00:41:11,898 INFO L226 Difference]: Without dead ends: 747 [2018-10-01 00:41:11,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 723 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:41:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-10-01 00:41:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2018-10-01 00:41:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-10-01 00:41:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2018-10-01 00:41:12,396 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2018-10-01 00:41:12,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:12,397 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2018-10-01 00:41:12,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-01 00:41:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2018-10-01 00:41:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-10-01 00:41:12,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:12,400 INFO L375 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2018-10-01 00:41:12,400 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:12,401 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash -637130843, now seen corresponding path program 64 times [2018-10-01 00:41:12,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:12,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:12,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-10-01 00:41:13,219 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:13,219 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:13,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:13,619 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:13,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:13,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-10-01 00:41:14,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:14,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-01 00:41:14,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-01 00:41:14,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-01 00:41:14,974 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:14,974 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2018-10-01 00:41:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:16,976 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2018-10-01 00:41:16,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-01 00:41:16,976 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2018-10-01 00:41:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:16,979 INFO L225 Difference]: With dead ends: 761 [2018-10-01 00:41:16,979 INFO L226 Difference]: Without dead ends: 759 [2018-10-01 00:41:16,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:41:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-01 00:41:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2018-10-01 00:41:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-10-01 00:41:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2018-10-01 00:41:17,550 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2018-10-01 00:41:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:17,551 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2018-10-01 00:41:17,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-01 00:41:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2018-10-01 00:41:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-10-01 00:41:17,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:17,554 INFO L375 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2018-10-01 00:41:17,555 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:17,555 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2088363025, now seen corresponding path program 65 times [2018-10-01 00:41:17,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:17,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:17,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:17,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-10-01 00:41:18,334 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:18,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:18,340 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:20,439 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 373 check-sat command(s) [2018-10-01 00:41:20,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:20,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-10-01 00:41:22,058 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:22,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-01 00:41:22,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-01 00:41:22,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-01 00:41:22,060 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:22,060 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2018-10-01 00:41:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:23,540 INFO L93 Difference]: Finished difference Result 773 states and 837 transitions. [2018-10-01 00:41:23,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-01 00:41:23,541 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2018-10-01 00:41:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:23,543 INFO L225 Difference]: With dead ends: 773 [2018-10-01 00:41:23,543 INFO L226 Difference]: Without dead ends: 771 [2018-10-01 00:41:23,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:41:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-10-01 00:41:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2018-10-01 00:41:24,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-10-01 00:41:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2018-10-01 00:41:24,067 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2018-10-01 00:41:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:24,067 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2018-10-01 00:41:24,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-01 00:41:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2018-10-01 00:41:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-10-01 00:41:24,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:24,071 INFO L375 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2018-10-01 00:41:24,071 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:24,071 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1164447431, now seen corresponding path program 66 times [2018-10-01 00:41:24,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:24,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:24,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:24,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-10-01 00:41:24,901 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:24,901 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:24,908 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:41:27,066 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 374 check-sat command(s) [2018-10-01 00:41:27,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:27,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-10-01 00:41:28,521 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:28,522 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-01 00:41:28,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-01 00:41:28,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-01 00:41:28,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:28,523 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2018-10-01 00:41:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:30,006 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2018-10-01 00:41:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-01 00:41:30,007 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2018-10-01 00:41:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:30,009 INFO L225 Difference]: With dead ends: 785 [2018-10-01 00:41:30,009 INFO L226 Difference]: Without dead ends: 783 [2018-10-01 00:41:30,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:41:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-10-01 00:41:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2018-10-01 00:41:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-10-01 00:41:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2018-10-01 00:41:30,614 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2018-10-01 00:41:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:30,614 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2018-10-01 00:41:30,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-01 00:41:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2018-10-01 00:41:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-10-01 00:41:30,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:30,618 INFO L375 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2018-10-01 00:41:30,618 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:30,618 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:30,619 INFO L82 PathProgramCache]: Analyzing trace with hash -697161853, now seen corresponding path program 67 times [2018-10-01 00:41:30,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:30,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:30,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:30,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:30,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-10-01 00:41:31,600 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:31,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:31,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:32,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-10-01 00:41:33,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:33,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-01 00:41:33,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-01 00:41:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-01 00:41:33,460 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:33,460 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2018-10-01 00:41:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:34,997 INFO L93 Difference]: Finished difference Result 797 states and 863 transitions. [2018-10-01 00:41:34,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 00:41:34,997 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2018-10-01 00:41:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:35,000 INFO L225 Difference]: With dead ends: 797 [2018-10-01 00:41:35,000 INFO L226 Difference]: Without dead ends: 795 [2018-10-01 00:41:35,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:41:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-10-01 00:41:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2018-10-01 00:41:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-10-01 00:41:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2018-10-01 00:41:35,593 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2018-10-01 00:41:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:35,593 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2018-10-01 00:41:35,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-01 00:41:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2018-10-01 00:41:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-10-01 00:41:35,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:35,598 INFO L375 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2018-10-01 00:41:35,598 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:35,598 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1869922611, now seen corresponding path program 68 times [2018-10-01 00:41:35,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:35,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:35,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:35,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:35,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-10-01 00:41:36,494 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:36,494 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:36,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:36,916 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:36,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:36,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-10-01 00:41:38,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:38,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-01 00:41:38,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-01 00:41:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-01 00:41:38,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:38,397 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2018-10-01 00:41:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:39,912 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2018-10-01 00:41:39,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-01 00:41:39,913 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2018-10-01 00:41:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:39,915 INFO L225 Difference]: With dead ends: 809 [2018-10-01 00:41:39,915 INFO L226 Difference]: Without dead ends: 807 [2018-10-01 00:41:39,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:41:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-10-01 00:41:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2018-10-01 00:41:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-10-01 00:41:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2018-10-01 00:41:40,549 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2018-10-01 00:41:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:40,549 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2018-10-01 00:41:40,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-01 00:41:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2018-10-01 00:41:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-10-01 00:41:40,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:40,553 INFO L375 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2018-10-01 00:41:40,553 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:40,553 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1533429993, now seen corresponding path program 69 times [2018-10-01 00:41:40,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:40,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:40,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-10-01 00:41:41,634 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:41,634 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:41,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:44,087 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 397 check-sat command(s) [2018-10-01 00:41:44,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:44,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-10-01 00:41:45,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:45,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-01 00:41:45,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-01 00:41:45,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-01 00:41:45,637 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:45,637 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. [2018-10-01 00:41:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:47,214 INFO L93 Difference]: Finished difference Result 821 states and 889 transitions. [2018-10-01 00:41:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-01 00:41:47,214 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 795 [2018-10-01 00:41:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:47,217 INFO L225 Difference]: With dead ends: 821 [2018-10-01 00:41:47,217 INFO L226 Difference]: Without dead ends: 819 [2018-10-01 00:41:47,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:41:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-01 00:41:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 808. [2018-10-01 00:41:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-10-01 00:41:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 875 transitions. [2018-10-01 00:41:47,828 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 875 transitions. Word has length 795 [2018-10-01 00:41:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:47,828 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 875 transitions. [2018-10-01 00:41:47,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-01 00:41:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 875 transitions. [2018-10-01 00:41:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-10-01 00:41:47,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:47,833 INFO L375 BasicCegarLoop]: trace histogram [670, 67, 67, 1, 1, 1] [2018-10-01 00:41:47,833 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:47,833 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:47,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1888751713, now seen corresponding path program 70 times [2018-10-01 00:41:47,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:47,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:47,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:47,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:47,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-10-01 00:41:48,701 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:48,701 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:49,148 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:49,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:49,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-10-01 00:41:50,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:50,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-01 00:41:50,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-01 00:41:50,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-01 00:41:50,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:50,759 INFO L87 Difference]: Start difference. First operand 808 states and 875 transitions. Second operand 70 states. [2018-10-01 00:41:52,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:52,317 INFO L93 Difference]: Finished difference Result 833 states and 902 transitions. [2018-10-01 00:41:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-01 00:41:52,317 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 807 [2018-10-01 00:41:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:52,321 INFO L225 Difference]: With dead ends: 833 [2018-10-01 00:41:52,321 INFO L226 Difference]: Without dead ends: 831 [2018-10-01 00:41:52,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:41:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-10-01 00:41:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 820. [2018-10-01 00:41:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-10-01 00:41:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 888 transitions. [2018-10-01 00:41:52,956 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 888 transitions. Word has length 807 [2018-10-01 00:41:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:52,957 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 888 transitions. [2018-10-01 00:41:52,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-01 00:41:52,957 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 888 transitions. [2018-10-01 00:41:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-10-01 00:41:52,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:52,961 INFO L375 BasicCegarLoop]: trace histogram [680, 68, 68, 1, 1, 1] [2018-10-01 00:41:52,961 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:52,961 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:52,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1800353109, now seen corresponding path program 71 times [2018-10-01 00:41:52,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:52,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:52,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:52,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:52,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-10-01 00:41:53,918 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:53,918 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:53,925 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:56,467 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 409 check-sat command(s) [2018-10-01 00:41:56,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:56,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-10-01 00:41:58,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:58,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-01 00:41:58,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-01 00:41:58,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-01 00:41:58,545 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:58,545 INFO L87 Difference]: Start difference. First operand 820 states and 888 transitions. Second operand 71 states. [2018-10-01 00:42:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:00,163 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-10-01 00:42:00,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:42:00,163 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 819 [2018-10-01 00:42:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:00,166 INFO L225 Difference]: With dead ends: 845 [2018-10-01 00:42:00,167 INFO L226 Difference]: Without dead ends: 843 [2018-10-01 00:42:00,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:42:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-10-01 00:42:00,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 832. [2018-10-01 00:42:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-10-01 00:42:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 901 transitions. [2018-10-01 00:42:00,900 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 901 transitions. Word has length 819 [2018-10-01 00:42:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:00,901 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 901 transitions. [2018-10-01 00:42:00,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-01 00:42:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 901 transitions. [2018-10-01 00:42:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-10-01 00:42:00,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:00,905 INFO L375 BasicCegarLoop]: trace histogram [690, 69, 69, 1, 1, 1] [2018-10-01 00:42:00,905 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:00,905 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:00,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1822005771, now seen corresponding path program 72 times [2018-10-01 00:42:00,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:00,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:00,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:00,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:00,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-10-01 00:42:01,828 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:01,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:01,836 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:42:04,475 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 411 check-sat command(s) [2018-10-01 00:42:04,475 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:04,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-10-01 00:42:06,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:06,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-01 00:42:06,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-01 00:42:06,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-01 00:42:06,137 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:06,137 INFO L87 Difference]: Start difference. First operand 832 states and 901 transitions. Second operand 72 states. [2018-10-01 00:42:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:07,791 INFO L93 Difference]: Finished difference Result 857 states and 928 transitions. [2018-10-01 00:42:07,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-01 00:42:07,792 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 831 [2018-10-01 00:42:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:07,794 INFO L225 Difference]: With dead ends: 857 [2018-10-01 00:42:07,794 INFO L226 Difference]: Without dead ends: 855 [2018-10-01 00:42:07,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 831 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:42:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-10-01 00:42:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 844. [2018-10-01 00:42:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-01 00:42:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 914 transitions. [2018-10-01 00:42:08,510 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 914 transitions. Word has length 831 [2018-10-01 00:42:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:08,511 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 914 transitions. [2018-10-01 00:42:08,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-01 00:42:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 914 transitions. [2018-10-01 00:42:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-10-01 00:42:08,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:08,515 INFO L375 BasicCegarLoop]: trace histogram [700, 70, 70, 1, 1, 1] [2018-10-01 00:42:08,516 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:08,516 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1902862911, now seen corresponding path program 73 times [2018-10-01 00:42:08,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:08,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:08,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:08,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:08,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-10-01 00:42:09,451 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:09,451 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:09,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:09,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-10-01 00:42:11,569 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:11,569 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-01 00:42:11,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-01 00:42:11,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-01 00:42:11,570 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:11,571 INFO L87 Difference]: Start difference. First operand 844 states and 914 transitions. Second operand 73 states. [2018-10-01 00:42:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:13,327 INFO L93 Difference]: Finished difference Result 869 states and 941 transitions. [2018-10-01 00:42:13,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-01 00:42:13,328 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 843 [2018-10-01 00:42:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:13,329 INFO L225 Difference]: With dead ends: 869 [2018-10-01 00:42:13,329 INFO L226 Difference]: Without dead ends: 867 [2018-10-01 00:42:13,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 843 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:42:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-10-01 00:42:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 856. [2018-10-01 00:42:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-01 00:42:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 927 transitions. [2018-10-01 00:42:14,055 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 927 transitions. Word has length 843 [2018-10-01 00:42:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:14,055 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 927 transitions. [2018-10-01 00:42:14,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-01 00:42:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 927 transitions. [2018-10-01 00:42:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-10-01 00:42:14,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:14,060 INFO L375 BasicCegarLoop]: trace histogram [710, 71, 71, 1, 1, 1] [2018-10-01 00:42:14,060 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:14,060 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:14,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1438007177, now seen corresponding path program 74 times [2018-10-01 00:42:14,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:14,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:14,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:14,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:14,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-10-01 00:42:15,073 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:15,073 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:15,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:42:15,537 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:42:15,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:15,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-10-01 00:42:17,195 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:17,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-01 00:42:17,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-01 00:42:17,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-01 00:42:17,197 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:17,197 INFO L87 Difference]: Start difference. First operand 856 states and 927 transitions. Second operand 74 states. [2018-10-01 00:42:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:19,106 INFO L93 Difference]: Finished difference Result 881 states and 954 transitions. [2018-10-01 00:42:19,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-01 00:42:19,107 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 855 [2018-10-01 00:42:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:19,108 INFO L225 Difference]: With dead ends: 881 [2018-10-01 00:42:19,108 INFO L226 Difference]: Without dead ends: 879 [2018-10-01 00:42:19,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:42:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-10-01 00:42:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 868. [2018-10-01 00:42:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-10-01 00:42:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 940 transitions. [2018-10-01 00:42:19,948 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 940 transitions. Word has length 855 [2018-10-01 00:42:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:19,949 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 940 transitions. [2018-10-01 00:42:19,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-01 00:42:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 940 transitions. [2018-10-01 00:42:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-10-01 00:42:19,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:19,954 INFO L375 BasicCegarLoop]: trace histogram [720, 72, 72, 1, 1, 1] [2018-10-01 00:42:19,954 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:19,954 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash 696090067, now seen corresponding path program 75 times [2018-10-01 00:42:19,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:19,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:19,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-10-01 00:42:20,949 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:20,949 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:20,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:42:23,859 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 433 check-sat command(s) [2018-10-01 00:42:23,860 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:23,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-10-01 00:42:25,603 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:25,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-01 00:42:25,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-01 00:42:25,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-01 00:42:25,605 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:25,606 INFO L87 Difference]: Start difference. First operand 868 states and 940 transitions. Second operand 75 states. [2018-10-01 00:42:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:27,420 INFO L93 Difference]: Finished difference Result 893 states and 967 transitions. [2018-10-01 00:42:27,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-01 00:42:27,421 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 867 [2018-10-01 00:42:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:27,422 INFO L225 Difference]: With dead ends: 893 [2018-10-01 00:42:27,422 INFO L226 Difference]: Without dead ends: 891 [2018-10-01 00:42:27,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 867 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:42:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-10-01 00:42:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 880. [2018-10-01 00:42:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-10-01 00:42:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 953 transitions. [2018-10-01 00:42:28,223 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 953 transitions. Word has length 867 [2018-10-01 00:42:28,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:28,223 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 953 transitions. [2018-10-01 00:42:28,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-01 00:42:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 953 transitions. [2018-10-01 00:42:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-10-01 00:42:28,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:28,228 INFO L375 BasicCegarLoop]: trace histogram [730, 73, 73, 1, 1, 1] [2018-10-01 00:42:28,229 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:28,229 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:28,229 INFO L82 PathProgramCache]: Analyzing trace with hash 943168797, now seen corresponding path program 76 times [2018-10-01 00:42:28,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:28,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:28,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:28,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:28,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-10-01 00:42:29,255 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:29,255 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:29,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:42:29,740 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:42:29,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:29,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-10-01 00:42:31,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:31,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-01 00:42:31,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-01 00:42:31,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-01 00:42:31,394 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:31,394 INFO L87 Difference]: Start difference. First operand 880 states and 953 transitions. Second operand 76 states. [2018-10-01 00:42:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:33,232 INFO L93 Difference]: Finished difference Result 905 states and 980 transitions. [2018-10-01 00:42:33,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-01 00:42:33,233 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 879 [2018-10-01 00:42:33,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:33,234 INFO L225 Difference]: With dead ends: 905 [2018-10-01 00:42:33,234 INFO L226 Difference]: Without dead ends: 903 [2018-10-01 00:42:33,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 953 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:42:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-10-01 00:42:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 892. [2018-10-01 00:42:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-10-01 00:42:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 966 transitions. [2018-10-01 00:42:34,032 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 966 transitions. Word has length 879 [2018-10-01 00:42:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:34,032 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 966 transitions. [2018-10-01 00:42:34,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-01 00:42:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 966 transitions. [2018-10-01 00:42:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-10-01 00:42:34,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:34,038 INFO L375 BasicCegarLoop]: trace histogram [740, 74, 74, 1, 1, 1] [2018-10-01 00:42:34,038 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:34,038 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:34,038 INFO L82 PathProgramCache]: Analyzing trace with hash -811917977, now seen corresponding path program 77 times [2018-10-01 00:42:34,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:34,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:34,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-10-01 00:42:35,145 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:35,145 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:35,152 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:42:38,184 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 445 check-sat command(s) [2018-10-01 00:42:38,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:38,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-10-01 00:42:39,949 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:39,949 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-01 00:42:39,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-01 00:42:39,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-01 00:42:39,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:39,950 INFO L87 Difference]: Start difference. First operand 892 states and 966 transitions. Second operand 77 states. [2018-10-01 00:42:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:42,020 INFO L93 Difference]: Finished difference Result 917 states and 993 transitions. [2018-10-01 00:42:42,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-01 00:42:42,020 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 891 [2018-10-01 00:42:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:42,022 INFO L225 Difference]: With dead ends: 917 [2018-10-01 00:42:42,022 INFO L226 Difference]: Without dead ends: 915 [2018-10-01 00:42:42,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 891 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:42:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-01 00:42:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 904. [2018-10-01 00:42:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-10-01 00:42:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 979 transitions. [2018-10-01 00:42:42,849 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 979 transitions. Word has length 891 [2018-10-01 00:42:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:42,850 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 979 transitions. [2018-10-01 00:42:42,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-01 00:42:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 979 transitions. [2018-10-01 00:42:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2018-10-01 00:42:42,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:42,856 INFO L375 BasicCegarLoop]: trace histogram [750, 75, 75, 1, 1, 1] [2018-10-01 00:42:42,856 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:42,856 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:42,856 INFO L82 PathProgramCache]: Analyzing trace with hash -543261007, now seen corresponding path program 78 times [2018-10-01 00:42:42,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:42,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:42,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:42,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:42,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-10-01 00:42:44,112 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:44,112 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:44,118 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:42:47,246 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 446 check-sat command(s) [2018-10-01 00:42:47,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:47,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-10-01 00:42:49,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:49,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-01 00:42:49,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-01 00:42:49,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-01 00:42:49,262 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:49,262 INFO L87 Difference]: Start difference. First operand 904 states and 979 transitions. Second operand 78 states. [2018-10-01 00:42:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:51,252 INFO L93 Difference]: Finished difference Result 929 states and 1006 transitions. [2018-10-01 00:42:51,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-01 00:42:51,253 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 903 [2018-10-01 00:42:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:51,254 INFO L225 Difference]: With dead ends: 929 [2018-10-01 00:42:51,254 INFO L226 Difference]: Without dead ends: 927 [2018-10-01 00:42:51,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 979 GetRequests, 903 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:42:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-10-01 00:42:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 916. [2018-10-01 00:42:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-10-01 00:42:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 992 transitions. [2018-10-01 00:42:52,118 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 992 transitions. Word has length 903 [2018-10-01 00:42:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:52,118 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 992 transitions. [2018-10-01 00:42:52,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-01 00:42:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 992 transitions. [2018-10-01 00:42:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2018-10-01 00:42:52,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:52,124 INFO L375 BasicCegarLoop]: trace histogram [760, 76, 76, 1, 1, 1] [2018-10-01 00:42:52,124 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:52,124 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:52,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1703395077, now seen corresponding path program 79 times [2018-10-01 00:42:52,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:52,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:52,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:52,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:52,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-10-01 00:42:53,218 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:53,218 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:53,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:53,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-10-01 00:42:55,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:55,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-01 00:42:55,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-01 00:42:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-01 00:42:55,553 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:55,553 INFO L87 Difference]: Start difference. First operand 916 states and 992 transitions. Second operand 79 states. [2018-10-01 00:42:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:57,552 INFO L93 Difference]: Finished difference Result 941 states and 1019 transitions. [2018-10-01 00:42:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:42:57,553 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 915 [2018-10-01 00:42:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:57,554 INFO L225 Difference]: With dead ends: 941 [2018-10-01 00:42:57,554 INFO L226 Difference]: Without dead ends: 939 [2018-10-01 00:42:57,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 992 GetRequests, 915 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:42:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-10-01 00:42:58,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 928. [2018-10-01 00:42:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-10-01 00:42:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1005 transitions. [2018-10-01 00:42:58,408 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1005 transitions. Word has length 915 [2018-10-01 00:42:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:58,409 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1005 transitions. [2018-10-01 00:42:58,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-01 00:42:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1005 transitions. [2018-10-01 00:42:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2018-10-01 00:42:58,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:58,414 INFO L375 BasicCegarLoop]: trace histogram [770, 77, 77, 1, 1, 1] [2018-10-01 00:42:58,414 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:58,415 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 345957445, now seen corresponding path program 80 times [2018-10-01 00:42:58,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:58,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:58,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:58,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:58,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-10-01 00:42:59,546 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:59,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:59,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:43:00,043 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:43:00,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:00,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-10-01 00:43:01,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:01,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-01 00:43:01,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-01 00:43:01,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-01 00:43:01,856 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:01,856 INFO L87 Difference]: Start difference. First operand 928 states and 1005 transitions. Second operand 80 states. [2018-10-01 00:43:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:03,870 INFO L93 Difference]: Finished difference Result 953 states and 1032 transitions. [2018-10-01 00:43:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-01 00:43:03,870 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 927 [2018-10-01 00:43:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:03,872 INFO L225 Difference]: With dead ends: 953 [2018-10-01 00:43:03,872 INFO L226 Difference]: Without dead ends: 951 [2018-10-01 00:43:03,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1005 GetRequests, 927 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:43:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-10-01 00:43:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 940. [2018-10-01 00:43:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-10-01 00:43:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1018 transitions. [2018-10-01 00:43:04,832 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1018 transitions. Word has length 927 [2018-10-01 00:43:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:04,832 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1018 transitions. [2018-10-01 00:43:04,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-01 00:43:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1018 transitions. [2018-10-01 00:43:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-10-01 00:43:04,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:04,838 INFO L375 BasicCegarLoop]: trace histogram [780, 78, 78, 1, 1, 1] [2018-10-01 00:43:04,838 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:04,838 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:04,839 INFO L82 PathProgramCache]: Analyzing trace with hash -456595313, now seen corresponding path program 81 times [2018-10-01 00:43:04,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:04,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:04,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:04,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:04,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-01 00:43:05,980 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:05,980 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:05,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:43:09,430 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 469 check-sat command(s) [2018-10-01 00:43:09,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:09,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-01 00:43:11,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:11,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-01 00:43:11,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-01 00:43:11,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-01 00:43:11,342 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:11,342 INFO L87 Difference]: Start difference. First operand 940 states and 1018 transitions. Second operand 81 states. [2018-10-01 00:43:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:13,576 INFO L93 Difference]: Finished difference Result 965 states and 1045 transitions. [2018-10-01 00:43:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 00:43:13,576 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 939 [2018-10-01 00:43:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:13,579 INFO L225 Difference]: With dead ends: 965 [2018-10-01 00:43:13,579 INFO L226 Difference]: Without dead ends: 963 [2018-10-01 00:43:13,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 939 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:43:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-10-01 00:43:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 952. [2018-10-01 00:43:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-10-01 00:43:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1031 transitions. [2018-10-01 00:43:14,575 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1031 transitions. Word has length 939 [2018-10-01 00:43:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:14,576 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 1031 transitions. [2018-10-01 00:43:14,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-01 00:43:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1031 transitions. [2018-10-01 00:43:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2018-10-01 00:43:14,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:14,581 INFO L375 BasicCegarLoop]: trace histogram [790, 79, 79, 1, 1, 1] [2018-10-01 00:43:14,581 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:14,582 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:14,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1007890983, now seen corresponding path program 82 times [2018-10-01 00:43:14,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:14,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:14,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:14,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:14,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-10-01 00:43:15,806 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:15,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:15,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:43:16,312 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:43:16,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:16,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-10-01 00:43:18,294 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:18,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-01 00:43:18,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-01 00:43:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-01 00:43:18,295 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:18,295 INFO L87 Difference]: Start difference. First operand 952 states and 1031 transitions. Second operand 82 states. [2018-10-01 00:43:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:20,491 INFO L93 Difference]: Finished difference Result 977 states and 1058 transitions. [2018-10-01 00:43:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 00:43:20,491 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 951 [2018-10-01 00:43:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:20,493 INFO L225 Difference]: With dead ends: 977 [2018-10-01 00:43:20,493 INFO L226 Difference]: Without dead ends: 975 [2018-10-01 00:43:20,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 951 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:43:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-10-01 00:43:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 964. [2018-10-01 00:43:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-10-01 00:43:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1044 transitions. [2018-10-01 00:43:21,440 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1044 transitions. Word has length 951 [2018-10-01 00:43:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:21,440 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1044 transitions. [2018-10-01 00:43:21,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-01 00:43:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1044 transitions. [2018-10-01 00:43:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-10-01 00:43:21,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:21,446 INFO L375 BasicCegarLoop]: trace histogram [800, 80, 80, 1, 1, 1] [2018-10-01 00:43:21,446 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:21,446 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash 759239715, now seen corresponding path program 83 times [2018-10-01 00:43:21,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:21,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:21,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-10-01 00:43:22,632 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:22,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:22,640 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:43:26,265 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 481 check-sat command(s) [2018-10-01 00:43:26,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:26,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-10-01 00:43:28,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:28,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-01 00:43:28,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-01 00:43:28,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-01 00:43:28,218 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:28,218 INFO L87 Difference]: Start difference. First operand 964 states and 1044 transitions. Second operand 83 states. [2018-10-01 00:43:30,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:30,529 INFO L93 Difference]: Finished difference Result 989 states and 1071 transitions. [2018-10-01 00:43:30,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-01 00:43:30,530 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 963 [2018-10-01 00:43:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:30,531 INFO L225 Difference]: With dead ends: 989 [2018-10-01 00:43:30,531 INFO L226 Difference]: Without dead ends: 987 [2018-10-01 00:43:30,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:43:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-10-01 00:43:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 976. [2018-10-01 00:43:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-10-01 00:43:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1057 transitions. [2018-10-01 00:43:31,637 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1057 transitions. Word has length 963 [2018-10-01 00:43:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:31,637 INFO L480 AbstractCegarLoop]: Abstraction has 976 states and 1057 transitions. [2018-10-01 00:43:31,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-01 00:43:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1057 transitions. [2018-10-01 00:43:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2018-10-01 00:43:31,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:31,644 INFO L375 BasicCegarLoop]: trace histogram [810, 81, 81, 1, 1, 1] [2018-10-01 00:43:31,644 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:31,645 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash -29607059, now seen corresponding path program 84 times [2018-10-01 00:43:31,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:31,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:31,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:31,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:31,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-10-01 00:43:32,905 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:32,905 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:32,915 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:43:36,588 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 483 check-sat command(s) [2018-10-01 00:43:36,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:36,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-10-01 00:43:38,517 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:38,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-01 00:43:38,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-01 00:43:38,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-01 00:43:38,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:38,519 INFO L87 Difference]: Start difference. First operand 976 states and 1057 transitions. Second operand 84 states. [2018-10-01 00:43:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:40,948 INFO L93 Difference]: Finished difference Result 1001 states and 1084 transitions. [2018-10-01 00:43:40,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-01 00:43:40,948 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 975 [2018-10-01 00:43:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:40,950 INFO L225 Difference]: With dead ends: 1001 [2018-10-01 00:43:40,950 INFO L226 Difference]: Without dead ends: 999 [2018-10-01 00:43:40,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1057 GetRequests, 975 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:43:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-10-01 00:43:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 988. [2018-10-01 00:43:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-10-01 00:43:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1070 transitions. [2018-10-01 00:43:41,983 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1070 transitions. Word has length 975 [2018-10-01 00:43:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:41,983 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1070 transitions. [2018-10-01 00:43:41,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-01 00:43:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1070 transitions. [2018-10-01 00:43:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-10-01 00:43:41,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:41,989 INFO L375 BasicCegarLoop]: trace histogram [820, 82, 82, 1, 1, 1] [2018-10-01 00:43:41,989 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:41,990 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:41,990 INFO L82 PathProgramCache]: Analyzing trace with hash 378848183, now seen corresponding path program 85 times [2018-10-01 00:43:41,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:41,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:41,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:41,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:41,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-10-01 00:43:43,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:43,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:43,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:43,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-10-01 00:43:46,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:46,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-01 00:43:46,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-01 00:43:46,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-01 00:43:46,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:46,114 INFO L87 Difference]: Start difference. First operand 988 states and 1070 transitions. Second operand 85 states. [2018-10-01 00:43:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:48,435 INFO L93 Difference]: Finished difference Result 1013 states and 1097 transitions. [2018-10-01 00:43:48,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:43:48,436 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 987 [2018-10-01 00:43:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:48,438 INFO L225 Difference]: With dead ends: 1013 [2018-10-01 00:43:48,438 INFO L226 Difference]: Without dead ends: 1011 [2018-10-01 00:43:48,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1070 GetRequests, 987 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:43:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-10-01 00:43:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1000. [2018-10-01 00:43:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-10-01 00:43:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1083 transitions. [2018-10-01 00:43:49,601 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1083 transitions. Word has length 987 [2018-10-01 00:43:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:49,602 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1083 transitions. [2018-10-01 00:43:49,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-01 00:43:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1083 transitions. [2018-10-01 00:43:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2018-10-01 00:43:49,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:49,608 INFO L375 BasicCegarLoop]: trace histogram [830, 83, 83, 1, 1, 1] [2018-10-01 00:43:49,608 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:49,608 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash -129946367, now seen corresponding path program 86 times [2018-10-01 00:43:49,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:49,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:49,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-10-01 00:43:50,831 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:50,831 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:43:51,358 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:43:51,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:51,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-10-01 00:43:53,481 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:53,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-01 00:43:53,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-01 00:43:53,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-01 00:43:53,483 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:53,483 INFO L87 Difference]: Start difference. First operand 1000 states and 1083 transitions. Second operand 86 states. [2018-10-01 00:43:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:55,862 INFO L93 Difference]: Finished difference Result 1025 states and 1110 transitions. [2018-10-01 00:43:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-01 00:43:55,862 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 999 [2018-10-01 00:43:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:55,864 INFO L225 Difference]: With dead ends: 1025 [2018-10-01 00:43:55,864 INFO L226 Difference]: Without dead ends: 1023 [2018-10-01 00:43:55,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 999 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:43:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-10-01 00:43:56,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1012. [2018-10-01 00:43:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-10-01 00:43:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1096 transitions. [2018-10-01 00:43:56,925 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1096 transitions. Word has length 999 [2018-10-01 00:43:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:56,925 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1096 transitions. [2018-10-01 00:43:56,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-01 00:43:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1096 transitions. [2018-10-01 00:43:56,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2018-10-01 00:43:56,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:56,934 INFO L375 BasicCegarLoop]: trace histogram [840, 84, 84, 1, 1, 1] [2018-10-01 00:43:56,934 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:56,935 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1735915339, now seen corresponding path program 87 times [2018-10-01 00:43:56,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:56,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:56,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:56,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:56,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-10-01 00:43:58,290 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:58,290 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:58,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:44:02,361 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 505 check-sat command(s) [2018-10-01 00:44:02,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:02,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-10-01 00:44:04,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:04,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-01 00:44:04,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-01 00:44:04,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-01 00:44:04,470 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:04,471 INFO L87 Difference]: Start difference. First operand 1012 states and 1096 transitions. Second operand 87 states. [2018-10-01 00:44:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:06,917 INFO L93 Difference]: Finished difference Result 1037 states and 1123 transitions. [2018-10-01 00:44:06,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-01 00:44:06,918 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1011 [2018-10-01 00:44:06,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:06,919 INFO L225 Difference]: With dead ends: 1037 [2018-10-01 00:44:06,919 INFO L226 Difference]: Without dead ends: 1035 [2018-10-01 00:44:06,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1096 GetRequests, 1011 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:44:06,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-10-01 00:44:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1024. [2018-10-01 00:44:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-01 00:44:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1109 transitions. [2018-10-01 00:44:08,163 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1109 transitions. Word has length 1011 [2018-10-01 00:44:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:08,164 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1109 transitions. [2018-10-01 00:44:08,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-01 00:44:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1109 transitions. [2018-10-01 00:44:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2018-10-01 00:44:08,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:08,170 INFO L375 BasicCegarLoop]: trace histogram [850, 85, 85, 1, 1, 1] [2018-10-01 00:44:08,170 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:08,170 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash 179282581, now seen corresponding path program 88 times [2018-10-01 00:44:08,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:08,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:08,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-10-01 00:44:09,475 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:09,475 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:09,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:44:10,023 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:44:10,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:10,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-10-01 00:44:12,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:12,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-01 00:44:12,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-01 00:44:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-01 00:44:12,237 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:12,237 INFO L87 Difference]: Start difference. First operand 1024 states and 1109 transitions. Second operand 88 states. [2018-10-01 00:44:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:14,736 INFO L93 Difference]: Finished difference Result 1049 states and 1136 transitions. [2018-10-01 00:44:14,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-01 00:44:14,737 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 1023 [2018-10-01 00:44:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:14,738 INFO L225 Difference]: With dead ends: 1049 [2018-10-01 00:44:14,738 INFO L226 Difference]: Without dead ends: 1047 [2018-10-01 00:44:14,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1023 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:44:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2018-10-01 00:44:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1036. [2018-10-01 00:44:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-10-01 00:44:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1122 transitions. [2018-10-01 00:44:15,864 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1122 transitions. Word has length 1023 [2018-10-01 00:44:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:15,864 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1122 transitions. [2018-10-01 00:44:15,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-01 00:44:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1122 transitions. [2018-10-01 00:44:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-10-01 00:44:15,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:15,871 INFO L375 BasicCegarLoop]: trace histogram [860, 86, 86, 1, 1, 1] [2018-10-01 00:44:15,871 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:15,871 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:15,871 INFO L82 PathProgramCache]: Analyzing trace with hash 178171615, now seen corresponding path program 89 times [2018-10-01 00:44:15,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:15,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:15,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:15,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:15,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-10-01 00:44:17,217 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:17,217 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:17,224 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:44:21,470 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 517 check-sat command(s) [2018-10-01 00:44:21,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:21,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-10-01 00:44:23,611 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:23,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-10-01 00:44:23,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-01 00:44:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-01 00:44:23,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:23,613 INFO L87 Difference]: Start difference. First operand 1036 states and 1122 transitions. Second operand 89 states. [2018-10-01 00:44:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:26,091 INFO L93 Difference]: Finished difference Result 1061 states and 1149 transitions. [2018-10-01 00:44:26,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-01 00:44:26,092 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1035 [2018-10-01 00:44:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:26,093 INFO L225 Difference]: With dead ends: 1061 [2018-10-01 00:44:26,093 INFO L226 Difference]: Without dead ends: 1059 [2018-10-01 00:44:26,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1122 GetRequests, 1035 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:44:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-10-01 00:44:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1048. [2018-10-01 00:44:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-10-01 00:44:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1135 transitions. [2018-10-01 00:44:27,260 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1135 transitions. Word has length 1035 [2018-10-01 00:44:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:27,260 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 1135 transitions. [2018-10-01 00:44:27,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-01 00:44:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1135 transitions. [2018-10-01 00:44:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-10-01 00:44:27,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:27,267 INFO L375 BasicCegarLoop]: trace histogram [870, 87, 87, 1, 1, 1] [2018-10-01 00:44:27,267 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:27,267 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1304716247, now seen corresponding path program 90 times [2018-10-01 00:44:27,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:27,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:27,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:27,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:27,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-10-01 00:44:28,643 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:28,643 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:28,652 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:44:33,017 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 518 check-sat command(s) [2018-10-01 00:44:33,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:33,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-10-01 00:44:35,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:35,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-01 00:44:35,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-01 00:44:35,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-01 00:44:35,203 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:35,203 INFO L87 Difference]: Start difference. First operand 1048 states and 1135 transitions. Second operand 90 states. [2018-10-01 00:44:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:37,887 INFO L93 Difference]: Finished difference Result 1073 states and 1162 transitions. [2018-10-01 00:44:37,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-01 00:44:37,887 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1047 [2018-10-01 00:44:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:37,888 INFO L225 Difference]: With dead ends: 1073 [2018-10-01 00:44:37,888 INFO L226 Difference]: Without dead ends: 1071 [2018-10-01 00:44:37,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1135 GetRequests, 1047 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:44:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-10-01 00:44:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1060. [2018-10-01 00:44:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-10-01 00:44:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1148 transitions. [2018-10-01 00:44:39,143 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1148 transitions. Word has length 1047 [2018-10-01 00:44:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:39,144 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 1148 transitions. [2018-10-01 00:44:39,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-01 00:44:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1148 transitions. [2018-10-01 00:44:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2018-10-01 00:44:39,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:39,150 INFO L375 BasicCegarLoop]: trace histogram [880, 88, 88, 1, 1, 1] [2018-10-01 00:44:39,151 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:39,151 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash 247261811, now seen corresponding path program 91 times [2018-10-01 00:44:39,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:39,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:39,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:39,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:39,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-10-01 00:44:40,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:40,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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:40,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:44:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:41,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-10-01 00:44:43,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:43,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-10-01 00:44:43,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-01 00:44:43,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-01 00:44:43,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:43,378 INFO L87 Difference]: Start difference. First operand 1060 states and 1148 transitions. Second operand 91 states. [2018-10-01 00:44:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:46,037 INFO L93 Difference]: Finished difference Result 1085 states and 1175 transitions. [2018-10-01 00:44:46,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-01 00:44:46,037 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1059 [2018-10-01 00:44:46,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:46,038 INFO L225 Difference]: With dead ends: 1085 [2018-10-01 00:44:46,038 INFO L226 Difference]: Without dead ends: 1083 [2018-10-01 00:44:46,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1148 GetRequests, 1059 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:44:46,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-10-01 00:44:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1072. [2018-10-01 00:44:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-10-01 00:44:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1161 transitions. [2018-10-01 00:44:47,279 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1161 transitions. Word has length 1059 [2018-10-01 00:44:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:47,279 INFO L480 AbstractCegarLoop]: Abstraction has 1072 states and 1161 transitions. [2018-10-01 00:44:47,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-01 00:44:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1161 transitions. [2018-10-01 00:44:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2018-10-01 00:44:47,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:47,286 INFO L375 BasicCegarLoop]: trace histogram [890, 89, 89, 1, 1, 1] [2018-10-01 00:44:47,286 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:47,286 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1885791811, now seen corresponding path program 92 times [2018-10-01 00:44:47,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:47,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:47,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:47,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:44:47,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-10-01 00:44:48,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:48,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:48,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:44:49,260 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:44:49,260 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:49,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-10-01 00:44:51,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:51,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-10-01 00:44:51,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-01 00:44:51,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-01 00:44:51,531 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:51,532 INFO L87 Difference]: Start difference. First operand 1072 states and 1161 transitions. Second operand 92 states. [2018-10-01 00:44:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:54,240 INFO L93 Difference]: Finished difference Result 1097 states and 1188 transitions. [2018-10-01 00:44:54,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-01 00:44:54,241 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1071 [2018-10-01 00:44:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:54,242 INFO L225 Difference]: With dead ends: 1097 [2018-10-01 00:44:54,242 INFO L226 Difference]: Without dead ends: 1095 [2018-10-01 00:44:54,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1071 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:44:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-10-01 00:44:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1084. [2018-10-01 00:44:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-10-01 00:44:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1174 transitions. [2018-10-01 00:44:55,553 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1174 transitions. Word has length 1071 [2018-10-01 00:44:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:55,553 INFO L480 AbstractCegarLoop]: Abstraction has 1084 states and 1174 transitions. [2018-10-01 00:44:55,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-01 00:44:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1174 transitions. [2018-10-01 00:44:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2018-10-01 00:44:55,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:55,561 INFO L375 BasicCegarLoop]: trace histogram [900, 90, 90, 1, 1, 1] [2018-10-01 00:44:55,561 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:55,561 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:55,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1501124089, now seen corresponding path program 93 times [2018-10-01 00:44:55,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:55,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:55,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:55,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:55,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-10-01 00:44:57,192 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:57,192 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:57,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:45:01,931 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 541 check-sat command(s) [2018-10-01 00:45:01,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:01,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-10-01 00:45:04,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:04,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2018-10-01 00:45:04,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-01 00:45:04,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-01 00:45:04,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:04,189 INFO L87 Difference]: Start difference. First operand 1084 states and 1174 transitions. Second operand 93 states. [2018-10-01 00:45:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:06,920 INFO L93 Difference]: Finished difference Result 1109 states and 1201 transitions. [2018-10-01 00:45:06,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-01 00:45:06,920 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1083 [2018-10-01 00:45:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:06,922 INFO L225 Difference]: With dead ends: 1109 [2018-10-01 00:45:06,922 INFO L226 Difference]: Without dead ends: 1107 [2018-10-01 00:45:06,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1174 GetRequests, 1083 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:45:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-10-01 00:45:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1096. [2018-10-01 00:45:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2018-10-01 00:45:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1187 transitions. [2018-10-01 00:45:08,188 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1187 transitions. Word has length 1083 [2018-10-01 00:45:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:08,188 INFO L480 AbstractCegarLoop]: Abstraction has 1096 states and 1187 transitions. [2018-10-01 00:45:08,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-01 00:45:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1187 transitions. [2018-10-01 00:45:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-10-01 00:45:08,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:08,195 INFO L375 BasicCegarLoop]: trace histogram [910, 91, 91, 1, 1, 1] [2018-10-01 00:45:08,196 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:08,196 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1736186705, now seen corresponding path program 94 times [2018-10-01 00:45:08,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:08,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:08,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-10-01 00:45:09,711 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:09,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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:09,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:45:10,308 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:45:10,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:10,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-10-01 00:45:12,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:12,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2018-10-01 00:45:12,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-01 00:45:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-01 00:45:12,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:12,816 INFO L87 Difference]: Start difference. First operand 1096 states and 1187 transitions. Second operand 94 states. [2018-10-01 00:45:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:15,767 INFO L93 Difference]: Finished difference Result 1121 states and 1214 transitions. [2018-10-01 00:45:15,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-01 00:45:15,768 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1095 [2018-10-01 00:45:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:15,769 INFO L225 Difference]: With dead ends: 1121 [2018-10-01 00:45:15,769 INFO L226 Difference]: Without dead ends: 1119 [2018-10-01 00:45:15,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1187 GetRequests, 1095 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:45:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-10-01 00:45:17,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1108. [2018-10-01 00:45:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-10-01 00:45:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1200 transitions. [2018-10-01 00:45:17,089 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1200 transitions. Word has length 1095 [2018-10-01 00:45:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:17,089 INFO L480 AbstractCegarLoop]: Abstraction has 1108 states and 1200 transitions. [2018-10-01 00:45:17,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-01 00:45:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1200 transitions. [2018-10-01 00:45:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2018-10-01 00:45:17,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:17,096 INFO L375 BasicCegarLoop]: trace histogram [920, 92, 92, 1, 1, 1] [2018-10-01 00:45:17,096 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:17,097 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:17,097 INFO L82 PathProgramCache]: Analyzing trace with hash 682618267, now seen corresponding path program 95 times [2018-10-01 00:45:17,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:17,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:17,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:17,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:17,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-10-01 00:45:18,599 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:18,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:18,608 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:45:23,583 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 553 check-sat command(s) [2018-10-01 00:45:23,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:23,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-10-01 00:45:25,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:25,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2018-10-01 00:45:25,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-01 00:45:25,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-01 00:45:25,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:25,942 INFO L87 Difference]: Start difference. First operand 1108 states and 1200 transitions. Second operand 95 states. [2018-10-01 00:45:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:28,813 INFO L93 Difference]: Finished difference Result 1133 states and 1227 transitions. [2018-10-01 00:45:28,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-01 00:45:28,814 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1107 [2018-10-01 00:45:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:28,815 INFO L225 Difference]: With dead ends: 1133 [2018-10-01 00:45:28,815 INFO L226 Difference]: Without dead ends: 1131 [2018-10-01 00:45:28,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1107 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:45:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-10-01 00:45:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1120. [2018-10-01 00:45:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-10-01 00:45:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1213 transitions. [2018-10-01 00:45:30,184 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1213 transitions. Word has length 1107 [2018-10-01 00:45:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:30,215 INFO L480 AbstractCegarLoop]: Abstraction has 1120 states and 1213 transitions. [2018-10-01 00:45:30,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-01 00:45:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1213 transitions. [2018-10-01 00:45:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2018-10-01 00:45:30,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:30,223 INFO L375 BasicCegarLoop]: trace histogram [930, 93, 93, 1, 1, 1] [2018-10-01 00:45:30,223 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:30,224 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:30,224 INFO L82 PathProgramCache]: Analyzing trace with hash 580428005, now seen corresponding path program 96 times [2018-10-01 00:45:30,224 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:30,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:30,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:30,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:30,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-10-01 00:45:31,694 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:31,694 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:31,701 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:45:36,766 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 555 check-sat command(s) [2018-10-01 00:45:36,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:36,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-10-01 00:45:39,498 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:39,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-10-01 00:45:39,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-01 00:45:39,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-01 00:45:39,500 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:39,500 INFO L87 Difference]: Start difference. First operand 1120 states and 1213 transitions. Second operand 96 states. [2018-10-01 00:45:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:42,524 INFO L93 Difference]: Finished difference Result 1145 states and 1240 transitions. [2018-10-01 00:45:42,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-01 00:45:42,525 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 1119 [2018-10-01 00:45:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:42,526 INFO L225 Difference]: With dead ends: 1145 [2018-10-01 00:45:42,526 INFO L226 Difference]: Without dead ends: 1143 [2018-10-01 00:45:42,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1213 GetRequests, 1119 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:45:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-10-01 00:45:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1132. [2018-10-01 00:45:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-10-01 00:45:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1226 transitions. [2018-10-01 00:45:43,985 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1226 transitions. Word has length 1119 [2018-10-01 00:45:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:43,985 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1226 transitions. [2018-10-01 00:45:43,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-01 00:45:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1226 transitions. [2018-10-01 00:45:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2018-10-01 00:45:43,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:43,994 INFO L375 BasicCegarLoop]: trace histogram [940, 94, 94, 1, 1, 1] [2018-10-01 00:45:43,994 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:43,994 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:43,994 INFO L82 PathProgramCache]: Analyzing trace with hash 267171119, now seen corresponding path program 97 times [2018-10-01 00:45:43,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:43,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:43,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:43,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:43,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-10-01 00:45:45,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:45,598 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:45,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:45:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:46,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-10-01 00:45:48,827 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:48,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-10-01 00:45:48,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-01 00:45:48,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-01 00:45:48,829 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:48,830 INFO L87 Difference]: Start difference. First operand 1132 states and 1226 transitions. Second operand 97 states. [2018-10-01 00:45:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:51,964 INFO L93 Difference]: Finished difference Result 1157 states and 1253 transitions. [2018-10-01 00:45:51,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-01 00:45:51,964 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1131 [2018-10-01 00:45:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:51,965 INFO L225 Difference]: With dead ends: 1157 [2018-10-01 00:45:51,965 INFO L226 Difference]: Without dead ends: 1155 [2018-10-01 00:45:51,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1226 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:45:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-10-01 00:45:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1144. [2018-10-01 00:45:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2018-10-01 00:45:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1239 transitions. [2018-10-01 00:45:53,406 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1239 transitions. Word has length 1131 [2018-10-01 00:45:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:53,407 INFO L480 AbstractCegarLoop]: Abstraction has 1144 states and 1239 transitions. [2018-10-01 00:45:53,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-01 00:45:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1239 transitions. [2018-10-01 00:45:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2018-10-01 00:45:53,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:53,414 INFO L375 BasicCegarLoop]: trace histogram [950, 95, 95, 1, 1, 1] [2018-10-01 00:45:53,415 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:53,415 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash -844977543, now seen corresponding path program 98 times [2018-10-01 00:45:53,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:53,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:53,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:53,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:45:53,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-10-01 00:45:54,990 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:54,990 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:54,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:45:55,617 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:45:55,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:55,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-10-01 00:45:58,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:58,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-10-01 00:45:58,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-01 00:45:58,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-01 00:45:58,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:58,072 INFO L87 Difference]: Start difference. First operand 1144 states and 1239 transitions. Second operand 98 states. [2018-10-01 00:46:01,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:01,150 INFO L93 Difference]: Finished difference Result 1169 states and 1266 transitions. [2018-10-01 00:46:01,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-01 00:46:01,150 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 1143 [2018-10-01 00:46:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:01,152 INFO L225 Difference]: With dead ends: 1169 [2018-10-01 00:46:01,152 INFO L226 Difference]: Without dead ends: 1167 [2018-10-01 00:46:01,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1239 GetRequests, 1143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:46:01,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-10-01 00:46:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1156. [2018-10-01 00:46:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2018-10-01 00:46:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1252 transitions. [2018-10-01 00:46:02,645 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1252 transitions. Word has length 1143 [2018-10-01 00:46:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:02,646 INFO L480 AbstractCegarLoop]: Abstraction has 1156 states and 1252 transitions. [2018-10-01 00:46:02,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-01 00:46:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1252 transitions. [2018-10-01 00:46:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1156 [2018-10-01 00:46:02,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:02,656 INFO L375 BasicCegarLoop]: trace histogram [960, 96, 96, 1, 1, 1] [2018-10-01 00:46:02,656 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:02,656 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash -84868925, now seen corresponding path program 99 times [2018-10-01 00:46:02,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:02,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:02,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:02,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:02,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 561696 backedges. 0 proven. 556416 refuted. 0 times theorem prover too weak. 5280 trivial. 0 not checked. [2018-10-01 00:46:04,570 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:04,570 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:04,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:46:09,980 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 577 check-sat command(s) [2018-10-01 00:46:09,980 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:10,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 561696 backedges. 0 proven. 556416 refuted. 0 times theorem prover too weak. 5280 trivial. 0 not checked. [2018-10-01 00:46:12,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:12,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-10-01 00:46:12,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-01 00:46:12,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-01 00:46:12,574 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:12,574 INFO L87 Difference]: Start difference. First operand 1156 states and 1252 transitions. Second operand 99 states. [2018-10-01 00:46:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:15,933 INFO L93 Difference]: Finished difference Result 1181 states and 1279 transitions. [2018-10-01 00:46:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-01 00:46:15,933 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1155 [2018-10-01 00:46:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:15,935 INFO L225 Difference]: With dead ends: 1181 [2018-10-01 00:46:15,935 INFO L226 Difference]: Without dead ends: 1179 [2018-10-01 00:46:15,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1252 GetRequests, 1155 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:46:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-10-01 00:46:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1168. [2018-10-01 00:46:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2018-10-01 00:46:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1265 transitions. [2018-10-01 00:46:17,425 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1265 transitions. Word has length 1155 [2018-10-01 00:46:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:17,426 INFO L480 AbstractCegarLoop]: Abstraction has 1168 states and 1265 transitions. [2018-10-01 00:46:17,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-01 00:46:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1265 transitions. [2018-10-01 00:46:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1168 [2018-10-01 00:46:17,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:17,434 INFO L375 BasicCegarLoop]: trace histogram [970, 97, 97, 1, 1, 1] [2018-10-01 00:46:17,434 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:17,434 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1722927091, now seen corresponding path program 100 times [2018-10-01 00:46:17,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:17,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:17,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:17,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:17,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 573464 backedges. 0 proven. 568129 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2018-10-01 00:46:19,400 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:19,400 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:19,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:46:20,054 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:46:20,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:20,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 573464 backedges. 0 proven. 568129 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2018-10-01 00:46:22,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:22,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-10-01 00:46:22,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-01 00:46:22,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-01 00:46:22,606 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:22,606 INFO L87 Difference]: Start difference. First operand 1168 states and 1265 transitions. Second operand 100 states. [2018-10-01 00:46:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:25,864 INFO L93 Difference]: Finished difference Result 1193 states and 1292 transitions. [2018-10-01 00:46:25,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-01 00:46:25,864 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 1167 [2018-10-01 00:46:25,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:25,866 INFO L225 Difference]: With dead ends: 1193 [2018-10-01 00:46:25,866 INFO L226 Difference]: Without dead ends: 1191 [2018-10-01 00:46:25,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1265 GetRequests, 1167 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:46:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2018-10-01 00:46:27,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1180. [2018-10-01 00:46:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2018-10-01 00:46:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1278 transitions. [2018-10-01 00:46:27,437 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1278 transitions. Word has length 1167 [2018-10-01 00:46:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:27,438 INFO L480 AbstractCegarLoop]: Abstraction has 1180 states and 1278 transitions. [2018-10-01 00:46:27,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-01 00:46:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1278 transitions. [2018-10-01 00:46:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1180 [2018-10-01 00:46:27,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:27,446 INFO L375 BasicCegarLoop]: trace histogram [980, 98, 98, 1, 1, 1] [2018-10-01 00:46:27,446 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:27,446 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1401892777, now seen corresponding path program 101 times [2018-10-01 00:46:27,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:27,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:27,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 585354 backedges. 0 proven. 579964 refuted. 0 times theorem prover too weak. 5390 trivial. 0 not checked. [2018-10-01 00:46:29,206 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:29,206 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:29,279 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:46:34,947 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 589 check-sat command(s) [2018-10-01 00:46:34,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:34,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 585354 backedges. 0 proven. 579964 refuted. 0 times theorem prover too weak. 5390 trivial. 0 not checked. [2018-10-01 00:46:37,579 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:37,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-10-01 00:46:37,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-01 00:46:37,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-01 00:46:37,581 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:37,581 INFO L87 Difference]: Start difference. First operand 1180 states and 1278 transitions. Second operand 101 states. [2018-10-01 00:46:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:40,782 INFO L93 Difference]: Finished difference Result 1205 states and 1305 transitions. [2018-10-01 00:46:40,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-01 00:46:40,782 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 1179 [2018-10-01 00:46:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:40,784 INFO L225 Difference]: With dead ends: 1205 [2018-10-01 00:46:40,784 INFO L226 Difference]: Without dead ends: 1203 [2018-10-01 00:46:40,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1278 GetRequests, 1179 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:46:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-10-01 00:46:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1192. [2018-10-01 00:46:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-10-01 00:46:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1291 transitions. [2018-10-01 00:46:42,343 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1291 transitions. Word has length 1179 [2018-10-01 00:46:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:42,343 INFO L480 AbstractCegarLoop]: Abstraction has 1192 states and 1291 transitions. [2018-10-01 00:46:42,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-01 00:46:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1291 transitions. [2018-10-01 00:46:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1192 [2018-10-01 00:46:42,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:42,351 INFO L375 BasicCegarLoop]: trace histogram [990, 99, 99, 1, 1, 1] [2018-10-01 00:46:42,351 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:42,351 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:42,351 INFO L82 PathProgramCache]: Analyzing trace with hash -632338015, now seen corresponding path program 102 times [2018-10-01 00:46:42,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:42,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:42,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:42,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:42,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 597366 backedges. 0 proven. 591921 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2018-10-01 00:46:44,154 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:44,154 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:44,160 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:46:49,911 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 590 check-sat command(s) [2018-10-01 00:46:49,911 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:49,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 597366 backedges. 0 proven. 591921 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2018-10-01 00:46:52,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:52,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-10-01 00:46:52,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-01 00:46:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-01 00:46:52,572 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:52,572 INFO L87 Difference]: Start difference. First operand 1192 states and 1291 transitions. Second operand 102 states. [2018-10-01 00:46:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:56,068 INFO L93 Difference]: Finished difference Result 1217 states and 1318 transitions. [2018-10-01 00:46:56,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-01 00:46:56,069 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 1191 [2018-10-01 00:46:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:56,070 INFO L225 Difference]: With dead ends: 1217 [2018-10-01 00:46:56,070 INFO L226 Difference]: Without dead ends: 1215 [2018-10-01 00:46:56,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1291 GetRequests, 1191 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:46:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2018-10-01 00:46:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1204. [2018-10-01 00:46:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2018-10-01 00:46:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1304 transitions. [2018-10-01 00:46:57,682 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1304 transitions. Word has length 1191 [2018-10-01 00:46:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:57,682 INFO L480 AbstractCegarLoop]: Abstraction has 1204 states and 1304 transitions. [2018-10-01 00:46:57,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-01 00:46:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1304 transitions. [2018-10-01 00:46:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2018-10-01 00:46:57,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:57,690 INFO L375 BasicCegarLoop]: trace histogram [1000, 100, 100, 1, 1, 1] [2018-10-01 00:46:57,691 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:57,691 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash 186655723, now seen corresponding path program 103 times [2018-10-01 00:46:57,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:57,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:57,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 609500 backedges. 0 proven. 604000 refuted. 0 times theorem prover too weak. 5500 trivial. 0 not checked. [2018-10-01 00:46:59,445 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:59,445 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:59,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:47:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:00,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 609500 backedges. 0 proven. 604000 refuted. 0 times theorem prover too weak. 5500 trivial. 0 not checked. [2018-10-01 00:47:02,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:02,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2018-10-01 00:47:02,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-01 00:47:02,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-01 00:47:02,747 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:02,747 INFO L87 Difference]: Start difference. First operand 1204 states and 1304 transitions. Second operand 103 states. [2018-10-01 00:47:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:06,019 INFO L93 Difference]: Finished difference Result 1229 states and 1331 transitions. [2018-10-01 00:47:06,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-01 00:47:06,019 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 1203 [2018-10-01 00:47:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:06,021 INFO L225 Difference]: With dead ends: 1229 [2018-10-01 00:47:06,021 INFO L226 Difference]: Without dead ends: 1227 [2018-10-01 00:47:06,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1304 GetRequests, 1203 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:47:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2018-10-01 00:47:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1216. [2018-10-01 00:47:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-10-01 00:47:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1317 transitions. [2018-10-01 00:47:07,734 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1317 transitions. Word has length 1203 [2018-10-01 00:47:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:07,735 INFO L480 AbstractCegarLoop]: Abstraction has 1216 states and 1317 transitions. [2018-10-01 00:47:07,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-01 00:47:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1317 transitions. [2018-10-01 00:47:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1216 [2018-10-01 00:47:07,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:07,743 INFO L375 BasicCegarLoop]: trace histogram [1010, 101, 101, 1, 1, 1] [2018-10-01 00:47:07,743 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:07,743 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash 156884789, now seen corresponding path program 104 times [2018-10-01 00:47:07,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:07,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:07,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:47:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 621756 backedges. 0 proven. 616201 refuted. 0 times theorem prover too weak. 5555 trivial. 0 not checked. [2018-10-01 00:47:09,933 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:09,933 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:09,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:47:10,581 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:47:10,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:10,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 621756 backedges. 0 proven. 616201 refuted. 0 times theorem prover too weak. 5555 trivial. 0 not checked. [2018-10-01 00:47:13,352 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:13,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2018-10-01 00:47:13,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-01 00:47:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-01 00:47:13,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:13,354 INFO L87 Difference]: Start difference. First operand 1216 states and 1317 transitions. Second operand 104 states. [2018-10-01 00:47:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:16,920 INFO L93 Difference]: Finished difference Result 1241 states and 1344 transitions. [2018-10-01 00:47:16,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-01 00:47:16,921 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 1215 [2018-10-01 00:47:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:16,922 INFO L225 Difference]: With dead ends: 1241 [2018-10-01 00:47:16,922 INFO L226 Difference]: Without dead ends: 1239 [2018-10-01 00:47:16,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1317 GetRequests, 1215 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 00:47:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-10-01 00:47:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1228. [2018-10-01 00:47:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2018-10-01 00:47:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1330 transitions. [2018-10-01 00:47:18,663 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1330 transitions. Word has length 1215 [2018-10-01 00:47:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:18,663 INFO L480 AbstractCegarLoop]: Abstraction has 1228 states and 1330 transitions. [2018-10-01 00:47:18,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-01 00:47:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1330 transitions. [2018-10-01 00:47:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1228 [2018-10-01 00:47:18,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:18,672 INFO L375 BasicCegarLoop]: trace histogram [1020, 102, 102, 1, 1, 1] [2018-10-01 00:47:18,672 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:18,672 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:18,672 INFO L82 PathProgramCache]: Analyzing trace with hash 565377919, now seen corresponding path program 105 times [2018-10-01 00:47:18,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:18,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:18,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:18,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:18,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 634134 backedges. 0 proven. 628524 refuted. 0 times theorem prover too weak. 5610 trivial. 0 not checked. [2018-10-01 00:47:20,619 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:20,619 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:20,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:47:26,825 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 613 check-sat command(s) [2018-10-01 00:47:26,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:26,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 634134 backedges. 0 proven. 628524 refuted. 0 times theorem prover too weak. 5610 trivial. 0 not checked. [2018-10-01 00:47:29,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:29,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2018-10-01 00:47:29,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-01 00:47:29,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-01 00:47:29,515 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:29,515 INFO L87 Difference]: Start difference. First operand 1228 states and 1330 transitions. Second operand 105 states. [2018-10-01 00:47:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:33,365 INFO L93 Difference]: Finished difference Result 1253 states and 1357 transitions. [2018-10-01 00:47:33,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-01 00:47:33,365 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 1227 [2018-10-01 00:47:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:33,367 INFO L225 Difference]: With dead ends: 1253 [2018-10-01 00:47:33,367 INFO L226 Difference]: Without dead ends: 1251 [2018-10-01 00:47:33,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1330 GetRequests, 1227 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:47:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-10-01 00:47:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1240. [2018-10-01 00:47:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2018-10-01 00:47:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1343 transitions. [2018-10-01 00:47:35,131 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1343 transitions. Word has length 1227 [2018-10-01 00:47:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:35,132 INFO L480 AbstractCegarLoop]: Abstraction has 1240 states and 1343 transitions. [2018-10-01 00:47:35,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-01 00:47:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1343 transitions. [2018-10-01 00:47:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1240 [2018-10-01 00:47:35,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:35,141 INFO L375 BasicCegarLoop]: trace histogram [1030, 103, 103, 1, 1, 1] [2018-10-01 00:47:35,141 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:35,142 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1021183799, now seen corresponding path program 106 times [2018-10-01 00:47:35,142 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:35,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:35,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:35,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:35,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:36,971 INFO L134 CoverageAnalysis]: Checked inductivity of 646634 backedges. 0 proven. 640969 refuted. 0 times theorem prover too weak. 5665 trivial. 0 not checked. [2018-10-01 00:47:36,971 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:36,971 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:36,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:47:37,654 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:47:37,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:37,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 646634 backedges. 0 proven. 640969 refuted. 0 times theorem prover too weak. 5665 trivial. 0 not checked. [2018-10-01 00:47:40,477 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:40,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2018-10-01 00:47:40,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-01 00:47:40,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-01 00:47:40,478 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:40,479 INFO L87 Difference]: Start difference. First operand 1240 states and 1343 transitions. Second operand 106 states. [2018-10-01 00:47:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:44,313 INFO L93 Difference]: Finished difference Result 1265 states and 1370 transitions. [2018-10-01 00:47:44,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-01 00:47:44,314 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 1239 [2018-10-01 00:47:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:44,315 INFO L225 Difference]: With dead ends: 1265 [2018-10-01 00:47:44,315 INFO L226 Difference]: Without dead ends: 1263 [2018-10-01 00:47:44,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1343 GetRequests, 1239 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:47:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2018-10-01 00:47:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1252. [2018-10-01 00:47:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-01 00:47:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1356 transitions. [2018-10-01 00:47:46,082 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1356 transitions. Word has length 1239 [2018-10-01 00:47:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:46,083 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 1356 transitions. [2018-10-01 00:47:46,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-01 00:47:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1356 transitions. [2018-10-01 00:47:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1252 [2018-10-01 00:47:46,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:46,092 INFO L375 BasicCegarLoop]: trace histogram [1040, 104, 104, 1, 1, 1] [2018-10-01 00:47:46,092 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:46,092 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash 517822227, now seen corresponding path program 107 times [2018-10-01 00:47:46,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:46,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:46,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:46,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:46,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 659256 backedges. 0 proven. 653536 refuted. 0 times theorem prover too weak. 5720 trivial. 0 not checked. [2018-10-01 00:47:47,881 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:47,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:47,888 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:47:54,367 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 625 check-sat command(s) [2018-10-01 00:47:54,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:54,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 659256 backedges. 0 proven. 653536 refuted. 0 times theorem prover too weak. 5720 trivial. 0 not checked. [2018-10-01 00:47:57,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:57,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2018-10-01 00:47:57,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-01 00:47:57,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-01 00:47:57,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:57,453 INFO L87 Difference]: Start difference. First operand 1252 states and 1356 transitions. Second operand 107 states. [2018-10-01 00:48:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:01,115 INFO L93 Difference]: Finished difference Result 1277 states and 1383 transitions. [2018-10-01 00:48:01,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-01 00:48:01,115 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 1251 [2018-10-01 00:48:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:01,117 INFO L225 Difference]: With dead ends: 1277 [2018-10-01 00:48:01,117 INFO L226 Difference]: Without dead ends: 1275 [2018-10-01 00:48:01,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1356 GetRequests, 1251 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:48:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2018-10-01 00:48:02,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1264. [2018-10-01 00:48:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1264 states. [2018-10-01 00:48:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1369 transitions. [2018-10-01 00:48:02,949 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1369 transitions. Word has length 1251 [2018-10-01 00:48:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:02,950 INFO L480 AbstractCegarLoop]: Abstraction has 1264 states and 1369 transitions. [2018-10-01 00:48:02,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-01 00:48:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1369 transitions. [2018-10-01 00:48:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1264 [2018-10-01 00:48:02,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:02,958 INFO L375 BasicCegarLoop]: trace histogram [1050, 105, 105, 1, 1, 1] [2018-10-01 00:48:02,958 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:02,958 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash -933521827, now seen corresponding path program 108 times [2018-10-01 00:48:02,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:02,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:02,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 672000 backedges. 0 proven. 666225 refuted. 0 times theorem prover too weak. 5775 trivial. 0 not checked. [2018-10-01 00:48:04,814 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:04,814 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:04,822 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:48:11,365 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 627 check-sat command(s) [2018-10-01 00:48:11,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:11,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 672000 backedges. 0 proven. 666225 refuted. 0 times theorem prover too weak. 5775 trivial. 0 not checked. [2018-10-01 00:48:14,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:14,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2018-10-01 00:48:14,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-01 00:48:14,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-01 00:48:14,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:14,202 INFO L87 Difference]: Start difference. First operand 1264 states and 1369 transitions. Second operand 108 states. [2018-10-01 00:48:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:18,150 INFO L93 Difference]: Finished difference Result 1289 states and 1396 transitions. [2018-10-01 00:48:18,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-01 00:48:18,153 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 1263 [2018-10-01 00:48:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:18,155 INFO L225 Difference]: With dead ends: 1289 [2018-10-01 00:48:18,155 INFO L226 Difference]: Without dead ends: 1287 [2018-10-01 00:48:18,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1369 GetRequests, 1263 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:48:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2018-10-01 00:48:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1276. [2018-10-01 00:48:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2018-10-01 00:48:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1382 transitions. [2018-10-01 00:48:20,015 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1382 transitions. Word has length 1263 [2018-10-01 00:48:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:20,016 INFO L480 AbstractCegarLoop]: Abstraction has 1276 states and 1382 transitions. [2018-10-01 00:48:20,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-01 00:48:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1382 transitions. [2018-10-01 00:48:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1276 [2018-10-01 00:48:20,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:20,024 INFO L375 BasicCegarLoop]: trace histogram [1060, 106, 106, 1, 1, 1] [2018-10-01 00:48:20,025 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:20,025 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:20,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1431516839, now seen corresponding path program 109 times [2018-10-01 00:48:20,025 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:20,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:20,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:20,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:20,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 684866 backedges. 0 proven. 679036 refuted. 0 times theorem prover too weak. 5830 trivial. 0 not checked. [2018-10-01 00:48:22,103 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:22,104 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:22,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:48:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:22,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 684866 backedges. 0 proven. 679036 refuted. 0 times theorem prover too weak. 5830 trivial. 0 not checked. [2018-10-01 00:48:25,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:25,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2018-10-01 00:48:25,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-01 00:48:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-01 00:48:25,702 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:25,702 INFO L87 Difference]: Start difference. First operand 1276 states and 1382 transitions. Second operand 109 states. [2018-10-01 00:48:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:29,784 INFO L93 Difference]: Finished difference Result 1301 states and 1409 transitions. [2018-10-01 00:48:29,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-01 00:48:29,784 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 1275 [2018-10-01 00:48:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:29,786 INFO L225 Difference]: With dead ends: 1301 [2018-10-01 00:48:29,786 INFO L226 Difference]: Without dead ends: 1299 [2018-10-01 00:48:29,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1382 GetRequests, 1275 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:48:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2018-10-01 00:48:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1288. [2018-10-01 00:48:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-10-01 00:48:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1395 transitions. [2018-10-01 00:48:31,730 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1395 transitions. Word has length 1275 [2018-10-01 00:48:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:31,731 INFO L480 AbstractCegarLoop]: Abstraction has 1288 states and 1395 transitions. [2018-10-01 00:48:31,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-01 00:48:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1395 transitions. [2018-10-01 00:48:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1288 [2018-10-01 00:48:31,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:31,739 INFO L375 BasicCegarLoop]: trace histogram [1070, 107, 107, 1, 1, 1] [2018-10-01 00:48:31,739 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:31,740 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:31,740 INFO L82 PathProgramCache]: Analyzing trace with hash -38094863, now seen corresponding path program 110 times [2018-10-01 00:48:31,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:31,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:31,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:31,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:48:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 697854 backedges. 0 proven. 691969 refuted. 0 times theorem prover too weak. 5885 trivial. 0 not checked. [2018-10-01 00:48:33,670 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:33,670 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:33,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:48:34,377 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:48:34,378 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:34,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 697854 backedges. 0 proven. 691969 refuted. 0 times theorem prover too weak. 5885 trivial. 0 not checked. [2018-10-01 00:48:37,437 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:37,438 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2018-10-01 00:48:37,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-01 00:48:37,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-01 00:48:37,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:37,440 INFO L87 Difference]: Start difference. First operand 1288 states and 1395 transitions. Second operand 110 states. [2018-10-01 00:48:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:41,638 INFO L93 Difference]: Finished difference Result 1313 states and 1422 transitions. [2018-10-01 00:48:41,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-01 00:48:41,639 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 1287 [2018-10-01 00:48:41,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:41,641 INFO L225 Difference]: With dead ends: 1313 [2018-10-01 00:48:41,641 INFO L226 Difference]: Without dead ends: 1311 [2018-10-01 00:48:41,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1395 GetRequests, 1287 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:48:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2018-10-01 00:48:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1300. [2018-10-01 00:48:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-10-01 00:48:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1408 transitions. [2018-10-01 00:48:43,608 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1408 transitions. Word has length 1287 [2018-10-01 00:48:43,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:43,609 INFO L480 AbstractCegarLoop]: Abstraction has 1300 states and 1408 transitions. [2018-10-01 00:48:43,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-01 00:48:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1408 transitions. [2018-10-01 00:48:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2018-10-01 00:48:43,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:43,617 INFO L375 BasicCegarLoop]: trace histogram [1080, 108, 108, 1, 1, 1] [2018-10-01 00:48:43,617 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:43,618 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:43,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1003002427, now seen corresponding path program 111 times [2018-10-01 00:48:43,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:43,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:43,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 710964 backedges. 0 proven. 705024 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2018-10-01 00:48:45,811 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:45,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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:45,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:48:52,698 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 649 check-sat command(s) [2018-10-01 00:48:52,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:52,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 710964 backedges. 0 proven. 705024 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2018-10-01 00:48:55,695 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:55,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2018-10-01 00:48:55,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-01 00:48:55,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-01 00:48:55,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:55,697 INFO L87 Difference]: Start difference. First operand 1300 states and 1408 transitions. Second operand 111 states. [2018-10-01 00:48:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:59,638 INFO L93 Difference]: Finished difference Result 1325 states and 1435 transitions. [2018-10-01 00:48:59,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-01 00:48:59,638 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 1299 [2018-10-01 00:48:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:59,640 INFO L225 Difference]: With dead ends: 1325 [2018-10-01 00:48:59,640 INFO L226 Difference]: Without dead ends: 1323 [2018-10-01 00:48:59,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1408 GetRequests, 1299 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:48:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-10-01 00:49:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1312. [2018-10-01 00:49:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2018-10-01 00:49:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1421 transitions. [2018-10-01 00:49:01,653 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1421 transitions. Word has length 1299 [2018-10-01 00:49:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:01,654 INFO L480 AbstractCegarLoop]: Abstraction has 1312 states and 1421 transitions. [2018-10-01 00:49:01,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-01 00:49:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1421 transitions. [2018-10-01 00:49:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1312 [2018-10-01 00:49:01,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:01,663 INFO L375 BasicCegarLoop]: trace histogram [1090, 109, 109, 1, 1, 1] [2018-10-01 00:49:01,663 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:01,663 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:01,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1811111301, now seen corresponding path program 112 times [2018-10-01 00:49:01,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:01,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:01,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 724196 backedges. 0 proven. 718201 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2018-10-01 00:49:03,738 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:03,738 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:03,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:49:04,461 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:49:04,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:04,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 724196 backedges. 0 proven. 718201 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2018-10-01 00:49:07,505 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:07,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2018-10-01 00:49:07,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-01 00:49:07,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-01 00:49:07,507 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:07,507 INFO L87 Difference]: Start difference. First operand 1312 states and 1421 transitions. Second operand 112 states. [2018-10-01 00:49:11,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:11,843 INFO L93 Difference]: Finished difference Result 1337 states and 1448 transitions. [2018-10-01 00:49:11,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-01 00:49:11,844 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 1311 [2018-10-01 00:49:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:11,845 INFO L225 Difference]: With dead ends: 1337 [2018-10-01 00:49:11,845 INFO L226 Difference]: Without dead ends: 1335 [2018-10-01 00:49:11,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1421 GetRequests, 1311 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:49:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2018-10-01 00:49:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1324. [2018-10-01 00:49:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2018-10-01 00:49:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1434 transitions. [2018-10-01 00:49:13,903 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1434 transitions. Word has length 1311 [2018-10-01 00:49:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:13,904 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 1434 transitions. [2018-10-01 00:49:13,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-01 00:49:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1434 transitions. [2018-10-01 00:49:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1324 [2018-10-01 00:49:13,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:13,913 INFO L375 BasicCegarLoop]: trace histogram [1100, 110, 110, 1, 1, 1] [2018-10-01 00:49:13,913 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:13,913 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1827766735, now seen corresponding path program 113 times [2018-10-01 00:49:13,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:13,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:13,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:13,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:13,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 737550 backedges. 0 proven. 731500 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-10-01 00:49:15,918 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:15,918 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:15,926 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:49:23,227 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 661 check-sat command(s) [2018-10-01 00:49:23,228 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:23,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 737550 backedges. 0 proven. 731500 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-10-01 00:49:26,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:26,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2018-10-01 00:49:26,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-01 00:49:26,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-01 00:49:26,238 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:26,238 INFO L87 Difference]: Start difference. First operand 1324 states and 1434 transitions. Second operand 113 states. [2018-10-01 00:49:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:30,327 INFO L93 Difference]: Finished difference Result 1349 states and 1461 transitions. [2018-10-01 00:49:30,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-01 00:49:30,327 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 1323 [2018-10-01 00:49:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:30,329 INFO L225 Difference]: With dead ends: 1349 [2018-10-01 00:49:30,329 INFO L226 Difference]: Without dead ends: 1347 [2018-10-01 00:49:30,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1434 GetRequests, 1323 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:49:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-10-01 00:49:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1336. [2018-10-01 00:49:32,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2018-10-01 00:49:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1447 transitions. [2018-10-01 00:49:32,398 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1447 transitions. Word has length 1323 [2018-10-01 00:49:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:32,399 INFO L480 AbstractCegarLoop]: Abstraction has 1336 states and 1447 transitions. [2018-10-01 00:49:32,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-01 00:49:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1447 transitions. [2018-10-01 00:49:32,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1336 [2018-10-01 00:49:32,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:32,410 INFO L375 BasicCegarLoop]: trace histogram [1110, 111, 111, 1, 1, 1] [2018-10-01 00:49:32,410 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:32,410 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:32,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1069123353, now seen corresponding path program 114 times [2018-10-01 00:49:32,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:32,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:32,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:32,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:32,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 751026 backedges. 0 proven. 744921 refuted. 0 times theorem prover too weak. 6105 trivial. 0 not checked. [2018-10-01 00:49:34,567 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:34,567 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:34,574 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:49:42,085 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 662 check-sat command(s) [2018-10-01 00:49:42,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:42,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 751026 backedges. 0 proven. 744921 refuted. 0 times theorem prover too weak. 6105 trivial. 0 not checked. [2018-10-01 00:49:45,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:45,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2018-10-01 00:49:45,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-01 00:49:45,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-01 00:49:45,358 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:45,358 INFO L87 Difference]: Start difference. First operand 1336 states and 1447 transitions. Second operand 114 states. [2018-10-01 00:49:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:49,749 INFO L93 Difference]: Finished difference Result 1361 states and 1474 transitions. [2018-10-01 00:49:49,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-01 00:49:49,749 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 1335 [2018-10-01 00:49:49,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:49,751 INFO L225 Difference]: With dead ends: 1361 [2018-10-01 00:49:49,751 INFO L226 Difference]: Without dead ends: 1359 [2018-10-01 00:49:49,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1447 GetRequests, 1335 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time [2018-10-01 00:49:49,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2018-10-01 00:49:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1348. [2018-10-01 00:49:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2018-10-01 00:49:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1460 transitions. [2018-10-01 00:49:51,898 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1460 transitions. Word has length 1335 [2018-10-01 00:49:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:51,898 INFO L480 AbstractCegarLoop]: Abstraction has 1348 states and 1460 transitions. [2018-10-01 00:49:51,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-01 00:49:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1460 transitions. [2018-10-01 00:49:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1348 [2018-10-01 00:49:51,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:51,907 INFO L375 BasicCegarLoop]: trace histogram [1120, 112, 112, 1, 1, 1] [2018-10-01 00:49:51,907 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:51,908 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:51,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1484657309, now seen corresponding path program 115 times [2018-10-01 00:49:51,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:51,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:51,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:51,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:51,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 764624 backedges. 0 proven. 758464 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2018-10-01 00:49:53,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:53,995 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:54,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:49:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:54,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 764624 backedges. 0 proven. 758464 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2018-10-01 00:49:58,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:58,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2018-10-01 00:49:58,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-01 00:49:58,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-01 00:49:58,088 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:58,088 INFO L87 Difference]: Start difference. First operand 1348 states and 1460 transitions. Second operand 115 states. [2018-10-01 00:50:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:02,669 INFO L93 Difference]: Finished difference Result 1373 states and 1487 transitions. [2018-10-01 00:50:02,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-01 00:50:02,669 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 1347 [2018-10-01 00:50:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:02,671 INFO L225 Difference]: With dead ends: 1373 [2018-10-01 00:50:02,671 INFO L226 Difference]: Without dead ends: 1371 [2018-10-01 00:50:02,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1460 GetRequests, 1347 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time [2018-10-01 00:50:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-10-01 00:50:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1360. [2018-10-01 00:50:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-10-01 00:50:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1473 transitions. [2018-10-01 00:50:04,845 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1473 transitions. Word has length 1347 [2018-10-01 00:50:04,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:04,846 INFO L480 AbstractCegarLoop]: Abstraction has 1360 states and 1473 transitions. [2018-10-01 00:50:04,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-01 00:50:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1473 transitions. [2018-10-01 00:50:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2018-10-01 00:50:04,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:04,856 INFO L375 BasicCegarLoop]: trace histogram [1130, 113, 113, 1, 1, 1] [2018-10-01 00:50:04,856 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:04,856 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:04,856 INFO L82 PathProgramCache]: Analyzing trace with hash -910084947, now seen corresponding path program 116 times [2018-10-01 00:50:04,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:04,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:04,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:04,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:50:04,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 778344 backedges. 0 proven. 772129 refuted. 0 times theorem prover too weak. 6215 trivial. 0 not checked. [2018-10-01 00:50:06,945 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:06,945 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:06,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:50:07,683 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:50:07,684 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:07,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 778344 backedges. 0 proven. 772129 refuted. 0 times theorem prover too weak. 6215 trivial. 0 not checked. [2018-10-01 00:50:11,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:11,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2018-10-01 00:50:11,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-01 00:50:11,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-01 00:50:11,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:11,196 INFO L87 Difference]: Start difference. First operand 1360 states and 1473 transitions. Second operand 116 states. [2018-10-01 00:50:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:15,533 INFO L93 Difference]: Finished difference Result 1385 states and 1500 transitions. [2018-10-01 00:50:15,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-01 00:50:15,533 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 1359 [2018-10-01 00:50:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:15,535 INFO L225 Difference]: With dead ends: 1385 [2018-10-01 00:50:15,535 INFO L226 Difference]: Without dead ends: 1383 [2018-10-01 00:50:15,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1473 GetRequests, 1359 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time [2018-10-01 00:50:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-10-01 00:50:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1372. [2018-10-01 00:50:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-10-01 00:50:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1486 transitions. [2018-10-01 00:50:17,774 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1486 transitions. Word has length 1359 [2018-10-01 00:50:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:17,775 INFO L480 AbstractCegarLoop]: Abstraction has 1372 states and 1486 transitions. [2018-10-01 00:50:17,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-01 00:50:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1486 transitions. [2018-10-01 00:50:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1372 [2018-10-01 00:50:17,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:17,785 INFO L375 BasicCegarLoop]: trace histogram [1140, 114, 114, 1, 1, 1] [2018-10-01 00:50:17,785 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:17,785 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash -835855113, now seen corresponding path program 117 times [2018-10-01 00:50:17,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:17,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 792186 backedges. 0 proven. 785916 refuted. 0 times theorem prover too weak. 6270 trivial. 0 not checked. [2018-10-01 00:50:20,124 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:20,124 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:20,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:50:28,038 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 685 check-sat command(s) [2018-10-01 00:50:28,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:28,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 792186 backedges. 0 proven. 785916 refuted. 0 times theorem prover too weak. 6270 trivial. 0 not checked. [2018-10-01 00:50:31,428 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:31,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2018-10-01 00:50:31,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-01 00:50:31,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-01 00:50:31,430 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:31,430 INFO L87 Difference]: Start difference. First operand 1372 states and 1486 transitions. Second operand 117 states. [2018-10-01 00:50:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:35,885 INFO L93 Difference]: Finished difference Result 1397 states and 1513 transitions. [2018-10-01 00:50:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-01 00:50:35,885 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 1371 [2018-10-01 00:50:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:35,886 INFO L225 Difference]: With dead ends: 1397 [2018-10-01 00:50:35,887 INFO L226 Difference]: Without dead ends: 1395 [2018-10-01 00:50:35,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1486 GetRequests, 1371 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time [2018-10-01 00:50:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-10-01 00:50:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1384. [2018-10-01 00:50:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2018-10-01 00:50:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1499 transitions. [2018-10-01 00:50:38,160 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1499 transitions. Word has length 1371 [2018-10-01 00:50:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:38,161 INFO L480 AbstractCegarLoop]: Abstraction has 1384 states and 1499 transitions. [2018-10-01 00:50:38,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-01 00:50:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1499 transitions. [2018-10-01 00:50:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1384 [2018-10-01 00:50:38,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:38,172 INFO L375 BasicCegarLoop]: trace histogram [1150, 115, 115, 1, 1, 1] [2018-10-01 00:50:38,172 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:38,172 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:38,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2126407233, now seen corresponding path program 118 times [2018-10-01 00:50:38,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:38,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:38,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:38,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:38,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:40,504 INFO L134 CoverageAnalysis]: Checked inductivity of 806150 backedges. 0 proven. 799825 refuted. 0 times theorem prover too weak. 6325 trivial. 0 not checked. [2018-10-01 00:50:40,504 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:40,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:40,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:50:41,281 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:50:41,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:41,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 806150 backedges. 0 proven. 799825 refuted. 0 times theorem prover too weak. 6325 trivial. 0 not checked. [2018-10-01 00:50:44,611 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:44,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2018-10-01 00:50:44,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-01 00:50:44,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-01 00:50:44,613 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:44,613 INFO L87 Difference]: Start difference. First operand 1384 states and 1499 transitions. Second operand 118 states. [2018-10-01 00:50:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:49,274 INFO L93 Difference]: Finished difference Result 1409 states and 1526 transitions. [2018-10-01 00:50:49,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-01 00:50:49,274 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 1383 [2018-10-01 00:50:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:49,276 INFO L225 Difference]: With dead ends: 1409 [2018-10-01 00:50:49,276 INFO L226 Difference]: Without dead ends: 1407 [2018-10-01 00:50:49,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1499 GetRequests, 1383 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time [2018-10-01 00:50:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2018-10-01 00:50:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1396. [2018-10-01 00:50:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2018-10-01 00:50:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1512 transitions. [2018-10-01 00:50:51,605 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1512 transitions. Word has length 1383 [2018-10-01 00:50:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:51,605 INFO L480 AbstractCegarLoop]: Abstraction has 1396 states and 1512 transitions. [2018-10-01 00:50:51,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-01 00:50:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1512 transitions. [2018-10-01 00:50:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1396 [2018-10-01 00:50:51,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:51,615 INFO L375 BasicCegarLoop]: trace histogram [1160, 116, 116, 1, 1, 1] [2018-10-01 00:50:51,615 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:51,615 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:51,615 INFO L82 PathProgramCache]: Analyzing trace with hash -408334197, now seen corresponding path program 119 times [2018-10-01 00:50:51,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:51,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:51,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 820236 backedges. 0 proven. 813856 refuted. 0 times theorem prover too weak. 6380 trivial. 0 not checked. [2018-10-01 00:50:53,835 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:53,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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:53,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:51:02,129 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 697 check-sat command(s) [2018-10-01 00:51:02,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:51:02,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 820236 backedges. 0 proven. 813856 refuted. 0 times theorem prover too weak. 6380 trivial. 0 not checked. [2018-10-01 00:51:05,386 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:05,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2018-10-01 00:51:05,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-01 00:51:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-01 00:51:05,389 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:05,389 INFO L87 Difference]: Start difference. First operand 1396 states and 1512 transitions. Second operand 119 states. [2018-10-01 00:51:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:10,074 INFO L93 Difference]: Finished difference Result 1421 states and 1539 transitions. [2018-10-01 00:51:10,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-01 00:51:10,074 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 1395 [2018-10-01 00:51:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:10,075 INFO L225 Difference]: With dead ends: 1421 [2018-10-01 00:51:10,076 INFO L226 Difference]: Without dead ends: 1419 [2018-10-01 00:51:10,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1512 GetRequests, 1395 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:51:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-10-01 00:51:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1408. [2018-10-01 00:51:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2018-10-01 00:51:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1525 transitions. [2018-10-01 00:51:12,451 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1525 transitions. Word has length 1395 [2018-10-01 00:51:12,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:12,452 INFO L480 AbstractCegarLoop]: Abstraction has 1408 states and 1525 transitions. [2018-10-01 00:51:12,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-01 00:51:12,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1525 transitions. [2018-10-01 00:51:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1408 [2018-10-01 00:51:12,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:12,461 INFO L375 BasicCegarLoop]: trace histogram [1170, 117, 117, 1, 1, 1] [2018-10-01 00:51:12,462 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:12,462 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:12,462 INFO L82 PathProgramCache]: Analyzing trace with hash -144368683, now seen corresponding path program 120 times [2018-10-01 00:51:12,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:12,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:12,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:12,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:12,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 834444 backedges. 0 proven. 828009 refuted. 0 times theorem prover too weak. 6435 trivial. 0 not checked. [2018-10-01 00:51:14,785 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:14,785 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:14,793 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:51:23,165 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 699 check-sat command(s) [2018-10-01 00:51:23,165 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:51:23,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 834444 backedges. 0 proven. 828009 refuted. 0 times theorem prover too weak. 6435 trivial. 0 not checked. [2018-10-01 00:51:26,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:26,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2018-10-01 00:51:26,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-01 00:51:26,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-01 00:51:26,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:26,491 INFO L87 Difference]: Start difference. First operand 1408 states and 1525 transitions. Second operand 120 states. [2018-10-01 00:51:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:31,386 INFO L93 Difference]: Finished difference Result 1433 states and 1552 transitions. [2018-10-01 00:51:31,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-01 00:51:31,386 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 1407 [2018-10-01 00:51:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:31,388 INFO L225 Difference]: With dead ends: 1433 [2018-10-01 00:51:31,388 INFO L226 Difference]: Without dead ends: 1431 [2018-10-01 00:51:31,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1525 GetRequests, 1407 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 00:51:31,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2018-10-01 00:51:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1420. [2018-10-01 00:51:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2018-10-01 00:51:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1538 transitions. [2018-10-01 00:51:33,801 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1538 transitions. Word has length 1407 [2018-10-01 00:51:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:33,802 INFO L480 AbstractCegarLoop]: Abstraction has 1420 states and 1538 transitions. [2018-10-01 00:51:33,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-01 00:51:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1538 transitions. [2018-10-01 00:51:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1420 [2018-10-01 00:51:33,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:33,812 INFO L375 BasicCegarLoop]: trace histogram [1180, 118, 118, 1, 1, 1] [2018-10-01 00:51:33,812 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:33,812 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:33,813 INFO L82 PathProgramCache]: Analyzing trace with hash 514344991, now seen corresponding path program 121 times [2018-10-01 00:51:33,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:33,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:33,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:33,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:33,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 848774 backedges. 0 proven. 842284 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2018-10-01 00:51:36,132 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:36,132 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:36,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:51:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:36,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 848774 backedges. 0 proven. 842284 refuted. 0 times theorem prover too weak. 6490 trivial. 0 not checked. [2018-10-01 00:51:40,220 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:40,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2018-10-01 00:51:40,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-01 00:51:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-01 00:51:40,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:40,223 INFO L87 Difference]: Start difference. First operand 1420 states and 1538 transitions. Second operand 121 states. [2018-10-01 00:51:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:45,083 INFO L93 Difference]: Finished difference Result 1445 states and 1565 transitions. [2018-10-01 00:51:45,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-01 00:51:45,083 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 1419 [2018-10-01 00:51:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:45,084 INFO L225 Difference]: With dead ends: 1445 [2018-10-01 00:51:45,084 INFO L226 Difference]: Without dead ends: 1443 [2018-10-01 00:51:45,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1538 GetRequests, 1419 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:51:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2018-10-01 00:51:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1432. [2018-10-01 00:51:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2018-10-01 00:51:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1551 transitions. [2018-10-01 00:51:47,612 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1551 transitions. Word has length 1419 [2018-10-01 00:51:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:47,612 INFO L480 AbstractCegarLoop]: Abstraction has 1432 states and 1551 transitions. [2018-10-01 00:51:47,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-01 00:51:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1551 transitions. [2018-10-01 00:51:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2018-10-01 00:51:47,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:47,626 INFO L375 BasicCegarLoop]: trace histogram [1190, 119, 119, 1, 1, 1] [2018-10-01 00:51:47,626 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:47,627 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:47,627 INFO L82 PathProgramCache]: Analyzing trace with hash -261532311, now seen corresponding path program 122 times [2018-10-01 00:51:47,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:47,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:47,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:47,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:51:47,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 863226 backedges. 0 proven. 856681 refuted. 0 times theorem prover too weak. 6545 trivial. 0 not checked. [2018-10-01 00:51:49,932 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:49,932 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:49,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:51:50,707 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:51:50,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:51:50,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 863226 backedges. 0 proven. 856681 refuted. 0 times theorem prover too weak. 6545 trivial. 0 not checked. [2018-10-01 00:51:54,249 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:54,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2018-10-01 00:51:54,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-01 00:51:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-01 00:51:54,251 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:54,251 INFO L87 Difference]: Start difference. First operand 1432 states and 1551 transitions. Second operand 122 states. [2018-10-01 00:51:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:59,072 INFO L93 Difference]: Finished difference Result 1457 states and 1578 transitions. [2018-10-01 00:51:59,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-01 00:51:59,072 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 1431 [2018-10-01 00:51:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:59,074 INFO L225 Difference]: With dead ends: 1457 [2018-10-01 00:51:59,074 INFO L226 Difference]: Without dead ends: 1455 [2018-10-01 00:51:59,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1551 GetRequests, 1431 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time [2018-10-01 00:51:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. Received shutdown request... [2018-10-01 00:52:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1444. [2018-10-01 00:52:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2018-10-01 00:52:01,666 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 00:52:01,673 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 00:52:01,673 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:52:01 BoogieIcfgContainer [2018-10-01 00:52:01,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:52:01,674 INFO L168 Benchmark]: Toolchain (without parser) took 816699.43 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -764.5 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-01 00:52:01,679 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:52:01,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:52:01,680 INFO L168 Benchmark]: Boogie Preprocessor took 23.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:52:01,681 INFO L168 Benchmark]: RCFGBuilder took 333.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:52:01,682 INFO L168 Benchmark]: TraceAbstraction took 816294.25 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-10-01 00:52:01,685 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 333.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 816294.25 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 816.2s OverallTime, 124 OverallIterations, 1190 TraceHistogramMax, 221.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 494 SDtfs, 14514 SDslu, 9503 SDs, 0 SdLazy, 17085 SolverSat, 698 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93517 GetRequests, 85993 SyntacticMatches, 0 SemanticMatches, 7524 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 179.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1432occurred in iteration=123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 92.9s AutomataMinimizationTime, 124 MinimizatonAttempts, 1280 StatesRemovedByMinimization, 119 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 10.2s SsaConstructionTime, 184.0s SatisfiabilityAnalysisTime, 251.5s InterpolantComputationTime, 172064 NumberOfCodeBlocks, 171831 NumberOfCodeBlocksAsserted, 21290 NumberOfCheckSat, 171818 ConstructedInterpolants, 0 QuantifiedInterpolants, 493137176 SizeOfPredicates, 122 NumberOfNonLiveVariables, 344150 ConjunctsInSsa, 7408 ConjunctsInUnsatCore, 246 InterpolantComputations, 2 PerfectInterpolantSequences, 787883/69321617 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-52-01-695.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-52-01-695.csv Completed graceful shutdown