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/down.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:22:34,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:22:34,837 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:22:34,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:22:34,852 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:22:34,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:22:34,854 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:22:34,856 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:22:34,857 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:22:34,858 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:22:34,859 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:22:34,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:22:34,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:22:34,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:22:34,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:22:34,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:22:34,864 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:22:34,866 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:22:34,868 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:22:34,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:22:34,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:22:34,872 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:22:34,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:22:34,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:22:34,875 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:22:34,876 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:22:34,877 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:22:34,878 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:22:34,879 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:22:34,880 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:22:34,880 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:22:34,881 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:22:34,881 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:22:34,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:22:34,882 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:22:34,883 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:22:34,883 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-04 14:22:34,907 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:22:34,908 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:22:34,908 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:22:34,909 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:22:34,909 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:22:34,909 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:22:34,910 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:22:34,910 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:22:34,910 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:22:34,910 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:22:34,910 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:22:34,911 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:22:34,911 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:22:34,911 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:22:34,911 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:22:34,911 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:22:34,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:22:34,912 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:22:34,912 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:22:34,912 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:22:34,912 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:22:34,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:22:34,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:22:34,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:22:34,913 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:22:34,913 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:22:34,914 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:22:34,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:22:34,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:22:34,914 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:22:34,914 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:22:34,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:22:34,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:22:34,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:22:34,975 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:22:34,976 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:22:34,976 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-10-04 14:22:34,977 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-10-04 14:22:35,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:22:35,030 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:22:35,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:22:35,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:22:35,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:22:35,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/1) ... [2018-10-04 14:22:35,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/1) ... [2018-10-04 14:22:35,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:22:35,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:22:35,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:22:35,072 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:22:35,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/1) ... [2018-10-04 14:22:35,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/1) ... [2018-10-04 14:22:35,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/1) ... [2018-10-04 14:22:35,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/1) ... [2018-10-04 14:22:35,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/1) ... [2018-10-04 14:22:35,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/1) ... [2018-10-04 14:22:35,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/1) ... [2018-10-04 14:22:35,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:22:35,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:22:35,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:22:35,092 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:22:35,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:22:35,166 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 14:22:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:22:35,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:22:35,494 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:22:35,495 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:22:35 BoogieIcfgContainer [2018-10-04 14:22:35,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:22:35,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:22:35,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:22:35,502 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:22:35,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:22:35" (1/2) ... [2018-10-04 14:22:35,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654567b0 and model type down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:22:35, skipping insertion in model container [2018-10-04 14:22:35,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:22:35" (2/2) ... [2018-10-04 14:22:35,507 INFO L112 eAbstractionObserver]: Analyzing ICFG down.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-10-04 14:22:35,517 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:22:35,529 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:22:35,591 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:22:35,592 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:22:35,592 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:22:35,592 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:22:35,593 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:22:35,593 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:22:35,593 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:22:35,594 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:22:35,594 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:22:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-10-04 14:22:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:22:35,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:35,635 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:35,636 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:35,644 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:35,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1951930377, now seen corresponding path program 1 times [2018-10-04 14:22:35,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:35,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:35,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:35,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:35,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:35,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:35,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:22:35,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:22:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:22:35,857 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:35,859 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-10-04 14:22:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:35,989 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2018-10-04 14:22:35,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:22:35,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-04 14:22:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:36,002 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:22:36,003 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 14:22:36,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:22:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 14:22:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-10-04 14:22:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 14:22:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-10-04 14:22:36,042 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2018-10-04 14:22:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:36,043 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-10-04 14:22:36,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:22:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2018-10-04 14:22:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:22:36,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:36,044 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:36,045 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:36,045 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1951989959, now seen corresponding path program 1 times [2018-10-04 14:22:36,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:36,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:36,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:36,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:36,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:36,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:22:36,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:22:36,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:22:36,130 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:36,131 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 4 states. [2018-10-04 14:22:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:36,213 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-10-04 14:22:36,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:22:36,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-10-04 14:22:36,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:36,214 INFO L225 Difference]: With dead ends: 20 [2018-10-04 14:22:36,214 INFO L226 Difference]: Without dead ends: 13 [2018-10-04 14:22:36,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 14:22:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-04 14:22:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-04 14:22:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 14:22:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-10-04 14:22:36,219 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2018-10-04 14:22:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:36,220 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-10-04 14:22:36,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:22:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2018-10-04 14:22:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:22:36,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:36,221 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:36,221 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:36,221 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:36,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1455783312, now seen corresponding path program 1 times [2018-10-04 14:22:36,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:36,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:22:36,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:36,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 14:22:36,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:22:36,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:22:36,300 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:36,300 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 4 states. [2018-10-04 14:22:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:36,371 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-10-04 14:22:36,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:22:36,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 14:22:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:36,373 INFO L225 Difference]: With dead ends: 19 [2018-10-04 14:22:36,373 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 14:22:36,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 14:22:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 14:22:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-10-04 14:22:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 14:22:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-10-04 14:22:36,379 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2018-10-04 14:22:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:36,379 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-10-04 14:22:36,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:22:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-10-04 14:22:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:22:36,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:36,380 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:36,380 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:36,381 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:36,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1455723730, now seen corresponding path program 1 times [2018-10-04 14:22:36,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:36,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:36,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:36,451 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-04 14:22:36,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:22:36,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:22:36,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:22:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:22:36,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:36,453 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2018-10-04 14:22:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:36,550 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-10-04 14:22:36,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:22:36,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-10-04 14:22:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:36,554 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:22:36,554 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:22:36,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 14:22:36,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:22:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-10-04 14:22:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-04 14:22:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-10-04 14:22:36,563 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2018-10-04 14:22:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:36,565 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-10-04 14:22:36,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:22:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-10-04 14:22:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:22:36,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:36,566 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:36,566 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:36,567 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1394403420, now seen corresponding path program 1 times [2018-10-04 14:22:36,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:36,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:36,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:36,731 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:36,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:36,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:37,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:37,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:22:37,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:22:37,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:22:37,007 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:37,008 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2018-10-04 14:22:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:37,181 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-10-04 14:22:37,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:22:37,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-10-04 14:22:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:37,186 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:22:37,186 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 14:22:37,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 6 [2018-10-04 14:22:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 14:22:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 14:22:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 14:22:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-10-04 14:22:37,192 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2018-10-04 14:22:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:37,192 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-10-04 14:22:37,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:22:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-10-04 14:22:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:22:37,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:37,194 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:22:37,194 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:37,194 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash -961145443, now seen corresponding path program 2 times [2018-10-04 14:22:37,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:37,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:37,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:37,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:37,284 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:37,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:37,318 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:37,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:37,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:37,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:37,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:22:37,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:22:37,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:22:37,414 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:37,415 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2018-10-04 14:22:37,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:37,538 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-10-04 14:22:37,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:22:37,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 14:22:37,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:37,540 INFO L225 Difference]: With dead ends: 30 [2018-10-04 14:22:37,540 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 14:22:37,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:22:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 14:22:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-10-04 14:22:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:22:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-10-04 14:22:37,547 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-10-04 14:22:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:37,547 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-04 14:22:37,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:22:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-10-04 14:22:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:22:37,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:37,548 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 14:22:37,549 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:37,549 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:37,549 INFO L82 PathProgramCache]: Analyzing trace with hash -552275309, now seen corresponding path program 3 times [2018-10-04 14:22:37,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:37,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:37,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:37,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:37,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:37,668 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:37,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:22:37,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 14:22:37,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:37,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:37,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:37,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:22:37,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:22:37,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:22:37,784 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:37,784 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 8 states. [2018-10-04 14:22:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:37,994 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-10-04 14:22:37,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:22:37,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-10-04 14:22:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:37,996 INFO L225 Difference]: With dead ends: 40 [2018-10-04 14:22:37,996 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:22:37,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 14:22:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:22:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 14:22:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 14:22:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-04 14:22:38,013 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2018-10-04 14:22:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:38,013 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-04 14:22:38,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:22:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-04 14:22:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:22:38,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:38,016 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 14:22:38,016 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:38,017 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:38,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2071906362, now seen corresponding path program 4 times [2018-10-04 14:22:38,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:38,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:38,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:38,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:38,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:38,376 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:38,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:22:38,397 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:22:38,397 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:38,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:38,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:38,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:22:38,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:22:38,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:22:38,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:38,650 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2018-10-04 14:22:38,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:38,708 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-10-04 14:22:38,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:22:38,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-04 14:22:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:38,709 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:22:38,709 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:22:38,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 4 [2018-10-04 14:22:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:22:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-10-04 14:22:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 14:22:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-04 14:22:38,717 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-10-04 14:22:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:38,717 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-04 14:22:38,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:22:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-04 14:22:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 14:22:38,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:38,718 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-04 14:22:38,719 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:38,719 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash -992407888, now seen corresponding path program 5 times [2018-10-04 14:22:38,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:38,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:38,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:38,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:38,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:38,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:38,852 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:38,867 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:22:38,910 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 14:22:38,910 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:38,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:39,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:39,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:22:39,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:22:39,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:22:39,020 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:39,020 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2018-10-04 14:22:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:39,152 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-10-04 14:22:39,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:22:39,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-04 14:22:39,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:39,153 INFO L225 Difference]: With dead ends: 49 [2018-10-04 14:22:39,153 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 14:22:39,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 14:22:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 14:22:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 14:22:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:22:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-10-04 14:22:39,165 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2018-10-04 14:22:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:39,165 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-10-04 14:22:39,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:22:39,165 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-10-04 14:22:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 14:22:39,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:39,166 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2018-10-04 14:22:39,167 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:39,167 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:39,167 INFO L82 PathProgramCache]: Analyzing trace with hash 390441321, now seen corresponding path program 6 times [2018-10-04 14:22:39,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:39,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:39,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:39,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:39,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:39,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:39,316 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:39,325 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:22:39,346 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 14:22:39,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:39,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:39,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:39,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:22:39,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:22:39,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:22:39,444 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:39,444 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-10-04 14:22:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:39,508 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-10-04 14:22:39,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:22:39,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-10-04 14:22:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:39,510 INFO L225 Difference]: With dead ends: 40 [2018-10-04 14:22:39,510 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 14:22:39,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:22:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 14:22:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-10-04 14:22:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 14:22:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-10-04 14:22:39,517 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-10-04 14:22:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:39,517 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-10-04 14:22:39,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:22:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-10-04 14:22:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 14:22:39,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:39,519 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2018-10-04 14:22:39,519 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:39,519 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:39,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1927135327, now seen corresponding path program 7 times [2018-10-04 14:22:39,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:39,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:39,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:39,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:39,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:39,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:39,691 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:39,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:39,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:39,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:39,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:22:39,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:22:39,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:22:39,857 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:39,858 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2018-10-04 14:22:40,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:40,005 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-10-04 14:22:40,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:22:40,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-10-04 14:22:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:40,006 INFO L225 Difference]: With dead ends: 58 [2018-10-04 14:22:40,007 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 14:22:40,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-04 14:22:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 14:22:40,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 14:22:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 14:22:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-04 14:22:40,014 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2018-10-04 14:22:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:40,014 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-04 14:22:40,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:22:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-10-04 14:22:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 14:22:40,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:40,016 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2018-10-04 14:22:40,016 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:40,016 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash -906890938, now seen corresponding path program 8 times [2018-10-04 14:22:40,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:40,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:40,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:40,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:40,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:40,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:40,243 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:40,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:40,285 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:40,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:40,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:40,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:40,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:22:40,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:22:40,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:22:40,468 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:40,468 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-10-04 14:22:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:40,626 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-04 14:22:40,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:22:40,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-10-04 14:22:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:40,627 INFO L225 Difference]: With dead ends: 45 [2018-10-04 14:22:40,627 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:22:40,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 6 [2018-10-04 14:22:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:22:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-10-04 14:22:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 14:22:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-10-04 14:22:40,635 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2018-10-04 14:22:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:40,636 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-10-04 14:22:40,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:22:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-10-04 14:22:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 14:22:40,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:40,637 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2018-10-04 14:22:40,637 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:40,637 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash -466038340, now seen corresponding path program 9 times [2018-10-04 14:22:40,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:40,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:40,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:40,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:40,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:40,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:40,776 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:40,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:22:40,889 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:22:40,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:40,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:41,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:41,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:22:41,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:22:41,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:22:41,180 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:41,180 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 14 states. [2018-10-04 14:22:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:41,387 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-10-04 14:22:41,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:22:41,387 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-10-04 14:22:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:41,389 INFO L225 Difference]: With dead ends: 67 [2018-10-04 14:22:41,389 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 14:22:41,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime 13 [2018-10-04 14:22:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 14:22:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-04 14:22:41,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 14:22:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-10-04 14:22:41,396 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 32 [2018-10-04 14:22:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:41,396 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-10-04 14:22:41,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:22:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-10-04 14:22:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 14:22:41,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:41,398 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2018-10-04 14:22:41,398 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:41,398 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1282545973, now seen corresponding path program 10 times [2018-10-04 14:22:41,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:41,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:41,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:41,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:41,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:41,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:41,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:22:41,550 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:22:41,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:41,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:41,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:41,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:22:41,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:22:41,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:22:41,848 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:41,848 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-10-04 14:22:41,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:41,917 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-10-04 14:22:41,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:22:41,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-10-04 14:22:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:41,919 INFO L225 Difference]: With dead ends: 50 [2018-10-04 14:22:41,919 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 14:22:41,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 7 [2018-10-04 14:22:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 14:22:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-10-04 14:22:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 14:22:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-10-04 14:22:41,928 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2018-10-04 14:22:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:41,928 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-10-04 14:22:41,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:22:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-10-04 14:22:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 14:22:41,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:41,930 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2018-10-04 14:22:41,930 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:41,930 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:41,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1500867115, now seen corresponding path program 11 times [2018-10-04 14:22:41,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:41,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:41,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:41,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:41,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 84 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:42,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:42,097 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:42,105 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:22:42,143 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:22:42,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:42,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 84 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:42,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:42,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:22:42,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:22:42,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:22:42,407 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:42,407 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 16 states. [2018-10-04 14:22:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:42,708 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-10-04 14:22:42,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:22:42,708 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-10-04 14:22:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:42,709 INFO L225 Difference]: With dead ends: 76 [2018-10-04 14:22:42,709 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 14:22:42,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 15 [2018-10-04 14:22:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 14:22:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 14:22:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 14:22:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-04 14:22:42,717 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2018-10-04 14:22:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:42,717 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-04 14:22:42,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:22:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-04 14:22:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 14:22:42,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:42,718 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1] [2018-10-04 14:22:42,718 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:42,719 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:42,719 INFO L82 PathProgramCache]: Analyzing trace with hash 594208338, now seen corresponding path program 12 times [2018-10-04 14:22:42,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:42,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:42,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:42,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:42,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 40 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:42,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:42,888 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:42,896 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:22:42,932 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:22:42,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:42,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 40 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:43,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:22:43,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:22:43,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:22:43,254 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:43,254 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2018-10-04 14:22:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:43,342 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-10-04 14:22:43,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:22:43,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-10-04 14:22:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:43,343 INFO L225 Difference]: With dead ends: 55 [2018-10-04 14:22:43,343 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 14:22:43,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 8 [2018-10-04 14:22:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 14:22:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-10-04 14:22:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 14:22:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-10-04 14:22:43,351 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 38 [2018-10-04 14:22:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:43,351 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-10-04 14:22:43,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:22:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-10-04 14:22:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-04 14:22:43,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:43,352 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2018-10-04 14:22:43,352 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:43,353 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1054367944, now seen corresponding path program 13 times [2018-10-04 14:22:43,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:43,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:43,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:43,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:43,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:43,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:43,562 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:43,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:43,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:44,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:44,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:22:44,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:22:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:22:44,108 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:44,108 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 18 states. [2018-10-04 14:22:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:44,285 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-10-04 14:22:44,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:22:44,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-10-04 14:22:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:44,286 INFO L225 Difference]: With dead ends: 85 [2018-10-04 14:22:44,286 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 14:22:44,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.1s impTime 17 [2018-10-04 14:22:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 14:22:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 14:22:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 14:22:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-10-04 14:22:44,294 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 42 [2018-10-04 14:22:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:44,294 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-10-04 14:22:44,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:22:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-10-04 14:22:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 14:22:44,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:44,295 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2018-10-04 14:22:44,296 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:44,296 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1098736897, now seen corresponding path program 14 times [2018-10-04 14:22:44,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:44,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:44,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 50 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:44,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:44,444 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:44,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:44,473 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:44,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:44,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 50 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:44,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:44,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:22:44,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:22:44,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:22:44,599 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:44,599 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 11 states. [2018-10-04 14:22:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:44,667 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-10-04 14:22:44,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:22:44,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-10-04 14:22:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:44,668 INFO L225 Difference]: With dead ends: 60 [2018-10-04 14:22:44,668 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 14:22:44,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 14:22:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 14:22:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-10-04 14:22:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 14:22:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-10-04 14:22:44,677 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 43 [2018-10-04 14:22:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:44,677 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-10-04 14:22:44,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:22:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-10-04 14:22:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 14:22:44,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:44,678 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2018-10-04 14:22:44,678 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:44,679 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:44,679 INFO L82 PathProgramCache]: Analyzing trace with hash -48369673, now seen corresponding path program 15 times [2018-10-04 14:22:44,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:44,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:44,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:44,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:44,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 144 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:44,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:44,984 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:44,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:22:45,021 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:22:45,022 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:45,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 144 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:45,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:45,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:22:45,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:22:45,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:22:45,155 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:45,155 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 20 states. [2018-10-04 14:22:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:45,446 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-10-04 14:22:45,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:22:45,446 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-10-04 14:22:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:45,447 INFO L225 Difference]: With dead ends: 94 [2018-10-04 14:22:45,447 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 14:22:45,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 19 [2018-10-04 14:22:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 14:22:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 14:22:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 14:22:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-10-04 14:22:45,454 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 47 [2018-10-04 14:22:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:45,454 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-10-04 14:22:45,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:22:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-10-04 14:22:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 14:22:45,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:45,455 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1] [2018-10-04 14:22:45,456 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:45,456 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:45,456 INFO L82 PathProgramCache]: Analyzing trace with hash 239052638, now seen corresponding path program 16 times [2018-10-04 14:22:45,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:45,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:45,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:45,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:45,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 61 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:45,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:45,647 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:45,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:22:45,676 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:22:45,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:45,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 61 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:45,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:45,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:22:45,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:22:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:22:45,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:45,797 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 12 states. [2018-10-04 14:22:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:45,865 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-10-04 14:22:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:22:45,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-10-04 14:22:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:45,866 INFO L225 Difference]: With dead ends: 65 [2018-10-04 14:22:45,866 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 14:22:45,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 10 [2018-10-04 14:22:45,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 14:22:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-10-04 14:22:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-04 14:22:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-10-04 14:22:45,874 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 48 [2018-10-04 14:22:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:45,874 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-10-04 14:22:45,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:22:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-10-04 14:22:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 14:22:45,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:45,875 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2018-10-04 14:22:45,875 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:45,876 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1074641876, now seen corresponding path program 17 times [2018-10-04 14:22:45,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:45,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:45,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:45,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:45,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 180 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:46,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:46,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:46,197 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:22:46,227 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 14:22:46,228 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:46,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 180 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:46,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:46,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 14:22:46,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:22:46,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:22:46,442 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:46,442 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 22 states. [2018-10-04 14:22:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:46,779 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-10-04 14:22:46,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:22:46,779 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2018-10-04 14:22:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:46,780 INFO L225 Difference]: With dead ends: 103 [2018-10-04 14:22:46,780 INFO L226 Difference]: Without dead ends: 56 [2018-10-04 14:22:46,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 21 [2018-10-04 14:22:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-04 14:22:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-04 14:22:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 14:22:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-10-04 14:22:46,786 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 52 [2018-10-04 14:22:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:46,787 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-10-04 14:22:46,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:22:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-10-04 14:22:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-04 14:22:46,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:46,788 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1, 1, 1] [2018-10-04 14:22:46,788 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:46,788 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:46,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1305899827, now seen corresponding path program 18 times [2018-10-04 14:22:46,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:46,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:46,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:46,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 73 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:47,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:47,022 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:47,029 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:22:47,069 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 14:22:47,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:47,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 73 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:47,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:47,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 14:22:47,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:22:47,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:22:47,237 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:47,237 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 13 states. [2018-10-04 14:22:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:47,299 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-10-04 14:22:47,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:22:47,303 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-10-04 14:22:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:47,303 INFO L225 Difference]: With dead ends: 70 [2018-10-04 14:22:47,303 INFO L226 Difference]: Without dead ends: 64 [2018-10-04 14:22:47,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 11 [2018-10-04 14:22:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-04 14:22:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-10-04 14:22:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-04 14:22:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-10-04 14:22:47,310 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 53 [2018-10-04 14:22:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:47,311 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-10-04 14:22:47,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:22:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-10-04 14:22:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-04 14:22:47,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:47,312 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2018-10-04 14:22:47,312 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:47,312 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:47,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1754878403, now seen corresponding path program 19 times [2018-10-04 14:22:47,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:47,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:47,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:47,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:47,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 220 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:47,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:47,796 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:47,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:47,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 220 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:47,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:47,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:22:47,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:22:47,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:22:47,942 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:47,942 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 24 states. [2018-10-04 14:22:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:48,302 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-10-04 14:22:48,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:22:48,302 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-10-04 14:22:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:48,302 INFO L225 Difference]: With dead ends: 112 [2018-10-04 14:22:48,303 INFO L226 Difference]: Without dead ends: 61 [2018-10-04 14:22:48,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 23 [2018-10-04 14:22:48,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-04 14:22:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-04 14:22:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 14:22:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-10-04 14:22:48,310 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 57 [2018-10-04 14:22:48,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:48,310 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-10-04 14:22:48,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:22:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-10-04 14:22:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-04 14:22:48,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:48,311 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1] [2018-10-04 14:22:48,311 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:48,311 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:48,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1471794070, now seen corresponding path program 20 times [2018-10-04 14:22:48,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:48,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:48,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:48,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 86 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:48,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:48,443 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:48,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:48,479 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:48,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:48,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 86 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:48,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:48,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:22:48,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:22:48,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:22:48,626 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:48,626 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 14 states. [2018-10-04 14:22:48,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:48,814 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-10-04 14:22:48,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:22:48,815 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-10-04 14:22:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:48,815 INFO L225 Difference]: With dead ends: 75 [2018-10-04 14:22:48,815 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 14:22:48,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 12 [2018-10-04 14:22:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 14:22:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-10-04 14:22:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 14:22:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-10-04 14:22:48,821 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 58 [2018-10-04 14:22:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:48,821 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-10-04 14:22:48,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:22:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-10-04 14:22:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-04 14:22:48,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:48,822 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2018-10-04 14:22:48,822 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:48,823 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash 716104416, now seen corresponding path program 21 times [2018-10-04 14:22:48,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:48,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:48,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:48,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:48,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 264 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:49,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:49,386 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:49,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:22:49,461 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 14:22:49,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:49,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 264 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:49,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:49,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:22:49,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:22:49,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:22:49,607 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:49,607 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 26 states. [2018-10-04 14:22:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:49,866 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-10-04 14:22:49,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:22:49,866 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-10-04 14:22:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:49,867 INFO L225 Difference]: With dead ends: 121 [2018-10-04 14:22:49,867 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 14:22:49,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 25 [2018-10-04 14:22:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 14:22:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-04 14:22:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 14:22:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-10-04 14:22:49,873 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2018-10-04 14:22:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:49,873 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-10-04 14:22:49,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:22:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-10-04 14:22:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 14:22:49,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:49,874 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1, 1, 1] [2018-10-04 14:22:49,874 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:49,874 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1699180391, now seen corresponding path program 22 times [2018-10-04 14:22:49,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:49,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:49,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 100 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:51,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:51,655 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:51,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:22:51,711 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:22:51,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:51,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 100 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:51,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:51,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:22:51,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:22:51,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:22:51,893 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:51,894 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 15 states. [2018-10-04 14:22:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:51,962 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-10-04 14:22:51,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:22:51,963 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-10-04 14:22:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:51,963 INFO L225 Difference]: With dead ends: 80 [2018-10-04 14:22:51,963 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 14:22:51,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 0.9s impTime 13 [2018-10-04 14:22:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 14:22:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-10-04 14:22:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-04 14:22:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-10-04 14:22:51,971 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2018-10-04 14:22:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:51,971 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-10-04 14:22:51,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:22:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-10-04 14:22:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 14:22:51,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:51,972 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2018-10-04 14:22:51,973 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:51,973 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1490448497, now seen corresponding path program 23 times [2018-10-04 14:22:51,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:51,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:51,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 312 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:52,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:52,530 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:52,537 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:22:52,572 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-04 14:22:52,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:52,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 312 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:52,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:52,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 14:22:52,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:22:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:22:52,804 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:52,804 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 28 states. [2018-10-04 14:22:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:53,234 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-10-04 14:22:53,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:22:53,234 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2018-10-04 14:22:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:53,235 INFO L225 Difference]: With dead ends: 130 [2018-10-04 14:22:53,235 INFO L226 Difference]: Without dead ends: 71 [2018-10-04 14:22:53,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 27 [2018-10-04 14:22:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-04 14:22:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-04 14:22:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 14:22:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-10-04 14:22:53,240 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 67 [2018-10-04 14:22:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:53,241 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-10-04 14:22:53,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:22:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-10-04 14:22:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 14:22:53,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:53,242 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1, 1, 1] [2018-10-04 14:22:53,242 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:53,242 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1188334966, now seen corresponding path program 24 times [2018-10-04 14:22:53,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:53,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:53,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:53,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 115 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:53,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:53,505 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:53,512 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:22:53,551 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 14:22:53,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:53,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 115 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:53,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:53,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:22:53,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:22:53,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:22:53,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:53,674 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 16 states. [2018-10-04 14:22:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:53,761 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-10-04 14:22:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:22:53,761 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2018-10-04 14:22:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:53,762 INFO L225 Difference]: With dead ends: 85 [2018-10-04 14:22:53,762 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 14:22:53,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 14 [2018-10-04 14:22:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 14:22:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-10-04 14:22:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-04 14:22:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-10-04 14:22:53,769 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 68 [2018-10-04 14:22:53,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:53,769 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-10-04 14:22:53,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:22:53,770 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-10-04 14:22:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 14:22:53,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:53,770 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2018-10-04 14:22:53,771 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:53,771 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1190013460, now seen corresponding path program 25 times [2018-10-04 14:22:53,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:53,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:53,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:53,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:53,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 364 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:54,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:54,142 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:54,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:54,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 364 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:54,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:54,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:22:54,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:22:54,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:22:54,335 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:54,335 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 30 states. [2018-10-04 14:22:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:54,850 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-10-04 14:22:54,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:22:54,850 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 72 [2018-10-04 14:22:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:54,851 INFO L225 Difference]: With dead ends: 139 [2018-10-04 14:22:54,851 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 14:22:54,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 29 [2018-10-04 14:22:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 14:22:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 14:22:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 14:22:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-10-04 14:22:54,861 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 72 [2018-10-04 14:22:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:54,862 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-10-04 14:22:54,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:22:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-10-04 14:22:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 14:22:54,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:54,863 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1, 1, 1] [2018-10-04 14:22:54,863 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:54,863 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:54,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1746112411, now seen corresponding path program 26 times [2018-10-04 14:22:54,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:54,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:54,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:54,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:54,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 131 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:55,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:55,053 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:55,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:22:55,095 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:22:55,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:55,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 131 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:55,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:55,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:22:55,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:22:55,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:22:55,229 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:55,229 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 17 states. [2018-10-04 14:22:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:55,482 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-10-04 14:22:55,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:22:55,482 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-10-04 14:22:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:55,483 INFO L225 Difference]: With dead ends: 90 [2018-10-04 14:22:55,483 INFO L226 Difference]: Without dead ends: 84 [2018-10-04 14:22:55,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 15 [2018-10-04 14:22:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-04 14:22:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-10-04 14:22:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 14:22:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-10-04 14:22:55,492 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 73 [2018-10-04 14:22:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:55,492 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-10-04 14:22:55,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:22:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-10-04 14:22:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 14:22:55,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:55,493 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2018-10-04 14:22:55,493 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:55,493 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:55,493 INFO L82 PathProgramCache]: Analyzing trace with hash 613460315, now seen corresponding path program 27 times [2018-10-04 14:22:55,494 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:55,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:55,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 420 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:55,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:55,870 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:55,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:22:55,923 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 14:22:55,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:55,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 420 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:56,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:56,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 14:22:56,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:22:56,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:22:56,082 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:56,083 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 32 states. [2018-10-04 14:22:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:56,263 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-10-04 14:22:56,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:22:56,263 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 77 [2018-10-04 14:22:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:56,264 INFO L225 Difference]: With dead ends: 148 [2018-10-04 14:22:56,264 INFO L226 Difference]: Without dead ends: 81 [2018-10-04 14:22:56,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 31 [2018-10-04 14:22:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-04 14:22:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-04 14:22:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-04 14:22:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-10-04 14:22:56,271 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 77 [2018-10-04 14:22:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:56,271 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-10-04 14:22:56,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:22:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-10-04 14:22:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 14:22:56,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:56,272 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1, 1, 1] [2018-10-04 14:22:56,272 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:56,272 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:56,273 INFO L82 PathProgramCache]: Analyzing trace with hash 381727362, now seen corresponding path program 28 times [2018-10-04 14:22:56,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:56,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:56,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:56,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:56,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 148 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:56,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:56,440 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:56,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:22:56,485 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:22:56,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:56,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 148 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:56,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:56,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:22:56,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:22:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:22:56,666 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:56,666 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 18 states. [2018-10-04 14:22:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:56,753 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-10-04 14:22:56,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:22:56,753 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-10-04 14:22:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:56,753 INFO L225 Difference]: With dead ends: 95 [2018-10-04 14:22:56,754 INFO L226 Difference]: Without dead ends: 89 [2018-10-04 14:22:56,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 16 [2018-10-04 14:22:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-04 14:22:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-10-04 14:22:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 14:22:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-10-04 14:22:56,761 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 78 [2018-10-04 14:22:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:56,762 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-10-04 14:22:56,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:22:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-10-04 14:22:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-04 14:22:56,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:56,763 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2018-10-04 14:22:56,763 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:56,763 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:56,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1123248904, now seen corresponding path program 29 times [2018-10-04 14:22:56,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:56,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:56,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:56,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:56,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 480 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:57,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:57,105 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:57,112 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:22:57,345 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-04 14:22:57,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:57,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 480 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:57,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:57,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 14:22:57,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 14:22:57,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 14:22:57,578 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:57,578 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 34 states. [2018-10-04 14:22:58,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:58,252 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-10-04 14:22:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:22:58,252 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 82 [2018-10-04 14:22:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:58,253 INFO L225 Difference]: With dead ends: 157 [2018-10-04 14:22:58,253 INFO L226 Difference]: Without dead ends: 86 [2018-10-04 14:22:58,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 33 [2018-10-04 14:22:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-04 14:22:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-10-04 14:22:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-04 14:22:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-10-04 14:22:58,262 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 82 [2018-10-04 14:22:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:58,262 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-10-04 14:22:58,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 14:22:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-10-04 14:22:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-04 14:22:58,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:58,263 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1, 1, 1] [2018-10-04 14:22:58,263 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:58,264 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:58,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1191652401, now seen corresponding path program 30 times [2018-10-04 14:22:58,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:58,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:58,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:58,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:58,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 166 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:58,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:58,473 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:58,481 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:22:58,527 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-04 14:22:58,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:22:58,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 166 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:58,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:58,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 14:22:58,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:22:58,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:22:58,687 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:58,687 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 19 states. [2018-10-04 14:22:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:22:58,785 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-10-04 14:22:58,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:22:58,785 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2018-10-04 14:22:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:22:58,786 INFO L225 Difference]: With dead ends: 100 [2018-10-04 14:22:58,786 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 14:22:58,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 17 [2018-10-04 14:22:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 14:22:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-10-04 14:22:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-04 14:22:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-10-04 14:22:58,796 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 83 [2018-10-04 14:22:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:22:58,796 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-10-04 14:22:58,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:22:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-10-04 14:22:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 14:22:58,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:22:58,797 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2018-10-04 14:22:58,797 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:22:58,798 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:22:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash 219193127, now seen corresponding path program 31 times [2018-10-04 14:22:58,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:22:58,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:22:58,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:58,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:22:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:22:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 544 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:59,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:22:59,580 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:22:59,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:22:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:22:59,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:22:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 544 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:22:59,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:22:59,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 14:22:59,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:22:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:22:59,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:22:59,925 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 36 states. [2018-10-04 14:23:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:00,706 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2018-10-04 14:23:00,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:23:00,707 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 87 [2018-10-04 14:23:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:00,708 INFO L225 Difference]: With dead ends: 166 [2018-10-04 14:23:00,708 INFO L226 Difference]: Without dead ends: 91 [2018-10-04 14:23:00,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.7s impTime 35 [2018-10-04 14:23:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-04 14:23:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-04 14:23:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 14:23:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-10-04 14:23:00,717 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 87 [2018-10-04 14:23:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:00,717 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-04 14:23:00,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:23:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-10-04 14:23:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-04 14:23:00,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:00,718 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1, 1, 1] [2018-10-04 14:23:00,718 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:00,718 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:00,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1134517362, now seen corresponding path program 32 times [2018-10-04 14:23:00,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:00,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:00,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 185 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:01,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:01,003 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:01,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:23:01,057 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:23:01,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:01,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 185 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:01,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:01,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:23:01,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:23:01,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:23:01,249 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:01,249 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 20 states. [2018-10-04 14:23:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:01,356 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-10-04 14:23:01,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:23:01,356 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2018-10-04 14:23:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:01,358 INFO L225 Difference]: With dead ends: 105 [2018-10-04 14:23:01,358 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 14:23:01,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 18 [2018-10-04 14:23:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 14:23:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-10-04 14:23:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-04 14:23:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-10-04 14:23:01,368 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 88 [2018-10-04 14:23:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:01,368 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-10-04 14:23:01,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:23:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-10-04 14:23:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-04 14:23:01,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:01,369 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2018-10-04 14:23:01,369 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:01,369 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:01,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1074454524, now seen corresponding path program 33 times [2018-10-04 14:23:01,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:01,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 612 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:02,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:02,212 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:02,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:23:02,265 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 14:23:02,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:02,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 612 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:02,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:02,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 14:23:02,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 14:23:02,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 14:23:02,431 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:02,431 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 38 states. [2018-10-04 14:23:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:03,321 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2018-10-04 14:23:03,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:23:03,321 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 92 [2018-10-04 14:23:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:03,322 INFO L225 Difference]: With dead ends: 175 [2018-10-04 14:23:03,322 INFO L226 Difference]: Without dead ends: 96 [2018-10-04 14:23:03,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 37 [2018-10-04 14:23:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-04 14:23:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-10-04 14:23:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 14:23:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-10-04 14:23:03,329 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 92 [2018-10-04 14:23:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:03,330 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-10-04 14:23:03,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 14:23:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-10-04 14:23:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-04 14:23:03,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:03,331 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1, 1, 1] [2018-10-04 14:23:03,331 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:03,331 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1513438211, now seen corresponding path program 34 times [2018-10-04 14:23:03,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:03,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:03,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:03,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:03,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 205 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:03,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:03,621 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:03,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:23:03,668 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:23:03,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:03,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 205 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:04,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:04,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 14:23:04,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:23:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:23:04,540 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:04,541 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 21 states. [2018-10-04 14:23:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:04,640 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2018-10-04 14:23:04,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:23:04,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2018-10-04 14:23:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:04,641 INFO L225 Difference]: With dead ends: 110 [2018-10-04 14:23:04,641 INFO L226 Difference]: Without dead ends: 104 [2018-10-04 14:23:04,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.1s impTime 19 [2018-10-04 14:23:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-04 14:23:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-10-04 14:23:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 14:23:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-10-04 14:23:04,650 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2018-10-04 14:23:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:04,650 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-10-04 14:23:04,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:23:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-10-04 14:23:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 14:23:04,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:04,651 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2018-10-04 14:23:04,651 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:04,651 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1385467661, now seen corresponding path program 35 times [2018-10-04 14:23:04,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:04,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:04,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 684 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:06,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:06,930 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:06,937 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:23:06,990 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-04 14:23:06,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:06,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 684 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:07,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:07,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 14:23:07,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 14:23:07,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 14:23:07,181 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:07,181 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 40 states. [2018-10-04 14:23:08,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:08,623 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2018-10-04 14:23:08,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:23:08,623 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 97 [2018-10-04 14:23:08,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:08,624 INFO L225 Difference]: With dead ends: 184 [2018-10-04 14:23:08,624 INFO L226 Difference]: Without dead ends: 101 [2018-10-04 14:23:08,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.3s impTime 39 [2018-10-04 14:23:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-04 14:23:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-04 14:23:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-04 14:23:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-10-04 14:23:08,634 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2018-10-04 14:23:08,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:08,635 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-10-04 14:23:08,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 14:23:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-10-04 14:23:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-04 14:23:08,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:08,636 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1, 1, 1] [2018-10-04 14:23:08,636 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:08,636 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash -209035110, now seen corresponding path program 36 times [2018-10-04 14:23:08,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:08,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:08,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 226 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:08,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:08,920 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:08,929 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:23:08,985 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 14:23:08,985 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:08,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 226 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:09,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:09,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 14:23:09,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 14:23:09,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 14:23:09,198 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:09,198 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 22 states. [2018-10-04 14:23:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:09,348 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-10-04 14:23:09,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 14:23:09,348 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 98 [2018-10-04 14:23:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:09,349 INFO L225 Difference]: With dead ends: 115 [2018-10-04 14:23:09,350 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 14:23:09,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 20 [2018-10-04 14:23:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 14:23:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-10-04 14:23:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-04 14:23:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-10-04 14:23:09,361 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 98 [2018-10-04 14:23:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:09,361 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-10-04 14:23:09,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 14:23:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-10-04 14:23:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-04 14:23:09,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:09,362 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2018-10-04 14:23:09,362 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:09,363 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1566476528, now seen corresponding path program 37 times [2018-10-04 14:23:09,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:09,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:09,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:09,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:09,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 760 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:11,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:11,318 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:11,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:11,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 760 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:11,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:11,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 14:23:11,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 14:23:11,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 14:23:11,563 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:11,563 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 42 states. [2018-10-04 14:23:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:12,538 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2018-10-04 14:23:12,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:23:12,538 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 102 [2018-10-04 14:23:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:12,539 INFO L225 Difference]: With dead ends: 193 [2018-10-04 14:23:12,539 INFO L226 Difference]: Without dead ends: 106 [2018-10-04 14:23:12,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.7s impTime 41 [2018-10-04 14:23:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-04 14:23:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-10-04 14:23:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-04 14:23:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-10-04 14:23:12,549 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 102 [2018-10-04 14:23:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:12,549 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-10-04 14:23:12,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 14:23:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-10-04 14:23:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-04 14:23:12,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:12,550 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1, 1, 1] [2018-10-04 14:23:12,550 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:12,550 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:12,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1920546761, now seen corresponding path program 38 times [2018-10-04 14:23:12,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:12,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:12,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:12,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:12,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 248 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:12,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:12,922 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:12,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:23:12,990 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:23:12,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:12,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 248 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:13,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:13,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:23:13,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:23:13,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:23:13,278 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:13,278 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 23 states. [2018-10-04 14:23:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:13,408 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-10-04 14:23:13,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:23:13,409 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 103 [2018-10-04 14:23:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:13,409 INFO L225 Difference]: With dead ends: 120 [2018-10-04 14:23:13,410 INFO L226 Difference]: Without dead ends: 114 [2018-10-04 14:23:13,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 21 [2018-10-04 14:23:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-04 14:23:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-10-04 14:23:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-04 14:23:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-10-04 14:23:13,425 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 103 [2018-10-04 14:23:13,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:13,425 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-10-04 14:23:13,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:23:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-10-04 14:23:13,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 14:23:13,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:13,426 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2018-10-04 14:23:13,427 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:13,427 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:13,427 INFO L82 PathProgramCache]: Analyzing trace with hash -756867393, now seen corresponding path program 39 times [2018-10-04 14:23:13,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:13,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:13,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:13,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:13,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 840 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:16,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:16,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:16,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:23:16,747 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 14:23:16,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:16,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 840 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:18,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:18,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 14:23:18,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:23:18,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:23:18,374 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:18,374 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 44 states. [2018-10-04 14:23:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:19,274 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2018-10-04 14:23:19,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:23:19,274 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 107 [2018-10-04 14:23:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:19,275 INFO L225 Difference]: With dead ends: 202 [2018-10-04 14:23:19,275 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 14:23:19,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s Time 3.0s impTime 43 [2018-10-04 14:23:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 14:23:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-10-04 14:23:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-04 14:23:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-10-04 14:23:19,290 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 107 [2018-10-04 14:23:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:19,290 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-10-04 14:23:19,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:23:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-10-04 14:23:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-04 14:23:19,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:19,292 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1, 1, 1] [2018-10-04 14:23:19,292 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:19,292 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:19,292 INFO L82 PathProgramCache]: Analyzing trace with hash 798222758, now seen corresponding path program 40 times [2018-10-04 14:23:19,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:19,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:19,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 271 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:20,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:20,063 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:20,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:23:20,115 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:23:20,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:20,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 271 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:20,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:20,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:23:20,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:23:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:23:20,317 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:20,317 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 24 states. [2018-10-04 14:23:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:20,430 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2018-10-04 14:23:20,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:23:20,430 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 108 [2018-10-04 14:23:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:20,431 INFO L225 Difference]: With dead ends: 125 [2018-10-04 14:23:20,431 INFO L226 Difference]: Without dead ends: 119 [2018-10-04 14:23:20,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 22 [2018-10-04 14:23:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-04 14:23:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-10-04 14:23:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-04 14:23:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-10-04 14:23:20,443 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 108 [2018-10-04 14:23:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:20,444 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-10-04 14:23:20,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:23:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-10-04 14:23:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-04 14:23:20,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:20,445 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2018-10-04 14:23:20,445 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:20,445 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:20,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1030199836, now seen corresponding path program 41 times [2018-10-04 14:23:20,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:20,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:20,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:20,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:20,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 924 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:21,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:21,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:21,234 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:23:21,296 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-04 14:23:21,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:21,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 924 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:21,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:21,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 14:23:21,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 14:23:21,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 14:23:21,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:21,554 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 46 states. [2018-10-04 14:23:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:22,535 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2018-10-04 14:23:22,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 14:23:22,535 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 112 [2018-10-04 14:23:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:22,536 INFO L225 Difference]: With dead ends: 211 [2018-10-04 14:23:22,536 INFO L226 Difference]: Without dead ends: 116 [2018-10-04 14:23:22,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 45 [2018-10-04 14:23:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-04 14:23:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-10-04 14:23:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-04 14:23:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-10-04 14:23:22,548 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 112 [2018-10-04 14:23:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:22,549 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-10-04 14:23:22,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 14:23:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-10-04 14:23:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-04 14:23:22,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:22,550 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1, 1, 1] [2018-10-04 14:23:22,550 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:22,550 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1949005931, now seen corresponding path program 42 times [2018-10-04 14:23:22,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:22,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:22,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 295 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:23,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:23,232 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:23,239 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:23:23,323 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-04 14:23:23,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:23,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 295 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:23,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:23,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 14:23:23,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 14:23:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 14:23:23,659 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:23,659 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 25 states. [2018-10-04 14:23:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:23,782 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-10-04 14:23:23,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 14:23:23,782 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 113 [2018-10-04 14:23:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:23,783 INFO L225 Difference]: With dead ends: 130 [2018-10-04 14:23:23,783 INFO L226 Difference]: Without dead ends: 124 [2018-10-04 14:23:23,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.3s impTime 23 [2018-10-04 14:23:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-04 14:23:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-10-04 14:23:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-04 14:23:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-10-04 14:23:23,795 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 113 [2018-10-04 14:23:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:23,796 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-10-04 14:23:23,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 14:23:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-10-04 14:23:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-04 14:23:23,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:23,797 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2018-10-04 14:23:23,797 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:23,797 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:23,797 INFO L82 PathProgramCache]: Analyzing trace with hash 725198987, now seen corresponding path program 43 times [2018-10-04 14:23:23,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:23,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:23,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:23,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:23,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 1012 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:24,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:24,356 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:24,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:24,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 1012 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:24,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:24,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 14:23:24,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 14:23:24,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 14:23:24,623 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:24,623 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 48 states. [2018-10-04 14:23:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:25,662 INFO L93 Difference]: Finished difference Result 220 states and 224 transitions. [2018-10-04 14:23:25,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:23:25,662 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 117 [2018-10-04 14:23:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:25,663 INFO L225 Difference]: With dead ends: 220 [2018-10-04 14:23:25,663 INFO L226 Difference]: Without dead ends: 121 [2018-10-04 14:23:25,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 47 [2018-10-04 14:23:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-04 14:23:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-10-04 14:23:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-04 14:23:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-10-04 14:23:25,672 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 117 [2018-10-04 14:23:25,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:25,672 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-10-04 14:23:25,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 14:23:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-10-04 14:23:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-04 14:23:25,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:25,673 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1, 1, 1] [2018-10-04 14:23:25,674 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:25,674 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash 995311282, now seen corresponding path program 44 times [2018-10-04 14:23:25,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:25,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:25,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:25,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:25,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 320 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:25,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:25,959 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:25,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:23:26,019 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:23:26,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:26,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 320 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:26,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:26,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:23:26,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:23:26,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:23:26,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:26,364 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 26 states. [2018-10-04 14:23:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:26,488 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-10-04 14:23:26,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:23:26,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-10-04 14:23:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:26,489 INFO L225 Difference]: With dead ends: 135 [2018-10-04 14:23:26,489 INFO L226 Difference]: Without dead ends: 129 [2018-10-04 14:23:26,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 24 [2018-10-04 14:23:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-04 14:23:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-10-04 14:23:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-04 14:23:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-10-04 14:23:26,503 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 118 [2018-10-04 14:23:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:26,503 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-10-04 14:23:26,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:23:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-10-04 14:23:26,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-04 14:23:26,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:26,504 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2018-10-04 14:23:26,504 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:26,505 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:26,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1935656, now seen corresponding path program 45 times [2018-10-04 14:23:26,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:26,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:26,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:26,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:26,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 1104 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:27,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:27,311 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:27,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:23:27,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-04 14:23:27,394 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:27,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 1104 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:27,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:27,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 14:23:27,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 14:23:27,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 14:23:27,602 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:27,603 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 50 states. [2018-10-04 14:23:28,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:28,817 INFO L93 Difference]: Finished difference Result 229 states and 233 transitions. [2018-10-04 14:23:28,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 14:23:28,817 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 122 [2018-10-04 14:23:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:28,818 INFO L225 Difference]: With dead ends: 229 [2018-10-04 14:23:28,818 INFO L226 Difference]: Without dead ends: 126 [2018-10-04 14:23:28,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 49 [2018-10-04 14:23:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-04 14:23:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-10-04 14:23:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-04 14:23:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-10-04 14:23:28,831 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 122 [2018-10-04 14:23:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:28,831 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-10-04 14:23:28,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 14:23:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-10-04 14:23:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-04 14:23:28,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:28,832 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1, 1, 1] [2018-10-04 14:23:28,832 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:28,832 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:28,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1360966497, now seen corresponding path program 46 times [2018-10-04 14:23:28,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:28,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:28,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 346 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:29,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:29,105 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:29,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:23:29,171 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:23:29,171 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:29,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 346 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:29,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:29,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 14:23:29,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:23:29,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:23:29,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:29,415 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 27 states. [2018-10-04 14:23:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:29,543 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-10-04 14:23:29,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:23:29,543 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2018-10-04 14:23:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:29,544 INFO L225 Difference]: With dead ends: 140 [2018-10-04 14:23:29,544 INFO L226 Difference]: Without dead ends: 134 [2018-10-04 14:23:29,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 25 [2018-10-04 14:23:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-04 14:23:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2018-10-04 14:23:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-04 14:23:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-10-04 14:23:29,555 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 123 [2018-10-04 14:23:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:29,556 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-10-04 14:23:29,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:23:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-10-04 14:23:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-04 14:23:29,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:29,556 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2018-10-04 14:23:29,556 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:29,557 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:29,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1531900329, now seen corresponding path program 47 times [2018-10-04 14:23:29,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:29,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:29,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:29,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:29,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 1200 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:31,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:31,008 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:31,015 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:23:31,097 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 14:23:31,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:31,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 1200 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:31,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:31,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 14:23:31,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:23:31,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:23:31,338 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:31,338 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 52 states. [2018-10-04 14:23:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:32,512 INFO L93 Difference]: Finished difference Result 238 states and 242 transitions. [2018-10-04 14:23:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:23:32,513 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 127 [2018-10-04 14:23:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:32,514 INFO L225 Difference]: With dead ends: 238 [2018-10-04 14:23:32,514 INFO L226 Difference]: Without dead ends: 131 [2018-10-04 14:23:32,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime 51 [2018-10-04 14:23:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-04 14:23:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-10-04 14:23:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-04 14:23:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-10-04 14:23:32,526 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 127 [2018-10-04 14:23:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:32,526 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-10-04 14:23:32,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:23:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-10-04 14:23:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-04 14:23:32,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:32,527 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1, 1, 1] [2018-10-04 14:23:32,527 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:32,528 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:32,528 INFO L82 PathProgramCache]: Analyzing trace with hash -652320834, now seen corresponding path program 48 times [2018-10-04 14:23:32,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:32,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:32,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:32,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:32,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 373 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:33,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:33,052 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:33,058 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:23:33,137 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 14:23:33,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:33,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 373 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:33,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:33,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 14:23:33,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 14:23:33,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 14:23:33,397 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:33,397 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 28 states. [2018-10-04 14:23:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:33,582 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-10-04 14:23:33,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 14:23:33,582 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 128 [2018-10-04 14:23:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:33,583 INFO L225 Difference]: With dead ends: 145 [2018-10-04 14:23:33,583 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 14:23:33,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 26 [2018-10-04 14:23:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 14:23:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-10-04 14:23:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-04 14:23:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-10-04 14:23:33,594 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 128 [2018-10-04 14:23:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:33,594 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-10-04 14:23:33,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 14:23:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-10-04 14:23:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-04 14:23:33,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:33,595 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2018-10-04 14:23:33,595 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:33,595 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:33,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1843837900, now seen corresponding path program 49 times [2018-10-04 14:23:33,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:33,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:33,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:33,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:33,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 1300 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:34,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:34,585 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:34,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:34,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 1300 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:35,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:35,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 14:23:35,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 14:23:35,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 14:23:35,866 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:35,866 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 54 states. [2018-10-04 14:23:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:36,374 INFO L93 Difference]: Finished difference Result 247 states and 251 transitions. [2018-10-04 14:23:36,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 14:23:36,374 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 132 [2018-10-04 14:23:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:36,375 INFO L225 Difference]: With dead ends: 247 [2018-10-04 14:23:36,375 INFO L226 Difference]: Without dead ends: 136 [2018-10-04 14:23:36,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 0.8s impTime 53 [2018-10-04 14:23:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-04 14:23:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-10-04 14:23:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-04 14:23:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-10-04 14:23:36,386 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2018-10-04 14:23:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:36,386 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-10-04 14:23:36,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 14:23:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-10-04 14:23:36,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-04 14:23:36,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:36,387 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1, 1, 1] [2018-10-04 14:23:36,387 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:36,387 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:36,387 INFO L82 PathProgramCache]: Analyzing trace with hash 35240749, now seen corresponding path program 50 times [2018-10-04 14:23:36,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:36,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:36,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:36,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:36,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 401 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:36,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:36,679 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:36,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:23:36,749 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:23:36,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:36,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 401 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:37,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:37,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 14:23:37,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:23:37,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:23:37,169 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:37,170 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 29 states. [2018-10-04 14:23:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:37,317 INFO L93 Difference]: Finished difference Result 150 states and 153 transitions. [2018-10-04 14:23:37,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:23:37,318 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-10-04 14:23:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:37,319 INFO L225 Difference]: With dead ends: 150 [2018-10-04 14:23:37,319 INFO L226 Difference]: Without dead ends: 144 [2018-10-04 14:23:37,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.1s impTime 27 [2018-10-04 14:23:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-04 14:23:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-10-04 14:23:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-04 14:23:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-10-04 14:23:37,331 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 133 [2018-10-04 14:23:37,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:37,331 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-10-04 14:23:37,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:23:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-10-04 14:23:37,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-04 14:23:37,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:37,332 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2018-10-04 14:23:37,332 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:37,332 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash -838119389, now seen corresponding path program 51 times [2018-10-04 14:23:37,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:37,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:37,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:37,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 1404 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:38,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:38,379 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:38,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:23:38,476 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-04 14:23:38,476 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:38,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 1404 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:38,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:38,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 14:23:38,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 14:23:38,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 14:23:38,919 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:38,919 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 56 states. [2018-10-04 14:23:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:40,309 INFO L93 Difference]: Finished difference Result 256 states and 260 transitions. [2018-10-04 14:23:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:23:40,310 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 137 [2018-10-04 14:23:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:40,310 INFO L225 Difference]: With dead ends: 256 [2018-10-04 14:23:40,311 INFO L226 Difference]: Without dead ends: 141 [2018-10-04 14:23:40,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.2s impTime 55 [2018-10-04 14:23:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-04 14:23:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-10-04 14:23:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-04 14:23:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2018-10-04 14:23:40,322 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 137 [2018-10-04 14:23:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:40,322 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-10-04 14:23:40,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 14:23:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-10-04 14:23:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-04 14:23:40,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:40,323 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1, 1, 1] [2018-10-04 14:23:40,323 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:40,323 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:40,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1657490634, now seen corresponding path program 52 times [2018-10-04 14:23:40,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:40,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:40,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:40,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:40,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 430 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:40,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:40,611 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:40,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:23:40,682 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:23:40,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:40,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 430 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:41,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:41,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:23:41,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:23:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:23:41,104 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:41,104 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 30 states. [2018-10-04 14:23:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:41,250 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2018-10-04 14:23:41,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:23:41,251 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 138 [2018-10-04 14:23:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:41,252 INFO L225 Difference]: With dead ends: 155 [2018-10-04 14:23:41,252 INFO L226 Difference]: Without dead ends: 149 [2018-10-04 14:23:41,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.1s impTime 28 [2018-10-04 14:23:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-04 14:23:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-10-04 14:23:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-04 14:23:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-10-04 14:23:41,267 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 138 [2018-10-04 14:23:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:41,268 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-10-04 14:23:41,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:23:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-10-04 14:23:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-04 14:23:41,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:41,269 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2018-10-04 14:23:41,269 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:41,269 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:41,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1915800384, now seen corresponding path program 53 times [2018-10-04 14:23:41,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:41,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:41,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:41,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:41,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1512 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:42,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:42,169 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:42,177 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:23:42,267 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-10-04 14:23:42,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:42,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1512 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:42,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:42,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 14:23:42,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 14:23:42,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 14:23:42,604 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:42,604 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 58 states. [2018-10-04 14:23:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:44,365 INFO L93 Difference]: Finished difference Result 265 states and 269 transitions. [2018-10-04 14:23:44,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 14:23:44,365 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 142 [2018-10-04 14:23:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:44,366 INFO L225 Difference]: With dead ends: 265 [2018-10-04 14:23:44,366 INFO L226 Difference]: Without dead ends: 146 [2018-10-04 14:23:44,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 57 [2018-10-04 14:23:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-04 14:23:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-10-04 14:23:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-04 14:23:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2018-10-04 14:23:44,377 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 142 [2018-10-04 14:23:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:44,378 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2018-10-04 14:23:44,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 14:23:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2018-10-04 14:23:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-04 14:23:44,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:44,379 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1, 1, 1] [2018-10-04 14:23:44,379 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:44,379 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash 520593145, now seen corresponding path program 54 times [2018-10-04 14:23:44,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:44,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:44,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:44,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:44,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 460 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:44,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:44,684 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:44,691 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:23:44,782 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-04 14:23:44,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:44,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 460 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:45,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:45,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 14:23:45,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 14:23:45,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 14:23:45,062 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:45,063 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 31 states. [2018-10-04 14:23:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:45,217 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-04 14:23:45,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:23:45,218 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2018-10-04 14:23:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:45,219 INFO L225 Difference]: With dead ends: 160 [2018-10-04 14:23:45,219 INFO L226 Difference]: Without dead ends: 154 [2018-10-04 14:23:45,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 29 [2018-10-04 14:23:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-04 14:23:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-10-04 14:23:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-04 14:23:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-10-04 14:23:45,232 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 143 [2018-10-04 14:23:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:45,232 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-10-04 14:23:45,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 14:23:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-10-04 14:23:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-04 14:23:45,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:45,233 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2018-10-04 14:23:45,233 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:45,233 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash 915041775, now seen corresponding path program 55 times [2018-10-04 14:23:45,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:45,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:45,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:45,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:45,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1624 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:46,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:46,379 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:46,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:46,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1624 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:46,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:46,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 14:23:46,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 14:23:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 14:23:46,848 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:46,848 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 60 states. [2018-10-04 14:23:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:48,466 INFO L93 Difference]: Finished difference Result 274 states and 278 transitions. [2018-10-04 14:23:48,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 14:23:48,467 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 147 [2018-10-04 14:23:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:48,468 INFO L225 Difference]: With dead ends: 274 [2018-10-04 14:23:48,468 INFO L226 Difference]: Without dead ends: 151 [2018-10-04 14:23:48,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.4s impTime 59 [2018-10-04 14:23:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-04 14:23:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-04 14:23:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-04 14:23:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-10-04 14:23:48,485 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 147 [2018-10-04 14:23:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:48,485 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-10-04 14:23:48,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 14:23:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-10-04 14:23:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-04 14:23:48,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:48,486 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1, 1, 1] [2018-10-04 14:23:48,486 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:48,486 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1773143510, now seen corresponding path program 56 times [2018-10-04 14:23:48,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:48,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:48,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:48,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 491 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:48,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:48,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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:48,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:23:48,939 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:23:48,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:48,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 491 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:49,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:49,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 14:23:49,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:23:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:23:49,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:49,354 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 32 states. [2018-10-04 14:23:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:49,545 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-10-04 14:23:49,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:23:49,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 148 [2018-10-04 14:23:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:49,547 INFO L225 Difference]: With dead ends: 165 [2018-10-04 14:23:49,547 INFO L226 Difference]: Without dead ends: 159 [2018-10-04 14:23:49,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.1s impTime 30 [2018-10-04 14:23:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-04 14:23:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-10-04 14:23:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-04 14:23:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2018-10-04 14:23:49,559 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 148 [2018-10-04 14:23:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:49,559 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2018-10-04 14:23:49,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:23:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2018-10-04 14:23:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-04 14:23:49,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:49,560 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2018-10-04 14:23:49,560 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:49,560 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1766187444, now seen corresponding path program 57 times [2018-10-04 14:23:49,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:49,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:49,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 1740 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:50,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:50,589 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:50,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:23:50,698 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-10-04 14:23:50,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:50,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 1740 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:50,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:50,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-04 14:23:50,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 14:23:50,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 14:23:50,990 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:50,990 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 62 states. [2018-10-04 14:23:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:52,707 INFO L93 Difference]: Finished difference Result 283 states and 287 transitions. [2018-10-04 14:23:52,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 14:23:52,707 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2018-10-04 14:23:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:52,708 INFO L225 Difference]: With dead ends: 283 [2018-10-04 14:23:52,708 INFO L226 Difference]: Without dead ends: 156 [2018-10-04 14:23:52,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime 61 [2018-10-04 14:23:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-04 14:23:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-10-04 14:23:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-04 14:23:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-10-04 14:23:52,721 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 152 [2018-10-04 14:23:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:52,721 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-10-04 14:23:52,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 14:23:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-10-04 14:23:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-04 14:23:52,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:52,722 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1, 1, 1] [2018-10-04 14:23:52,722 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:52,722 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash -928358715, now seen corresponding path program 58 times [2018-10-04 14:23:52,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:52,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:52,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:52,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:52,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 523 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:53,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:53,014 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:53,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:23:53,094 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:23:53,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:53,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 523 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:53,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:53,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 14:23:53,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:23:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:23:53,416 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:53,416 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 33 states. [2018-10-04 14:23:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:53,651 INFO L93 Difference]: Finished difference Result 170 states and 173 transitions. [2018-10-04 14:23:53,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:23:53,651 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 153 [2018-10-04 14:23:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:53,652 INFO L225 Difference]: With dead ends: 170 [2018-10-04 14:23:53,652 INFO L226 Difference]: Without dead ends: 164 [2018-10-04 14:23:53,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 31 [2018-10-04 14:23:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-04 14:23:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2018-10-04 14:23:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-04 14:23:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-10-04 14:23:53,676 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 153 [2018-10-04 14:23:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:53,676 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-10-04 14:23:53,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:23:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-10-04 14:23:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-04 14:23:53,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:53,677 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2018-10-04 14:23:53,677 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:53,677 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:53,677 INFO L82 PathProgramCache]: Analyzing trace with hash -839882821, now seen corresponding path program 59 times [2018-10-04 14:23:53,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:53,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:53,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 1860 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:54,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:54,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:54,790 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:23:54,883 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-04 14:23:54,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:54,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 1860 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:55,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:55,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-04 14:23:55,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 14:23:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 14:23:55,160 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:55,160 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 64 states. [2018-10-04 14:23:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:56,372 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2018-10-04 14:23:56,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 14:23:56,372 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 157 [2018-10-04 14:23:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:56,373 INFO L225 Difference]: With dead ends: 292 [2018-10-04 14:23:56,373 INFO L226 Difference]: Without dead ends: 161 [2018-10-04 14:23:56,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.2s impTime 63 [2018-10-04 14:23:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-04 14:23:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-10-04 14:23:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 14:23:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-10-04 14:23:56,389 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 157 [2018-10-04 14:23:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:56,389 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-10-04 14:23:56,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 14:23:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-10-04 14:23:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-04 14:23:56,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:56,390 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1, 1, 1] [2018-10-04 14:23:56,391 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:56,391 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:56,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1453492962, now seen corresponding path program 60 times [2018-10-04 14:23:56,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:56,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:56,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:56,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:56,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 556 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:56,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:56,877 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:56,894 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:23:57,028 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 14:23:57,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:23:57,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 556 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:57,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:57,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 14:23:57,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 14:23:57,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 14:23:57,300 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:57,300 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 34 states. [2018-10-04 14:23:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:23:57,476 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2018-10-04 14:23:57,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 14:23:57,476 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 158 [2018-10-04 14:23:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:23:57,477 INFO L225 Difference]: With dead ends: 175 [2018-10-04 14:23:57,477 INFO L226 Difference]: Without dead ends: 169 [2018-10-04 14:23:57,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 32 [2018-10-04 14:23:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-04 14:23:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-10-04 14:23:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-04 14:23:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 167 transitions. [2018-10-04 14:23:57,497 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 167 transitions. Word has length 158 [2018-10-04 14:23:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:23:57,497 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 167 transitions. [2018-10-04 14:23:57,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 14:23:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2018-10-04 14:23:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-04 14:23:57,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:23:57,499 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2018-10-04 14:23:57,499 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:23:57,499 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:23:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash 227229016, now seen corresponding path program 61 times [2018-10-04 14:23:57,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:23:57,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:23:57,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:57,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:23:57,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:23:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 1984 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:58,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:23:58,584 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:23:58,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:23:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:23:58,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:23:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 1984 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:23:58,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:23:58,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-04 14:23:58,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 14:23:58,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 14:23:58,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:23:58,949 INFO L87 Difference]: Start difference. First operand 165 states and 167 transitions. Second operand 66 states. [2018-10-04 14:24:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:00,874 INFO L93 Difference]: Finished difference Result 301 states and 305 transitions. [2018-10-04 14:24:00,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 14:24:00,874 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 162 [2018-10-04 14:24:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:00,875 INFO L225 Difference]: With dead ends: 301 [2018-10-04 14:24:00,875 INFO L226 Difference]: Without dead ends: 166 [2018-10-04 14:24:00,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.5s impTime 65 [2018-10-04 14:24:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-04 14:24:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-04 14:24:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-04 14:24:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2018-10-04 14:24:00,894 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 162 [2018-10-04 14:24:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:00,894 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2018-10-04 14:24:00,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 14:24:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2018-10-04 14:24:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-04 14:24:00,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:00,895 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1, 1, 1] [2018-10-04 14:24:00,895 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:00,896 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash 541325969, now seen corresponding path program 62 times [2018-10-04 14:24:00,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:00,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:00,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:00,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:00,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 590 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:01,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:01,314 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:01,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:01,395 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:01,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:01,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 590 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:01,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:01,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 14:24:01,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 14:24:01,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 14:24:01,681 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:01,681 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 35 states. [2018-10-04 14:24:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:01,911 INFO L93 Difference]: Finished difference Result 180 states and 183 transitions. [2018-10-04 14:24:01,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:24:01,912 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2018-10-04 14:24:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:01,912 INFO L225 Difference]: With dead ends: 180 [2018-10-04 14:24:01,913 INFO L226 Difference]: Without dead ends: 174 [2018-10-04 14:24:01,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 33 [2018-10-04 14:24:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-04 14:24:01,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2018-10-04 14:24:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-04 14:24:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2018-10-04 14:24:01,930 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 163 [2018-10-04 14:24:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:01,930 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2018-10-04 14:24:01,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 14:24:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2018-10-04 14:24:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-04 14:24:01,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:01,931 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2018-10-04 14:24:01,931 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:01,931 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:01,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1149189511, now seen corresponding path program 63 times [2018-10-04 14:24:01,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:01,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:01,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 2112 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:02,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:02,826 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:02,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:02,948 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-10-04 14:24:02,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:02,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 2112 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:03,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:03,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-04 14:24:03,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 14:24:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 14:24:03,333 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:03,333 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 68 states. [2018-10-04 14:24:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:04,051 INFO L93 Difference]: Finished difference Result 310 states and 314 transitions. [2018-10-04 14:24:04,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 14:24:04,051 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 167 [2018-10-04 14:24:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:04,052 INFO L225 Difference]: With dead ends: 310 [2018-10-04 14:24:04,052 INFO L226 Difference]: Without dead ends: 171 [2018-10-04 14:24:04,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 1.0s impTime 67 [2018-10-04 14:24:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-04 14:24:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-10-04 14:24:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-04 14:24:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2018-10-04 14:24:04,067 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2018-10-04 14:24:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:04,067 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2018-10-04 14:24:04,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 14:24:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2018-10-04 14:24:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-04 14:24:04,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:04,068 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1, 1, 1] [2018-10-04 14:24:04,068 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:04,068 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:04,068 INFO L82 PathProgramCache]: Analyzing trace with hash 167304174, now seen corresponding path program 64 times [2018-10-04 14:24:04,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:04,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:04,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 625 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:04,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:04,773 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:04,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:04,858 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:04,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:04,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 625 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:05,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:05,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 14:24:05,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:24:05,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:24:05,205 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:05,205 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 36 states. [2018-10-04 14:24:05,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:05,404 INFO L93 Difference]: Finished difference Result 185 states and 188 transitions. [2018-10-04 14:24:05,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:24:05,405 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 168 [2018-10-04 14:24:05,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:05,406 INFO L225 Difference]: With dead ends: 185 [2018-10-04 14:24:05,407 INFO L226 Difference]: Without dead ends: 179 [2018-10-04 14:24:05,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.4s impTime 34 [2018-10-04 14:24:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-04 14:24:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-10-04 14:24:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-04 14:24:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2018-10-04 14:24:05,427 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 168 [2018-10-04 14:24:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:05,428 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2018-10-04 14:24:05,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:24:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2018-10-04 14:24:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-04 14:24:05,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:05,429 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2018-10-04 14:24:05,429 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:05,429 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1678104476, now seen corresponding path program 65 times [2018-10-04 14:24:05,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:05,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:05,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2805 backedges. 2244 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:06,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:06,538 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:06,545 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:06,658 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-10-04 14:24:06,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:06,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2805 backedges. 2244 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:07,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:07,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-04 14:24:07,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 14:24:07,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 14:24:07,194 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:07,194 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 70 states. [2018-10-04 14:24:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:09,551 INFO L93 Difference]: Finished difference Result 319 states and 323 transitions. [2018-10-04 14:24:09,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 14:24:09,551 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 172 [2018-10-04 14:24:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:09,552 INFO L225 Difference]: With dead ends: 319 [2018-10-04 14:24:09,552 INFO L226 Difference]: Without dead ends: 176 [2018-10-04 14:24:09,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 1.6s impTime 69 [2018-10-04 14:24:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-04 14:24:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-10-04 14:24:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-04 14:24:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-10-04 14:24:09,570 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 172 [2018-10-04 14:24:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:09,570 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-10-04 14:24:09,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 14:24:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-10-04 14:24:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-04 14:24:09,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:09,571 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1, 1, 1] [2018-10-04 14:24:09,571 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:09,571 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:09,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1483312547, now seen corresponding path program 66 times [2018-10-04 14:24:09,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:09,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:09,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:09,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:09,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 661 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:10,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:10,009 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:10,016 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:10,135 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-10-04 14:24:10,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:10,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 661 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:10,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:10,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 14:24:10,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 14:24:10,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 14:24:10,459 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:10,459 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 37 states. [2018-10-04 14:24:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:10,651 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2018-10-04 14:24:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:24:10,651 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 173 [2018-10-04 14:24:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:10,652 INFO L225 Difference]: With dead ends: 190 [2018-10-04 14:24:10,652 INFO L226 Difference]: Without dead ends: 184 [2018-10-04 14:24:10,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 35 [2018-10-04 14:24:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-04 14:24:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-10-04 14:24:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-04 14:24:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-10-04 14:24:10,671 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 173 [2018-10-04 14:24:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:10,671 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-10-04 14:24:10,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 14:24:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-10-04 14:24:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-04 14:24:10,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:10,672 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2018-10-04 14:24:10,673 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:10,673 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:10,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1794699091, now seen corresponding path program 67 times [2018-10-04 14:24:10,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:10,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:10,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:10,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:10,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 2380 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:11,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:11,986 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:11,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:12,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 2380 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:12,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:12,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-04 14:24:12,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 14:24:12,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 14:24:12,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:12,362 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 72 states. [2018-10-04 14:24:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:15,006 INFO L93 Difference]: Finished difference Result 328 states and 332 transitions. [2018-10-04 14:24:15,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 14:24:15,006 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 177 [2018-10-04 14:24:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:15,007 INFO L225 Difference]: With dead ends: 328 [2018-10-04 14:24:15,007 INFO L226 Difference]: Without dead ends: 181 [2018-10-04 14:24:15,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 2.0s impTime 71 [2018-10-04 14:24:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-04 14:24:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-10-04 14:24:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-04 14:24:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 183 transitions. [2018-10-04 14:24:15,024 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 183 transitions. Word has length 177 [2018-10-04 14:24:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:15,024 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 183 transitions. [2018-10-04 14:24:15,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 14:24:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 183 transitions. [2018-10-04 14:24:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-04 14:24:15,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:15,025 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1, 1, 1] [2018-10-04 14:24:15,025 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:15,025 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:15,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2072574202, now seen corresponding path program 68 times [2018-10-04 14:24:15,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:15,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:15,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:15,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:15,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 698 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:15,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:15,502 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:15,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:15,589 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:15,589 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:15,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 698 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:15,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:15,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 14:24:15,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 14:24:15,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 14:24:15,900 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:15,900 INFO L87 Difference]: Start difference. First operand 181 states and 183 transitions. Second operand 38 states. [2018-10-04 14:24:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:16,107 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2018-10-04 14:24:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:24:16,108 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 178 [2018-10-04 14:24:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:16,109 INFO L225 Difference]: With dead ends: 195 [2018-10-04 14:24:16,109 INFO L226 Difference]: Without dead ends: 189 [2018-10-04 14:24:16,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 36 [2018-10-04 14:24:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-04 14:24:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2018-10-04 14:24:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-04 14:24:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2018-10-04 14:24:16,131 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 178 [2018-10-04 14:24:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:16,132 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2018-10-04 14:24:16,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 14:24:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2018-10-04 14:24:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-04 14:24:16,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:16,133 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2018-10-04 14:24:16,133 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:16,134 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:16,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1591533424, now seen corresponding path program 69 times [2018-10-04 14:24:16,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:16,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:16,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:16,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:16,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 2520 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:17,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:17,714 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:17,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:17,857 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-04 14:24:17,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:17,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 2520 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:18,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:18,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-04 14:24:18,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 14:24:18,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 14:24:18,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:18,187 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 74 states. [2018-10-04 14:24:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:21,041 INFO L93 Difference]: Finished difference Result 337 states and 341 transitions. [2018-10-04 14:24:21,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 14:24:21,041 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 182 [2018-10-04 14:24:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:21,042 INFO L225 Difference]: With dead ends: 337 [2018-10-04 14:24:21,042 INFO L226 Difference]: Without dead ends: 186 [2018-10-04 14:24:21,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.3s impTime 73 [2018-10-04 14:24:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-04 14:24:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-10-04 14:24:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-04 14:24:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2018-10-04 14:24:21,058 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 182 [2018-10-04 14:24:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:21,058 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2018-10-04 14:24:21,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 14:24:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2018-10-04 14:24:21,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-04 14:24:21,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:21,059 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1, 1, 1] [2018-10-04 14:24:21,059 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:21,059 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1595685335, now seen corresponding path program 70 times [2018-10-04 14:24:21,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:21,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:21,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:21,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:21,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 736 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:21,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:21,479 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:21,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:21,573 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:21,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:21,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 736 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:21,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:21,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 14:24:21,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 14:24:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 14:24:21,924 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:21,924 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 39 states. [2018-10-04 14:24:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:22,155 INFO L93 Difference]: Finished difference Result 200 states and 203 transitions. [2018-10-04 14:24:22,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:24:22,155 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 183 [2018-10-04 14:24:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:22,156 INFO L225 Difference]: With dead ends: 200 [2018-10-04 14:24:22,156 INFO L226 Difference]: Without dead ends: 194 [2018-10-04 14:24:22,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.1s impTime 37 [2018-10-04 14:24:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-04 14:24:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2018-10-04 14:24:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-04 14:24:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 192 transitions. [2018-10-04 14:24:22,173 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 192 transitions. Word has length 183 [2018-10-04 14:24:22,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:22,173 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 192 transitions. [2018-10-04 14:24:22,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 14:24:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 192 transitions. [2018-10-04 14:24:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-04 14:24:22,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:22,174 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2018-10-04 14:24:22,174 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:22,174 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1835041505, now seen corresponding path program 71 times [2018-10-04 14:24:22,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:22,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:22,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:22,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3330 backedges. 2664 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:23,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:23,122 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:23,129 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:23,256 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-04 14:24:23,256 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:23,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3330 backedges. 2664 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:23,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:23,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-04 14:24:23,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 14:24:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 14:24:23,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:23,573 INFO L87 Difference]: Start difference. First operand 190 states and 192 transitions. Second operand 76 states. [2018-10-04 14:24:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:25,477 INFO L93 Difference]: Finished difference Result 346 states and 350 transitions. [2018-10-04 14:24:25,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 14:24:25,478 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 187 [2018-10-04 14:24:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:25,478 INFO L225 Difference]: With dead ends: 346 [2018-10-04 14:24:25,479 INFO L226 Difference]: Without dead ends: 191 [2018-10-04 14:24:25,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.3s impTime 75 [2018-10-04 14:24:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-04 14:24:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-04 14:24:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-04 14:24:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 193 transitions. [2018-10-04 14:24:25,502 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 193 transitions. Word has length 187 [2018-10-04 14:24:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:25,502 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 193 transitions. [2018-10-04 14:24:25,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 14:24:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 193 transitions. [2018-10-04 14:24:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-04 14:24:25,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:25,503 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1, 1, 1] [2018-10-04 14:24:25,503 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:25,503 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:25,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1521017350, now seen corresponding path program 72 times [2018-10-04 14:24:25,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:25,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 775 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:25,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:25,868 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:25,875 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:25,999 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 14:24:26,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:26,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 775 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:26,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:26,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 14:24:26,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 14:24:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 14:24:26,336 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:26,336 INFO L87 Difference]: Start difference. First operand 191 states and 193 transitions. Second operand 40 states. [2018-10-04 14:24:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:26,581 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2018-10-04 14:24:26,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:24:26,581 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 188 [2018-10-04 14:24:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:26,582 INFO L225 Difference]: With dead ends: 205 [2018-10-04 14:24:26,583 INFO L226 Difference]: Without dead ends: 199 [2018-10-04 14:24:26,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 38 [2018-10-04 14:24:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-04 14:24:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-10-04 14:24:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-04 14:24:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2018-10-04 14:24:26,607 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 188 [2018-10-04 14:24:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:26,608 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2018-10-04 14:24:26,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 14:24:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-10-04 14:24:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-04 14:24:26,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:26,609 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2018-10-04 14:24:26,609 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:26,609 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:26,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1787388540, now seen corresponding path program 73 times [2018-10-04 14:24:26,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:26,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:26,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:26,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:26,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3515 backedges. 2812 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:27,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:27,641 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:27,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:27,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3515 backedges. 2812 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:28,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:28,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-04 14:24:28,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 14:24:28,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 14:24:28,054 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:28,054 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand 78 states. [2018-10-04 14:24:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:29,840 INFO L93 Difference]: Finished difference Result 355 states and 359 transitions. [2018-10-04 14:24:29,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-04 14:24:29,840 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 192 [2018-10-04 14:24:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:29,841 INFO L225 Difference]: With dead ends: 355 [2018-10-04 14:24:29,841 INFO L226 Difference]: Without dead ends: 196 [2018-10-04 14:24:29,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.4s impTime 77 [2018-10-04 14:24:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-04 14:24:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-04 14:24:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-04 14:24:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-10-04 14:24:29,861 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 192 [2018-10-04 14:24:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:29,861 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-10-04 14:24:29,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 14:24:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-10-04 14:24:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-04 14:24:29,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:29,862 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1, 1, 1] [2018-10-04 14:24:29,862 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:29,863 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1861088757, now seen corresponding path program 74 times [2018-10-04 14:24:29,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:29,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:29,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:29,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:29,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 815 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:30,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:30,350 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:30,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:30,444 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:30,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:30,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 815 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:30,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:30,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 14:24:30,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:24:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:24:30,775 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:30,775 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 41 states. [2018-10-04 14:24:31,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:31,002 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2018-10-04 14:24:31,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:24:31,002 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 193 [2018-10-04 14:24:31,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:31,003 INFO L225 Difference]: With dead ends: 210 [2018-10-04 14:24:31,003 INFO L226 Difference]: Without dead ends: 204 [2018-10-04 14:24:31,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 39 [2018-10-04 14:24:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-04 14:24:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2018-10-04 14:24:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-04 14:24:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2018-10-04 14:24:31,021 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 193 [2018-10-04 14:24:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:31,021 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2018-10-04 14:24:31,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:24:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2018-10-04 14:24:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-04 14:24:31,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:31,022 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2018-10-04 14:24:31,023 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:31,023 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:31,023 INFO L82 PathProgramCache]: Analyzing trace with hash -315300117, now seen corresponding path program 75 times [2018-10-04 14:24:31,023 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:31,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:31,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:31,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:31,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3705 backedges. 2964 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:31,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:31,924 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:31,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:32,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-10-04 14:24:32,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:32,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3705 backedges. 2964 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:32,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:32,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-04 14:24:32,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 14:24:32,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 14:24:32,437 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:32,437 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 80 states. [2018-10-04 14:24:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:34,282 INFO L93 Difference]: Finished difference Result 364 states and 368 transitions. [2018-10-04 14:24:34,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-04 14:24:34,283 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 197 [2018-10-04 14:24:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:34,284 INFO L225 Difference]: With dead ends: 364 [2018-10-04 14:24:34,284 INFO L226 Difference]: Without dead ends: 201 [2018-10-04 14:24:34,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.2s impTime 79 [2018-10-04 14:24:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-04 14:24:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-10-04 14:24:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-04 14:24:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2018-10-04 14:24:34,309 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 197 [2018-10-04 14:24:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:34,309 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2018-10-04 14:24:34,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 14:24:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2018-10-04 14:24:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-04 14:24:34,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:34,310 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1, 1, 1] [2018-10-04 14:24:34,310 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:34,311 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:34,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1372678382, now seen corresponding path program 76 times [2018-10-04 14:24:34,311 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:34,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:34,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:34,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:34,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 856 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:34,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:34,641 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:34,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:34,742 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:34,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:34,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 856 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:35,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:35,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 14:24:35,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 14:24:35,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 14:24:35,358 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:35,358 INFO L87 Difference]: Start difference. First operand 201 states and 203 transitions. Second operand 42 states. [2018-10-04 14:24:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:35,635 INFO L93 Difference]: Finished difference Result 215 states and 218 transitions. [2018-10-04 14:24:35,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:24:35,637 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 198 [2018-10-04 14:24:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:35,638 INFO L225 Difference]: With dead ends: 215 [2018-10-04 14:24:35,638 INFO L226 Difference]: Without dead ends: 209 [2018-10-04 14:24:35,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.1s impTime 40 [2018-10-04 14:24:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-04 14:24:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2018-10-04 14:24:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-04 14:24:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 207 transitions. [2018-10-04 14:24:35,664 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 207 transitions. Word has length 198 [2018-10-04 14:24:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:35,664 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 207 transitions. [2018-10-04 14:24:35,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 14:24:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 207 transitions. [2018-10-04 14:24:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-04 14:24:35,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:35,665 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1] [2018-10-04 14:24:35,665 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:35,666 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1792389512, now seen corresponding path program 77 times [2018-10-04 14:24:35,666 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:35,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:35,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3900 backedges. 3120 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:36,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:36,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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:36,668 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:36,795 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-10-04 14:24:36,795 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:36,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3900 backedges. 3120 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:37,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:37,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-04 14:24:37,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 14:24:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 14:24:37,158 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:37,158 INFO L87 Difference]: Start difference. First operand 205 states and 207 transitions. Second operand 82 states. [2018-10-04 14:24:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:39,174 INFO L93 Difference]: Finished difference Result 373 states and 377 transitions. [2018-10-04 14:24:39,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 14:24:39,174 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 202 [2018-10-04 14:24:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:39,175 INFO L225 Difference]: With dead ends: 373 [2018-10-04 14:24:39,175 INFO L226 Difference]: Without dead ends: 206 [2018-10-04 14:24:39,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.3s impTime 81 [2018-10-04 14:24:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-04 14:24:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-10-04 14:24:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-04 14:24:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-10-04 14:24:39,199 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2018-10-04 14:24:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:39,199 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-10-04 14:24:39,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 14:24:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-10-04 14:24:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-04 14:24:39,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:39,201 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1, 1, 1] [2018-10-04 14:24:39,201 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:39,201 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash -185138751, now seen corresponding path program 78 times [2018-10-04 14:24:39,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:39,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:39,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 898 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:39,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:39,555 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:39,563 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:39,702 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2018-10-04 14:24:39,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:39,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 898 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:40,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:40,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 14:24:40,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 14:24:40,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 14:24:40,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:40,117 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 43 states. [2018-10-04 14:24:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:40,468 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2018-10-04 14:24:40,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:24:40,469 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 203 [2018-10-04 14:24:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:40,470 INFO L225 Difference]: With dead ends: 220 [2018-10-04 14:24:40,470 INFO L226 Difference]: Without dead ends: 214 [2018-10-04 14:24:40,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 41 [2018-10-04 14:24:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-04 14:24:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2018-10-04 14:24:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-04 14:24:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2018-10-04 14:24:40,497 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 203 [2018-10-04 14:24:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:40,497 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2018-10-04 14:24:40,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 14:24:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2018-10-04 14:24:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-04 14:24:40,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:40,499 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1] [2018-10-04 14:24:40,499 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:40,499 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash -319083337, now seen corresponding path program 79 times [2018-10-04 14:24:40,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:40,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:40,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4100 backedges. 3280 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:41,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:41,573 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:41,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:41,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4100 backedges. 3280 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:42,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:42,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-04 14:24:42,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 14:24:42,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 14:24:42,089 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:42,089 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 84 states. [2018-10-04 14:24:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:44,014 INFO L93 Difference]: Finished difference Result 382 states and 386 transitions. [2018-10-04 14:24:44,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-04 14:24:44,014 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 207 [2018-10-04 14:24:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:44,015 INFO L225 Difference]: With dead ends: 382 [2018-10-04 14:24:44,015 INFO L226 Difference]: Without dead ends: 211 [2018-10-04 14:24:44,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.4s impTime 83 [2018-10-04 14:24:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-04 14:24:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-04 14:24:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-04 14:24:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 213 transitions. [2018-10-04 14:24:44,034 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 213 transitions. Word has length 207 [2018-10-04 14:24:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:44,034 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 213 transitions. [2018-10-04 14:24:44,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 14:24:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 213 transitions. [2018-10-04 14:24:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-04 14:24:44,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:44,035 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1, 1, 1] [2018-10-04 14:24:44,035 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:44,035 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:44,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1953503262, now seen corresponding path program 80 times [2018-10-04 14:24:44,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:44,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 941 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:44,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:44,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:24:44,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:44,680 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:44,680 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:44,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 941 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:45,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:45,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 14:24:45,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:24:45,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:24:45,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:45,030 INFO L87 Difference]: Start difference. First operand 211 states and 213 transitions. Second operand 44 states. [2018-10-04 14:24:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:45,358 INFO L93 Difference]: Finished difference Result 225 states and 228 transitions. [2018-10-04 14:24:45,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:24:45,359 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 208 [2018-10-04 14:24:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:45,360 INFO L225 Difference]: With dead ends: 225 [2018-10-04 14:24:45,360 INFO L226 Difference]: Without dead ends: 219 [2018-10-04 14:24:45,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 42 [2018-10-04 14:24:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-04 14:24:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-10-04 14:24:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-04 14:24:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 217 transitions. [2018-10-04 14:24:45,380 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 217 transitions. Word has length 208 [2018-10-04 14:24:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:45,380 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 217 transitions. [2018-10-04 14:24:45,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:24:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 217 transitions. [2018-10-04 14:24:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-04 14:24:45,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:45,381 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1] [2018-10-04 14:24:45,381 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:45,381 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1125633172, now seen corresponding path program 81 times [2018-10-04 14:24:45,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:45,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:45,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4305 backedges. 3444 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:46,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:46,286 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-04 14:24:46,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:46,456 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-10-04 14:24:46,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:46,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4305 backedges. 3444 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:46,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:46,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-04 14:24:46,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 14:24:46,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 14:24:46,809 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:46,809 INFO L87 Difference]: Start difference. First operand 215 states and 217 transitions. Second operand 86 states. [2018-10-04 14:24:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:48,154 INFO L93 Difference]: Finished difference Result 391 states and 395 transitions. [2018-10-04 14:24:48,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-04 14:24:48,155 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 212 [2018-10-04 14:24:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:48,156 INFO L225 Difference]: With dead ends: 391 [2018-10-04 14:24:48,156 INFO L226 Difference]: Without dead ends: 216 [2018-10-04 14:24:48,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.1s impTime 85 [2018-10-04 14:24:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-04 14:24:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-10-04 14:24:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-04 14:24:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2018-10-04 14:24:48,177 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 212 [2018-10-04 14:24:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:48,177 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2018-10-04 14:24:48,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 14:24:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2018-10-04 14:24:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-04 14:24:48,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:48,179 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1, 1, 1] [2018-10-04 14:24:48,179 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:48,179 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:48,179 INFO L82 PathProgramCache]: Analyzing trace with hash -155129459, now seen corresponding path program 82 times [2018-10-04 14:24:48,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:48,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:48,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:48,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:48,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 985 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:48,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:48,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 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-04 14:24:48,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:48,743 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:48,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:48,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 985 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:49,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:49,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 14:24:49,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:24:49,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:24:49,110 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:49,110 INFO L87 Difference]: Start difference. First operand 216 states and 218 transitions. Second operand 45 states. [2018-10-04 14:24:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:49,371 INFO L93 Difference]: Finished difference Result 230 states and 233 transitions. [2018-10-04 14:24:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:24:49,371 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 213 [2018-10-04 14:24:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:49,372 INFO L225 Difference]: With dead ends: 230 [2018-10-04 14:24:49,372 INFO L226 Difference]: Without dead ends: 224 [2018-10-04 14:24:49,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 43 [2018-10-04 14:24:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-04 14:24:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2018-10-04 14:24:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-04 14:24:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-10-04 14:24:49,394 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 213 [2018-10-04 14:24:49,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:49,394 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-10-04 14:24:49,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:24:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-10-04 14:24:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-04 14:24:49,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:49,396 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1] [2018-10-04 14:24:49,396 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:49,396 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:49,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1531687293, now seen corresponding path program 83 times [2018-10-04 14:24:49,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:49,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:49,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:49,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:49,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4515 backedges. 3612 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:50,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:50,827 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-04 14:24:50,834 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:50,973 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-10-04 14:24:50,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:50,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4515 backedges. 3612 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:51,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:51,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-04 14:24:51,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 14:24:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 14:24:51,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:51,339 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 88 states. [2018-10-04 14:24:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:53,617 INFO L93 Difference]: Finished difference Result 400 states and 404 transitions. [2018-10-04 14:24:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-04 14:24:53,617 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 217 [2018-10-04 14:24:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:53,618 INFO L225 Difference]: With dead ends: 400 [2018-10-04 14:24:53,618 INFO L226 Difference]: Without dead ends: 221 [2018-10-04 14:24:53,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.9s impTime 87 [2018-10-04 14:24:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-04 14:24:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-10-04 14:24:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-04 14:24:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 223 transitions. [2018-10-04 14:24:53,640 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 223 transitions. Word has length 217 [2018-10-04 14:24:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:53,640 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 223 transitions. [2018-10-04 14:24:53,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 14:24:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 223 transitions. [2018-10-04 14:24:53,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-04 14:24:53,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:53,641 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1, 1, 1] [2018-10-04 14:24:53,641 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:53,641 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:53,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1128490282, now seen corresponding path program 84 times [2018-10-04 14:24:53,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:53,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:53,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:53,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:53,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 1030 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:54,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:54,049 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-04 14:24:54,076 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:54,236 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 14:24:54,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:54,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 1030 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:54,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:54,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-04 14:24:54,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 14:24:54,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 14:24:54,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:54,635 INFO L87 Difference]: Start difference. First operand 221 states and 223 transitions. Second operand 46 states. [2018-10-04 14:24:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:54,963 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2018-10-04 14:24:54,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 14:24:54,964 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 218 [2018-10-04 14:24:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:54,965 INFO L225 Difference]: With dead ends: 235 [2018-10-04 14:24:54,965 INFO L226 Difference]: Without dead ends: 229 [2018-10-04 14:24:54,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.1s impTime 44 [2018-10-04 14:24:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-04 14:24:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2018-10-04 14:24:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-04 14:24:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 227 transitions. [2018-10-04 14:24:54,986 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 227 transitions. Word has length 218 [2018-10-04 14:24:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:54,987 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 227 transitions. [2018-10-04 14:24:54,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 14:24:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 227 transitions. [2018-10-04 14:24:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-04 14:24:54,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:54,988 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1] [2018-10-04 14:24:54,988 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:54,988 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:54,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1373260896, now seen corresponding path program 85 times [2018-10-04 14:24:54,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:54,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:54,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:54,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:54,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4730 backedges. 3784 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:56,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:56,590 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-04 14:24:56,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:56,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4730 backedges. 3784 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:57,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:57,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-04 14:24:57,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 14:24:57,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 14:24:57,107 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:57,107 INFO L87 Difference]: Start difference. First operand 225 states and 227 transitions. Second operand 90 states. [2018-10-04 14:24:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:59,454 INFO L93 Difference]: Finished difference Result 409 states and 413 transitions. [2018-10-04 14:24:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-04 14:24:59,454 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 222 [2018-10-04 14:24:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:59,455 INFO L225 Difference]: With dead ends: 409 [2018-10-04 14:24:59,455 INFO L226 Difference]: Without dead ends: 226 [2018-10-04 14:24:59,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.0s impTime 89 [2018-10-04 14:24:59,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-04 14:24:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-10-04 14:24:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-04 14:24:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 228 transitions. [2018-10-04 14:24:59,476 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 228 transitions. Word has length 222 [2018-10-04 14:24:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:59,477 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 228 transitions. [2018-10-04 14:24:59,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 14:24:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 228 transitions. [2018-10-04 14:24:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-04 14:24:59,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:59,478 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1, 1, 1] [2018-10-04 14:24:59,478 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:59,478 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:59,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2022550873, now seen corresponding path program 86 times [2018-10-04 14:24:59,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:59,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:59,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:59,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 1076 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:59,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:59,890 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-04 14:24:59,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:59,999 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:59,999 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:00,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 1076 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:00,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:00,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 14:25:00,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 14:25:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 14:25:00,399 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:00,399 INFO L87 Difference]: Start difference. First operand 226 states and 228 transitions. Second operand 47 states. [2018-10-04 14:25:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:00,826 INFO L93 Difference]: Finished difference Result 240 states and 243 transitions. [2018-10-04 14:25:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:25:00,827 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 223 [2018-10-04 14:25:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:00,828 INFO L225 Difference]: With dead ends: 240 [2018-10-04 14:25:00,828 INFO L226 Difference]: Without dead ends: 234 [2018-10-04 14:25:00,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.1s impTime 45 [2018-10-04 14:25:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-04 14:25:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-10-04 14:25:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-04 14:25:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 232 transitions. [2018-10-04 14:25:00,851 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 232 transitions. Word has length 223 [2018-10-04 14:25:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:00,851 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 232 transitions. [2018-10-04 14:25:00,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 14:25:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 232 transitions. [2018-10-04 14:25:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-04 14:25:00,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:00,852 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1] [2018-10-04 14:25:00,852 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:00,852 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash 664947791, now seen corresponding path program 87 times [2018-10-04 14:25:00,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:00,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:00,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:00,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 3960 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:02,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:02,651 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-04 14:25:02,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:02,829 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-10-04 14:25:02,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:02,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 3960 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:03,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:03,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-10-04 14:25:03,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 14:25:03,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 14:25:03,227 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:03,227 INFO L87 Difference]: Start difference. First operand 230 states and 232 transitions. Second operand 92 states. [2018-10-04 14:25:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:05,760 INFO L93 Difference]: Finished difference Result 418 states and 422 transitions. [2018-10-04 14:25:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-04 14:25:05,760 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 227 [2018-10-04 14:25:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:05,761 INFO L225 Difference]: With dead ends: 418 [2018-10-04 14:25:05,761 INFO L226 Difference]: Without dead ends: 231 [2018-10-04 14:25:05,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.3s impTime 91 [2018-10-04 14:25:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-04 14:25:05,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-04 14:25:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-04 14:25:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2018-10-04 14:25:05,784 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 227 [2018-10-04 14:25:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:05,784 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2018-10-04 14:25:05,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 14:25:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2018-10-04 14:25:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-04 14:25:05,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:05,785 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1, 1, 1] [2018-10-04 14:25:05,785 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:05,785 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:05,785 INFO L82 PathProgramCache]: Analyzing trace with hash -402751946, now seen corresponding path program 88 times [2018-10-04 14:25:05,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:05,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:05,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:05,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:05,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 1123 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:06,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:06,287 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-04 14:25:06,295 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:06,404 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:06,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:06,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 1123 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:06,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:06,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 14:25:06,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 14:25:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 14:25:06,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:06,844 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 48 states. [2018-10-04 14:25:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:07,160 INFO L93 Difference]: Finished difference Result 245 states and 248 transitions. [2018-10-04 14:25:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:25:07,166 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2018-10-04 14:25:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:07,167 INFO L225 Difference]: With dead ends: 245 [2018-10-04 14:25:07,167 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 14:25:07,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 46 [2018-10-04 14:25:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 14:25:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2018-10-04 14:25:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-04 14:25:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 237 transitions. [2018-10-04 14:25:07,193 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 237 transitions. Word has length 228 [2018-10-04 14:25:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:07,193 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 237 transitions. [2018-10-04 14:25:07,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 14:25:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 237 transitions. [2018-10-04 14:25:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-04 14:25:07,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:07,194 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1] [2018-10-04 14:25:07,194 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:07,195 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash -564828500, now seen corresponding path program 89 times [2018-10-04 14:25:07,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:07,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:07,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:07,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5175 backedges. 4140 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:08,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:08,672 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-04 14:25:08,680 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:08,844 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2018-10-04 14:25:08,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:08,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5175 backedges. 4140 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:09,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:09,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2018-10-04 14:25:09,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-04 14:25:09,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-04 14:25:09,244 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:09,244 INFO L87 Difference]: Start difference. First operand 235 states and 237 transitions. Second operand 94 states. [2018-10-04 14:25:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:12,027 INFO L93 Difference]: Finished difference Result 427 states and 431 transitions. [2018-10-04 14:25:12,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-04 14:25:12,027 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 232 [2018-10-04 14:25:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:12,028 INFO L225 Difference]: With dead ends: 427 [2018-10-04 14:25:12,028 INFO L226 Difference]: Without dead ends: 236 [2018-10-04 14:25:12,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.0s impTime 93 [2018-10-04 14:25:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-04 14:25:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-10-04 14:25:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-04 14:25:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 238 transitions. [2018-10-04 14:25:12,058 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 238 transitions. Word has length 232 [2018-10-04 14:25:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:12,058 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 238 transitions. [2018-10-04 14:25:12,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-04 14:25:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 238 transitions. [2018-10-04 14:25:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-04 14:25:12,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:12,059 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1, 1, 1] [2018-10-04 14:25:12,059 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:12,059 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:12,059 INFO L82 PathProgramCache]: Analyzing trace with hash 522145061, now seen corresponding path program 90 times [2018-10-04 14:25:12,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:12,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:12,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 1171 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:12,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:12,516 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-04 14:25:12,523 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:12,691 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2018-10-04 14:25:12,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:12,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 1171 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:13,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:13,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-04 14:25:13,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 14:25:13,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 14:25:13,094 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:13,094 INFO L87 Difference]: Start difference. First operand 236 states and 238 transitions. Second operand 49 states. [2018-10-04 14:25:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:13,402 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2018-10-04 14:25:13,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 14:25:13,402 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 233 [2018-10-04 14:25:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:13,403 INFO L225 Difference]: With dead ends: 250 [2018-10-04 14:25:13,403 INFO L226 Difference]: Without dead ends: 244 [2018-10-04 14:25:13,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.2s impTime 47 [2018-10-04 14:25:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-04 14:25:13,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2018-10-04 14:25:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-04 14:25:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 242 transitions. [2018-10-04 14:25:13,427 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 242 transitions. Word has length 233 [2018-10-04 14:25:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:13,427 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 242 transitions. [2018-10-04 14:25:13,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 14:25:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 242 transitions. [2018-10-04 14:25:13,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-04 14:25:13,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:13,428 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1] [2018-10-04 14:25:13,428 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:13,428 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:13,428 INFO L82 PathProgramCache]: Analyzing trace with hash -377018853, now seen corresponding path program 91 times [2018-10-04 14:25:13,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:13,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:13,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:13,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:13,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 4324 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:14,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:14,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 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-04 14:25:14,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:14,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 4324 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:15,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:15,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-10-04 14:25:15,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-04 14:25:15,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-04 14:25:15,168 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:15,168 INFO L87 Difference]: Start difference. First operand 240 states and 242 transitions. Second operand 96 states. [2018-10-04 14:25:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:17,612 INFO L93 Difference]: Finished difference Result 436 states and 440 transitions. [2018-10-04 14:25:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-04 14:25:17,613 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 237 [2018-10-04 14:25:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:17,614 INFO L225 Difference]: With dead ends: 436 [2018-10-04 14:25:17,614 INFO L226 Difference]: Without dead ends: 241 [2018-10-04 14:25:17,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time 1.8s impTime 95 [2018-10-04 14:25:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-04 14:25:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-10-04 14:25:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-04 14:25:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2018-10-04 14:25:17,646 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 237 [2018-10-04 14:25:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:17,646 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2018-10-04 14:25:17,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-04 14:25:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2018-10-04 14:25:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-04 14:25:17,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:17,647 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1, 1, 1] [2018-10-04 14:25:17,647 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:17,648 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash 125264706, now seen corresponding path program 92 times [2018-10-04 14:25:17,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:17,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:17,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 1220 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:18,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:18,159 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-04 14:25:18,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:18,271 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:18,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:18,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 1220 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:18,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:18,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 14:25:18,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 14:25:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 14:25:18,685 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:18,685 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 50 states. [2018-10-04 14:25:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:19,032 INFO L93 Difference]: Finished difference Result 255 states and 258 transitions. [2018-10-04 14:25:19,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 14:25:19,033 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 238 [2018-10-04 14:25:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:19,034 INFO L225 Difference]: With dead ends: 255 [2018-10-04 14:25:19,034 INFO L226 Difference]: Without dead ends: 249 [2018-10-04 14:25:19,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 48 [2018-10-04 14:25:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-04 14:25:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2018-10-04 14:25:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-04 14:25:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2018-10-04 14:25:19,060 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 238 [2018-10-04 14:25:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:19,060 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2018-10-04 14:25:19,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 14:25:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2018-10-04 14:25:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-04 14:25:19,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:19,061 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1] [2018-10-04 14:25:19,062 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:19,062 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash 494724536, now seen corresponding path program 93 times [2018-10-04 14:25:19,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:19,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:19,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:19,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:19,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5640 backedges. 4512 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:20,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:20,487 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 14:25:20,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:20,690 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-10-04 14:25:20,690 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:20,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5640 backedges. 4512 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:21,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:21,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-10-04 14:25:21,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-04 14:25:21,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-04 14:25:21,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:21,297 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 98 states. [2018-10-04 14:25:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:23,802 INFO L93 Difference]: Finished difference Result 445 states and 449 transitions. [2018-10-04 14:25:23,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-04 14:25:23,802 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 242 [2018-10-04 14:25:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:23,803 INFO L225 Difference]: With dead ends: 445 [2018-10-04 14:25:23,803 INFO L226 Difference]: Without dead ends: 246 [2018-10-04 14:25:23,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 1.9s impTime 97 [2018-10-04 14:25:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-04 14:25:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-10-04 14:25:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-04 14:25:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 248 transitions. [2018-10-04 14:25:23,828 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 248 transitions. Word has length 242 [2018-10-04 14:25:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:23,828 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 248 transitions. [2018-10-04 14:25:23,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-04 14:25:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 248 transitions. [2018-10-04 14:25:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-04 14:25:23,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:23,829 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1, 1, 1] [2018-10-04 14:25:23,829 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:23,830 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1883780879, now seen corresponding path program 94 times [2018-10-04 14:25:23,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:23,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:23,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:23,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:23,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 1270 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:24,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:24,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 14:25:24,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:24,494 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:24,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:24,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 1270 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:24,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:24,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 14:25:24,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 14:25:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 14:25:24,923 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:24,924 INFO L87 Difference]: Start difference. First operand 246 states and 248 transitions. Second operand 51 states. [2018-10-04 14:25:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:25,218 INFO L93 Difference]: Finished difference Result 260 states and 263 transitions. [2018-10-04 14:25:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 14:25:25,219 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 243 [2018-10-04 14:25:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:25,220 INFO L225 Difference]: With dead ends: 260 [2018-10-04 14:25:25,220 INFO L226 Difference]: Without dead ends: 254 [2018-10-04 14:25:25,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 49 [2018-10-04 14:25:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-04 14:25:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-10-04 14:25:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-04 14:25:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 252 transitions. [2018-10-04 14:25:25,245 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 252 transitions. Word has length 243 [2018-10-04 14:25:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:25,245 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 252 transitions. [2018-10-04 14:25:25,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 14:25:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 252 transitions. [2018-10-04 14:25:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-04 14:25:25,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:25,246 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1] [2018-10-04 14:25:25,247 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:25,247 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash 514120679, now seen corresponding path program 95 times [2018-10-04 14:25:25,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:25,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:25,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:25,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:25,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5880 backedges. 4704 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:26,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:26,564 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-04 14:25:26,572 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:26,743 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-04 14:25:26,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:26,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5880 backedges. 4704 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:27,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:27,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-10-04 14:25:27,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-04 14:25:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-04 14:25:27,225 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:27,225 INFO L87 Difference]: Start difference. First operand 250 states and 252 transitions. Second operand 100 states. [2018-10-04 14:25:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:28,879 INFO L93 Difference]: Finished difference Result 454 states and 458 transitions. [2018-10-04 14:25:28,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-04 14:25:28,879 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 247 [2018-10-04 14:25:28,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:28,880 INFO L225 Difference]: With dead ends: 454 [2018-10-04 14:25:28,880 INFO L226 Difference]: Without dead ends: 251 [2018-10-04 14:25:28,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time 1.5s impTime 99 [2018-10-04 14:25:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-04 14:25:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-10-04 14:25:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-04 14:25:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 253 transitions. [2018-10-04 14:25:28,909 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 253 transitions. Word has length 247 [2018-10-04 14:25:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:28,909 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 253 transitions. [2018-10-04 14:25:28,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-04 14:25:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 253 transitions. [2018-10-04 14:25:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-04 14:25:28,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:28,910 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1, 1, 1] [2018-10-04 14:25:28,910 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:28,910 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:28,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1107028914, now seen corresponding path program 96 times [2018-10-04 14:25:28,911 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:28,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:28,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 1321 proven. 4608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:29,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:29,392 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-04 14:25:29,401 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:29,581 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 14:25:29,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:29,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 1321 proven. 4608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:30,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:30,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-04 14:25:30,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:25:30,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:25:30,048 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:30,048 INFO L87 Difference]: Start difference. First operand 251 states and 253 transitions. Second operand 52 states. [2018-10-04 14:25:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:30,366 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2018-10-04 14:25:30,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:25:30,366 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 248 [2018-10-04 14:25:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:30,367 INFO L225 Difference]: With dead ends: 265 [2018-10-04 14:25:30,368 INFO L226 Difference]: Without dead ends: 259 [2018-10-04 14:25:30,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 50 [2018-10-04 14:25:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-04 14:25:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2018-10-04 14:25:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-04 14:25:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2018-10-04 14:25:30,393 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 248 [2018-10-04 14:25:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:30,394 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2018-10-04 14:25:30,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:25:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2018-10-04 14:25:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-04 14:25:30,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:30,395 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1] [2018-10-04 14:25:30,395 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:30,395 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:30,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1827811524, now seen corresponding path program 97 times [2018-10-04 14:25:30,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:30,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:30,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:30,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:30,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6125 backedges. 4900 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:32,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:32,107 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-04 14:25:32,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:32,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6125 backedges. 4900 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:32,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:32,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-10-04 14:25:32,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-04 14:25:32,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-04 14:25:32,655 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:32,655 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 102 states. [2018-10-04 14:25:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:35,667 INFO L93 Difference]: Finished difference Result 463 states and 467 transitions. [2018-10-04 14:25:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-04 14:25:35,667 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 252 [2018-10-04 14:25:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:35,668 INFO L225 Difference]: With dead ends: 463 [2018-10-04 14:25:35,668 INFO L226 Difference]: Without dead ends: 256 [2018-10-04 14:25:35,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 2.3s impTime 101 [2018-10-04 14:25:35,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-04 14:25:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-10-04 14:25:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-04 14:25:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 258 transitions. [2018-10-04 14:25:35,694 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 258 transitions. Word has length 252 [2018-10-04 14:25:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:35,694 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 258 transitions. [2018-10-04 14:25:35,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-04 14:25:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 258 transitions. [2018-10-04 14:25:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-04 14:25:35,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:35,696 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1, 1, 1] [2018-10-04 14:25:35,696 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:35,696 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:35,696 INFO L82 PathProgramCache]: Analyzing trace with hash -803659587, now seen corresponding path program 98 times [2018-10-04 14:25:35,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:35,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:35,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 1373 proven. 4802 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:36,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:36,200 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-04 14:25:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:36,346 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:36,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:36,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 1373 proven. 4802 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:36,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:36,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 14:25:36,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:25:36,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:25:36,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:36,980 INFO L87 Difference]: Start difference. First operand 256 states and 258 transitions. Second operand 53 states. [2018-10-04 14:25:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:37,311 INFO L93 Difference]: Finished difference Result 270 states and 273 transitions. [2018-10-04 14:25:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 14:25:37,311 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 253 [2018-10-04 14:25:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:37,312 INFO L225 Difference]: With dead ends: 270 [2018-10-04 14:25:37,312 INFO L226 Difference]: Without dead ends: 264 [2018-10-04 14:25:37,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.2s impTime 51 [2018-10-04 14:25:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-04 14:25:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2018-10-04 14:25:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-04 14:25:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 262 transitions. [2018-10-04 14:25:37,342 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 262 transitions. Word has length 253 [2018-10-04 14:25:37,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:37,343 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 262 transitions. [2018-10-04 14:25:37,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:25:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 262 transitions. [2018-10-04 14:25:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-04 14:25:37,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:37,344 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1] [2018-10-04 14:25:37,344 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:37,344 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash 465399219, now seen corresponding path program 99 times [2018-10-04 14:25:37,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:37,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:37,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:37,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6375 backedges. 5100 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:38,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:38,439 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-04 14:25:38,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:38,661 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-10-04 14:25:38,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:38,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6375 backedges. 5100 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:39,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2018-10-04 14:25:39,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-04 14:25:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-04 14:25:39,149 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:39,149 INFO L87 Difference]: Start difference. First operand 260 states and 262 transitions. Second operand 104 states. [2018-10-04 14:25:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:40,319 INFO L93 Difference]: Finished difference Result 472 states and 476 transitions. [2018-10-04 14:25:40,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-04 14:25:40,320 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 257 [2018-10-04 14:25:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:40,321 INFO L225 Difference]: With dead ends: 472 [2018-10-04 14:25:40,321 INFO L226 Difference]: Without dead ends: 261 [2018-10-04 14:25:40,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.2s impTime 103 [2018-10-04 14:25:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-04 14:25:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-10-04 14:25:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-04 14:25:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 263 transitions. [2018-10-04 14:25:40,348 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 263 transitions. Word has length 257 [2018-10-04 14:25:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:40,348 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 263 transitions. [2018-10-04 14:25:40,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-04 14:25:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 263 transitions. [2018-10-04 14:25:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-04 14:25:40,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:40,349 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1, 1, 1] [2018-10-04 14:25:40,349 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:40,350 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:40,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1064997210, now seen corresponding path program 100 times [2018-10-04 14:25:40,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:40,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:40,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:40,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:40,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 1426 proven. 5000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:40,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:40,997 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 14:25:41,003 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:41,130 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:41,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:41,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 1426 proven. 5000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:41,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:41,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-04 14:25:41,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 14:25:41,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 14:25:41,862 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:41,863 INFO L87 Difference]: Start difference. First operand 261 states and 263 transitions. Second operand 54 states. [2018-10-04 14:25:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:42,185 INFO L93 Difference]: Finished difference Result 275 states and 278 transitions. [2018-10-04 14:25:42,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 14:25:42,185 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 258 [2018-10-04 14:25:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:42,186 INFO L225 Difference]: With dead ends: 275 [2018-10-04 14:25:42,186 INFO L226 Difference]: Without dead ends: 269 [2018-10-04 14:25:42,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.3s impTime 52 [2018-10-04 14:25:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-04 14:25:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2018-10-04 14:25:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-04 14:25:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 267 transitions. [2018-10-04 14:25:42,211 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 267 transitions. Word has length 258 [2018-10-04 14:25:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:42,212 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 267 transitions. [2018-10-04 14:25:42,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 14:25:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 267 transitions. [2018-10-04 14:25:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-04 14:25:42,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:42,213 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1] [2018-10-04 14:25:42,213 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:42,213 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:42,213 INFO L82 PathProgramCache]: Analyzing trace with hash 629884880, now seen corresponding path program 101 times [2018-10-04 14:25:42,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:42,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:42,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:42,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6630 backedges. 5304 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:43,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:43,403 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-04 14:25:43,410 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:43,721 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2018-10-04 14:25:43,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:43,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6630 backedges. 5304 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2018-10-04 14:25:44,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-04 14:25:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-04 14:25:44,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:44,391 INFO L87 Difference]: Start difference. First operand 265 states and 267 transitions. Second operand 106 states. [2018-10-04 14:25:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:47,925 INFO L93 Difference]: Finished difference Result 481 states and 485 transitions. [2018-10-04 14:25:47,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-04 14:25:47,925 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 262 [2018-10-04 14:25:47,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:47,925 INFO L225 Difference]: With dead ends: 481 [2018-10-04 14:25:47,925 INFO L226 Difference]: Without dead ends: 266 [2018-10-04 14:25:47,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.0s impTime 105 [2018-10-04 14:25:47,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-04 14:25:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2018-10-04 14:25:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-04 14:25:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 268 transitions. [2018-10-04 14:25:47,958 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 268 transitions. Word has length 262 [2018-10-04 14:25:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:47,959 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 268 transitions. [2018-10-04 14:25:47,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-04 14:25:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 268 transitions. [2018-10-04 14:25:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-04 14:25:47,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:47,960 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1, 1, 1] [2018-10-04 14:25:47,960 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:47,960 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1501211511, now seen corresponding path program 102 times [2018-10-04 14:25:47,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:47,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:47,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6682 backedges. 1480 proven. 5202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:48,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:48,663 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-04 14:25:48,670 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:48,872 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2018-10-04 14:25:48,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:48,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6682 backedges. 1480 proven. 5202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:49,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:49,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-04 14:25:49,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-04 14:25:49,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-04 14:25:49,357 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:49,357 INFO L87 Difference]: Start difference. First operand 266 states and 268 transitions. Second operand 55 states. [2018-10-04 14:25:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:49,710 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2018-10-04 14:25:49,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 14:25:49,710 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 263 [2018-10-04 14:25:49,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:49,711 INFO L225 Difference]: With dead ends: 280 [2018-10-04 14:25:49,711 INFO L226 Difference]: Without dead ends: 274 [2018-10-04 14:25:49,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.3s impTime 53 [2018-10-04 14:25:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-04 14:25:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2018-10-04 14:25:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-04 14:25:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 272 transitions. [2018-10-04 14:25:49,742 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 272 transitions. Word has length 263 [2018-10-04 14:25:49,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:49,742 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 272 transitions. [2018-10-04 14:25:49,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-04 14:25:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 272 transitions. [2018-10-04 14:25:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-04 14:25:49,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:49,743 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 1, 1, 1, 1, 1] [2018-10-04 14:25:49,744 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:49,744 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1240278145, now seen corresponding path program 103 times [2018-10-04 14:25:49,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:49,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:49,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:49,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:49,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6890 backedges. 5512 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:51,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:51,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 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-04 14:25:51,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:51,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6890 backedges. 5512 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:52,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:52,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2018-10-04 14:25:52,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-04 14:25:52,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-04 14:25:52,357 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:52,357 INFO L87 Difference]: Start difference. First operand 270 states and 272 transitions. Second operand 108 states. [2018-10-04 14:25:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:55,518 INFO L93 Difference]: Finished difference Result 490 states and 494 transitions. [2018-10-04 14:25:55,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-04 14:25:55,518 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 267 [2018-10-04 14:25:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:55,519 INFO L225 Difference]: With dead ends: 490 [2018-10-04 14:25:55,519 INFO L226 Difference]: Without dead ends: 271 [2018-10-04 14:25:55,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 2.5s impTime 107 [2018-10-04 14:25:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-04 14:25:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-10-04 14:25:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-04 14:25:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 273 transitions. [2018-10-04 14:25:55,547 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 273 transitions. Word has length 267 [2018-10-04 14:25:55,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:55,547 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 273 transitions. [2018-10-04 14:25:55,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-04 14:25:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 273 transitions. [2018-10-04 14:25:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-04 14:25:55,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:55,548 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1, 1, 1] [2018-10-04 14:25:55,549 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:55,549 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1999690342, now seen corresponding path program 104 times [2018-10-04 14:25:55,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:55,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:55,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6943 backedges. 1535 proven. 5408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:56,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:56,075 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-04 14:25:56,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:56,207 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:56,207 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:56,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6943 backedges. 1535 proven. 5408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:56,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:56,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-04 14:25:56,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 14:25:56,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 14:25:56,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:56,690 INFO L87 Difference]: Start difference. First operand 271 states and 273 transitions. Second operand 56 states. [2018-10-04 14:25:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:57,205 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2018-10-04 14:25:57,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 14:25:57,205 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 268 [2018-10-04 14:25:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:57,206 INFO L225 Difference]: With dead ends: 285 [2018-10-04 14:25:57,206 INFO L226 Difference]: Without dead ends: 279 [2018-10-04 14:25:57,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 54 [2018-10-04 14:25:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-04 14:25:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2018-10-04 14:25:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-04 14:25:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 277 transitions. [2018-10-04 14:25:57,235 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 277 transitions. Word has length 268 [2018-10-04 14:25:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:57,236 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 277 transitions. [2018-10-04 14:25:57,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 14:25:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 277 transitions. [2018-10-04 14:25:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-04 14:25:57,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:57,237 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 1, 1, 1, 1, 1] [2018-10-04 14:25:57,237 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:57,237 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1751242020, now seen corresponding path program 105 times [2018-10-04 14:25:57,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:57,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:57,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:57,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:57,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7155 backedges. 5724 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:59,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:59,331 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-04 14:25:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:59,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-10-04 14:25:59,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:59,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7155 backedges. 5724 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:00,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:00,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2018-10-04 14:26:00,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-04 14:26:00,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-04 14:26:00,044 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:00,044 INFO L87 Difference]: Start difference. First operand 275 states and 277 transitions. Second operand 110 states. [2018-10-04 14:26:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:03,580 INFO L93 Difference]: Finished difference Result 499 states and 503 transitions. [2018-10-04 14:26:03,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-04 14:26:03,580 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 272 [2018-10-04 14:26:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:03,580 INFO L225 Difference]: With dead ends: 499 [2018-10-04 14:26:03,580 INFO L226 Difference]: Without dead ends: 276 [2018-10-04 14:26:03,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 2.8s impTime 109 [2018-10-04 14:26:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-04 14:26:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-10-04 14:26:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-04 14:26:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2018-10-04 14:26:03,618 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2018-10-04 14:26:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:03,618 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2018-10-04 14:26:03,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-04 14:26:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2018-10-04 14:26:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-04 14:26:03,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:03,619 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1, 1, 1] [2018-10-04 14:26:03,619 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:03,619 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:03,619 INFO L82 PathProgramCache]: Analyzing trace with hash -104962987, now seen corresponding path program 106 times [2018-10-04 14:26:03,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:03,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:03,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:03,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:03,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 1591 proven. 5618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:04,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:04,130 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-04 14:26:04,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:26:04,266 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:26:04,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:04,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 1591 proven. 5618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:04,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:04,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-04 14:26:04,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 14:26:04,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 14:26:04,741 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:04,741 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 57 states. [2018-10-04 14:26:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:05,185 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2018-10-04 14:26:05,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 14:26:05,186 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 273 [2018-10-04 14:26:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:05,186 INFO L225 Difference]: With dead ends: 290 [2018-10-04 14:26:05,186 INFO L226 Difference]: Without dead ends: 284 [2018-10-04 14:26:05,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.2s impTime 55 [2018-10-04 14:26:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-04 14:26:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 280. [2018-10-04 14:26:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-04 14:26:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 282 transitions. [2018-10-04 14:26:05,216 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 282 transitions. Word has length 273 [2018-10-04 14:26:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:05,216 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 282 transitions. [2018-10-04 14:26:05,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 14:26:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 282 transitions. [2018-10-04 14:26:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-04 14:26:05,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:05,217 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 1, 1, 1, 1, 1] [2018-10-04 14:26:05,218 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:05,218 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1553521333, now seen corresponding path program 107 times [2018-10-04 14:26:05,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:05,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:05,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:05,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:05,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7425 backedges. 5940 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:07,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:07,055 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-04 14:26:07,061 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:26:07,280 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2018-10-04 14:26:07,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:07,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7425 backedges. 5940 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:07,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:07,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2018-10-04 14:26:07,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-04 14:26:07,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-04 14:26:07,864 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:07,864 INFO L87 Difference]: Start difference. First operand 280 states and 282 transitions. Second operand 112 states. [2018-10-04 14:26:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:11,450 INFO L93 Difference]: Finished difference Result 508 states and 512 transitions. [2018-10-04 14:26:11,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-04 14:26:11,451 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 277 [2018-10-04 14:26:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:11,451 INFO L225 Difference]: With dead ends: 508 [2018-10-04 14:26:11,451 INFO L226 Difference]: Without dead ends: 281 [2018-10-04 14:26:11,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s Time 2.5s impTime 111 [2018-10-04 14:26:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-04 14:26:11,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-10-04 14:26:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-04 14:26:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 283 transitions. [2018-10-04 14:26:11,481 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 283 transitions. Word has length 277 [2018-10-04 14:26:11,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:11,481 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 283 transitions. [2018-10-04 14:26:11,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-04 14:26:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 283 transitions. [2018-10-04 14:26:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-04 14:26:11,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:11,482 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1, 1, 1] [2018-10-04 14:26:11,483 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:11,483 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:11,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1476595854, now seen corresponding path program 108 times [2018-10-04 14:26:11,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:11,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:11,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:11,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:11,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7480 backedges. 1648 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:12,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:12,119 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-04 14:26:12,126 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:26:12,347 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-04 14:26:12,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:12,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7480 backedges. 1648 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:12,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:12,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-04 14:26:12,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 14:26:12,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 14:26:12,877 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:12,877 INFO L87 Difference]: Start difference. First operand 281 states and 283 transitions. Second operand 58 states. [2018-10-04 14:26:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:13,262 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2018-10-04 14:26:13,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 14:26:13,262 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 278 [2018-10-04 14:26:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:13,263 INFO L225 Difference]: With dead ends: 295 [2018-10-04 14:26:13,263 INFO L226 Difference]: Without dead ends: 289 [2018-10-04 14:26:13,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.3s impTime 56 [2018-10-04 14:26:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-04 14:26:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2018-10-04 14:26:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-04 14:26:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 287 transitions. [2018-10-04 14:26:13,295 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 287 transitions. Word has length 278 [2018-10-04 14:26:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:13,295 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 287 transitions. [2018-10-04 14:26:13,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 14:26:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 287 transitions. [2018-10-04 14:26:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-04 14:26:13,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:13,296 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 1, 1, 1, 1, 1] [2018-10-04 14:26:13,296 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:13,296 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:13,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1426007576, now seen corresponding path program 109 times [2018-10-04 14:26:13,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:13,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:13,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:13,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:13,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7700 backedges. 6160 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:15,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:15,378 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 14:26:15,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:15,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7700 backedges. 6160 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:15,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:15,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2018-10-04 14:26:15,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-04 14:26:15,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-04 14:26:15,999 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:15,999 INFO L87 Difference]: Start difference. First operand 285 states and 287 transitions. Second operand 114 states. [2018-10-04 14:26:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:19,987 INFO L93 Difference]: Finished difference Result 517 states and 521 transitions. [2018-10-04 14:26:19,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-04 14:26:19,987 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 282 [2018-10-04 14:26:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:19,988 INFO L225 Difference]: With dead ends: 517 [2018-10-04 14:26:19,988 INFO L226 Difference]: Without dead ends: 286 [2018-10-04 14:26:19,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s Time 2.8s impTime 113 [2018-10-04 14:26:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-04 14:26:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-10-04 14:26:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-04 14:26:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 288 transitions. [2018-10-04 14:26:20,020 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 288 transitions. Word has length 282 [2018-10-04 14:26:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:20,021 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 288 transitions. [2018-10-04 14:26:20,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-04 14:26:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 288 transitions. [2018-10-04 14:26:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-04 14:26:20,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:20,022 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1, 1, 1] [2018-10-04 14:26:20,022 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:20,022 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:20,022 INFO L82 PathProgramCache]: Analyzing trace with hash 822497313, now seen corresponding path program 110 times [2018-10-04 14:26:20,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:20,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:20,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:20,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:26:20,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7756 backedges. 1706 proven. 6050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:20,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:20,676 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-04 14:26:20,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:26:20,810 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:26:20,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:20,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7756 backedges. 1706 proven. 6050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:21,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:21,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-04 14:26:21,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-04 14:26:21,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-04 14:26:21,303 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:21,303 INFO L87 Difference]: Start difference. First operand 286 states and 288 transitions. Second operand 59 states. [2018-10-04 14:26:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:21,671 INFO L93 Difference]: Finished difference Result 300 states and 303 transitions. [2018-10-04 14:26:21,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 14:26:21,671 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 283 [2018-10-04 14:26:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:21,672 INFO L225 Difference]: With dead ends: 300 [2018-10-04 14:26:21,672 INFO L226 Difference]: Without dead ends: 294 [2018-10-04 14:26:21,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.3s impTime 57 [2018-10-04 14:26:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-04 14:26:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2018-10-04 14:26:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-04 14:26:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 292 transitions. [2018-10-04 14:26:21,705 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 292 transitions. Word has length 283 [2018-10-04 14:26:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:21,706 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 292 transitions. [2018-10-04 14:26:21,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-04 14:26:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 292 transitions. [2018-10-04 14:26:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-04 14:26:21,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:21,707 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 1, 1, 1, 1, 1] [2018-10-04 14:26:21,707 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:21,707 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash -637777129, now seen corresponding path program 111 times [2018-10-04 14:26:21,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:21,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:21,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:21,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:21,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7980 backedges. 6384 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:23,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:23,879 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-04 14:26:23,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:26:24,152 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-10-04 14:26:24,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:24,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7980 backedges. 6384 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:24,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:24,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2018-10-04 14:26:24,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-04 14:26:24,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-04 14:26:24,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:24,647 INFO L87 Difference]: Start difference. First operand 290 states and 292 transitions. Second operand 116 states. [2018-10-04 14:26:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:28,638 INFO L93 Difference]: Finished difference Result 526 states and 530 transitions. [2018-10-04 14:26:28,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-04 14:26:28,638 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 287 [2018-10-04 14:26:28,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:28,639 INFO L225 Difference]: With dead ends: 526 [2018-10-04 14:26:28,639 INFO L226 Difference]: Without dead ends: 291 [2018-10-04 14:26:28,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time 3.0s impTime 115 [2018-10-04 14:26:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-04 14:26:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-10-04 14:26:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-04 14:26:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 293 transitions. [2018-10-04 14:26:28,671 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 293 transitions. Word has length 287 [2018-10-04 14:26:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:28,671 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 293 transitions. [2018-10-04 14:26:28,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-04 14:26:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 293 transitions. [2018-10-04 14:26:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-04 14:26:28,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:28,672 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1, 1, 1] [2018-10-04 14:26:28,672 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:28,672 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash 204787838, now seen corresponding path program 112 times [2018-10-04 14:26:28,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:28,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:28,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:28,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:28,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8037 backedges. 1765 proven. 6272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:29,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:29,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 14:26:29,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:26:29,534 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:26:29,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:29,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:26:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8037 backedges. 1765 proven. 6272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:30,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:26:30,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-04 14:26:30,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 14:26:30,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 14:26:30,062 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:26:30,062 INFO L87 Difference]: Start difference. First operand 291 states and 293 transitions. Second operand 60 states. [2018-10-04 14:26:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:26:30,489 INFO L93 Difference]: Finished difference Result 305 states and 308 transitions. [2018-10-04 14:26:30,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 14:26:30,489 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 288 [2018-10-04 14:26:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:26:30,490 INFO L225 Difference]: With dead ends: 305 [2018-10-04 14:26:30,490 INFO L226 Difference]: Without dead ends: 299 [2018-10-04 14:26:30,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.3s impTime 58 [2018-10-04 14:26:30,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-04 14:26:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2018-10-04 14:26:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-04 14:26:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 297 transitions. [2018-10-04 14:26:30,525 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 297 transitions. Word has length 288 [2018-10-04 14:26:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:26:30,525 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 297 transitions. [2018-10-04 14:26:30,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 14:26:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 297 transitions. [2018-10-04 14:26:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-04 14:26:30,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:26:30,526 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 1, 1, 1, 1, 1] [2018-10-04 14:26:30,527 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:26:30,527 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:26:30,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2131318004, now seen corresponding path program 113 times [2018-10-04 14:26:30,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:26:30,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:26:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:30,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:26:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:26:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:26:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8265 backedges. 6612 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:26:32,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:26:32,393 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 14:26:32,400 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:26:32,614 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2018-10-04 14:26:32,614 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:26:32,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-10-04 14:26:32,861 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-04 14:26:33,062 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 114 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:26:33,063 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 14:26:33,069 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 14:26:33,069 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:26:33 BoogieIcfgContainer [2018-10-04 14:26:33,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:26:33,070 INFO L168 Benchmark]: Toolchain (without parser) took 238040.82 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 330.3 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 264.7 MB). Peak memory consumption was 595.0 MB. Max. memory is 7.1 GB. [2018-10-04 14:26:33,072 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:26:33,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:26:33,073 INFO L168 Benchmark]: Boogie Preprocessor took 19.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:26:33,074 INFO L168 Benchmark]: RCFGBuilder took 403.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:26:33,074 INFO L168 Benchmark]: TraceAbstraction took 237573.28 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 330.3 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.5 MB). Peak memory consumption was 573.8 MB. Max. memory is 7.1 GB. [2018-10-04 14:26:33,077 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 403.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 237573.28 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 330.3 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.5 MB). Peak memory consumption was 573.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 76). Cancelled while BasicCegarLoop was analyzing trace of length 293 with TraceHistMax 58, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. TIMEOUT Result, 237.4s OverallTime, 117 OverallIterations, 58 TraceHistogramMax, 98.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3784 SDtfs, 8940 SDslu, 77633 SDs, 0 SdLazy, 84745 SolverSat, 1979 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25074 GetRequests, 18401 SyntacticMatches, 0 SemanticMatches, 6673 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 138.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=116, 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: 1.8s AutomataMinimizationTime, 116 MinimizatonAttempts, 234 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.8s SsaConstructionTime, 10.4s SatisfiabilityAnalysisTime, 115.6s InterpolantComputationTime, 33630 NumberOfCodeBlocks, 33630 NumberOfCodeBlocksAsserted, 1843 NumberOfCheckSat, 33402 ConstructedInterpolants, 0 QuantifiedInterpolants, 19075034 SizeOfPredicates, 224 NumberOfNonLiveVariables, 53592 ConjunctsInSsa, 6776 ConjunctsInUnsatCore, 228 InterpolantComputations, 4 PerfectInterpolantSequences, 318250/620426 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/down.i_4.bplTransformedIcfg_BEv2_5.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-26-33-087.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/down.i_4.bplTransformedIcfg_BEv2_5.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-26-33-087.csv Completed graceful shutdown